rules.go 1.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
  1. // Copyright 2020 Jebbs. All rights reserved.
  2. // Use of this source code is governed by MIT
  3. // license that can be found in the LICENSE file.
  4. package merge
  5. import "fmt"
  6. const (
  7. priorityKey string = "_priority"
  8. tagKey string = "_tag"
  9. )
  10. // ApplyRules applies merge rules according to _tag, _priority fields, and remove them
  11. func ApplyRules(m map[string]interface{}) error {
  12. err := sortMergeSlices(m, "")
  13. if err != nil {
  14. return err
  15. }
  16. removeHelperFields(m)
  17. return nil
  18. }
  19. // sortMergeSlices enumerates all slices in a map, to sort by priority and merge by tag
  20. func sortMergeSlices(target map[string]interface{}, path string) error {
  21. for key, value := range target {
  22. if slice, ok := value.([]interface{}); ok {
  23. sortByPriority(slice)
  24. s, err := mergeSameTag(slice, fmt.Sprintf("%s.%s", path, key))
  25. if err != nil {
  26. return err
  27. }
  28. target[key] = s
  29. for _, item := range s {
  30. if m, ok := item.(map[string]interface{}); ok {
  31. sortMergeSlices(m, fmt.Sprintf("%s.%s[]", path, key))
  32. }
  33. }
  34. } else if field, ok := value.(map[string]interface{}); ok {
  35. sortMergeSlices(field, fmt.Sprintf("%s.%s", path, key))
  36. }
  37. }
  38. return nil
  39. }
  40. func removeHelperFields(target map[string]interface{}) {
  41. for key, value := range target {
  42. if key == priorityKey || key == tagKey {
  43. delete(target, key)
  44. } else if slice, ok := value.([]interface{}); ok {
  45. for _, e := range slice {
  46. if el, ok := e.(map[string]interface{}); ok {
  47. removeHelperFields(el)
  48. }
  49. }
  50. } else if field, ok := value.(map[string]interface{}); ok {
  51. removeHelperFields(field)
  52. }
  53. }
  54. }