|
| 1 | +package src |
| 2 | + |
| 3 | +import ( |
| 4 | + "fmt" |
| 5 | + "sort" |
| 6 | +) |
| 7 | + |
| 8 | +type Diff struct { |
| 9 | + Difference string |
| 10 | + Message string |
| 11 | +} |
| 12 | + |
| 13 | +func Compare(obj1, obj2 map[string]interface{}, basePath string) []Diff { |
| 14 | + var diffs []Diff |
| 15 | + |
| 16 | + // Создаём множество ключей из обеих map |
| 17 | + uniqueKeys := make(map[string]struct{}) // Убираю дубликаты ключей |
| 18 | + for key := range obj1 { |
| 19 | + uniqueKeys[key] = struct{}{} |
| 20 | + } |
| 21 | + for key := range obj2 { |
| 22 | + uniqueKeys[key] = struct{}{} |
| 23 | + } |
| 24 | + commonKeys := make([]string, 0, len(uniqueKeys)) //Сразу аллоцирую память под известное количество элементов |
| 25 | + for key := range uniqueKeys { |
| 26 | + commonKeys = append(commonKeys, key) |
| 27 | + } |
| 28 | + // Сортируем ключи в алфавитном порядке |
| 29 | + sort.Slice(commonKeys, func(i, j int) bool { |
| 30 | + return commonKeys[i] < commonKeys[j] |
| 31 | + }) |
| 32 | + repeatedKeys := make(map[string]bool) //для обработки повторяющихся ключей |
| 33 | + for _, key := range commonKeys { |
| 34 | + if repeatedKeys[key] { |
| 35 | + continue |
| 36 | + } |
| 37 | + |
| 38 | + value1, ok := obj1[key] |
| 39 | + value2, yes := obj2[key] |
| 40 | + currentPath := buildPath(basePath, key) |
| 41 | + |
| 42 | + if isObject(value2) && isObject(value1) { |
| 43 | + o1 := value1.(map[string]interface{}) |
| 44 | + o2 := value2.(map[string]interface{}) |
| 45 | + childDiff := Compare(o1, o2, currentPath) // рекурсивный шаг |
| 46 | + diffs = append(diffs, childDiff...) |
| 47 | + repeatedKeys[key] = true |
| 48 | + continue |
| 49 | + } |
| 50 | + switch { |
| 51 | + case !ok && yes: |
| 52 | + strData2 := fmt.Sprintf(" + %v: %v", key, value2) |
| 53 | + diffs = append(diffs, Diff{Difference: strData2, Message: "# Добавлена"}) |
| 54 | + case ok && !yes: |
| 55 | + strData1 := fmt.Sprintf(" - %v: %v", key, value1) |
| 56 | + diffs = append(diffs, Diff{Difference: strData1, Message: "# Удалена"}) |
| 57 | + |
| 58 | + default: |
| 59 | + isSimple1 := simpleType(value1) |
| 60 | + isSimple2 := simpleType(value2) |
| 61 | + // Оба простых типа и значения не равны |
| 62 | + if isSimple1 && isSimple2 && value1 != value2 { |
| 63 | + strData1 := fmt.Sprintf(" - %v: %v", key, value1) |
| 64 | + diffs = append(diffs, Diff{Difference: strData1, Message: "# Старое значение"}) |
| 65 | + strData2 := fmt.Sprintf(" + %v: %v", key, value2) |
| 66 | + diffs = append(diffs, Diff{Difference: strData2, Message: "# Новое значение"}) |
| 67 | + // Оба простых типа и значения равны |
| 68 | + } else if isSimple1 && isSimple2 && value1 == value2 { |
| 69 | + strData1 := fmt.Sprintf(" %v: %v", key, value1) |
| 70 | + diffs = append(diffs, Diff{Difference: strData1, Message: ""}) |
| 71 | + // Если оба типа и не простые типы и не объекты |
| 72 | + } else { |
| 73 | + strData1 := fmt.Sprintf(" - %v: %v", key, value1) |
| 74 | + diffs = append(diffs, Diff{Difference: strData1, Message: "# Старое значение"}) |
| 75 | + strData2 := fmt.Sprintf(" + %v: %v", key, value2) |
| 76 | + diffs = append(diffs, Diff{Difference: strData2, Message: "# Новое значение"}) |
| 77 | + } |
| 78 | + } |
| 79 | + } |
| 80 | + return diffs |
| 81 | +} |
| 82 | + |
| 83 | +func buildPath(basePath, key string) string { |
| 84 | + if basePath == "" { |
| 85 | + return key |
| 86 | + } |
| 87 | + return basePath + "." + key |
| 88 | +} |
| 89 | + |
| 90 | +func simpleType(value interface{}) bool { |
| 91 | + switch value.(type) { |
| 92 | + case string, int, int8, int16, int32, int64, float32, float64, bool: |
| 93 | + return true |
| 94 | + default: |
| 95 | + return false |
| 96 | + } |
| 97 | +} |
| 98 | + |
| 99 | +func isArray(value interface{}) bool { |
| 100 | + _, ok := value.([]interface{}) |
| 101 | + if ok { |
| 102 | + return true |
| 103 | + } else { |
| 104 | + return false |
| 105 | + } |
| 106 | +} |
| 107 | + |
| 108 | +func isObject(value interface{}) bool { |
| 109 | + _, ok := value.(map[string]interface{}) |
| 110 | + if ok { |
| 111 | + return true |
| 112 | + } else { |
| 113 | + return false |
| 114 | + } |
| 115 | +} |
0 commit comments