utils.go 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164
  1. package main
  2. import (
  3. "fmt"
  4. "sync"
  5. "unicode"
  6. )
  7. const gitEmptyTree = "4b825dc642cb6eb9a060e54bf8d69288fbee4904"
  8. type mapStringSet map[string]stringSet
  9. type intRange struct {
  10. min int
  11. max int
  12. }
  13. func makeIntRange(min, max int) intRange {
  14. return intRange{
  15. min,
  16. max,
  17. }
  18. }
  19. func (r intRange) get(n int) bool {
  20. return n >= r.min && n <= r.max
  21. }
  22. type intRanges []intRange
  23. func (rs intRanges) get(n int) bool {
  24. for _, r := range rs {
  25. if r.get(n) {
  26. return true
  27. }
  28. }
  29. return false
  30. }
  31. func min(a, b int) int {
  32. if a < b {
  33. return a
  34. }
  35. return b
  36. }
  37. func max(a, b int) int {
  38. if a < b {
  39. return b
  40. }
  41. return a
  42. }
  43. func (mss mapStringSet) Add(n string, v string) {
  44. _, ok := mss[n]
  45. if !ok {
  46. mss[n] = make(stringSet)
  47. }
  48. mss[n].set(v)
  49. }
  50. func lessRunes(iRunes, jRunes []rune) bool {
  51. max := len(iRunes)
  52. if max > len(jRunes) {
  53. max = len(jRunes)
  54. }
  55. for idx := 0; idx < max; idx++ {
  56. ir := iRunes[idx]
  57. jr := jRunes[idx]
  58. lir := unicode.ToLower(ir)
  59. ljr := unicode.ToLower(jr)
  60. if lir != ljr {
  61. return lir < ljr
  62. }
  63. // the lowercase runes are the same, so compare the original
  64. if ir != jr {
  65. return ir < jr
  66. }
  67. }
  68. return len(iRunes) < len(jRunes)
  69. }
  70. func stringSliceEqual(a, b []string) bool {
  71. if a == nil && b == nil {
  72. return true
  73. }
  74. if a == nil || b == nil {
  75. return false
  76. }
  77. if len(a) != len(b) {
  78. return false
  79. }
  80. for i := 0; i < len(a); i++ {
  81. if a[i] != b[i] {
  82. return false
  83. }
  84. }
  85. return true
  86. }
  87. func removeInvalidTargets(targets []string) []string {
  88. filteredTargets := make([]string, 0)
  89. for _, target := range targets {
  90. db, _ := splitDBFromName(target)
  91. if db == "aur" && mode == modeRepo {
  92. fmt.Printf("%s %s %s\n", bold(yellow(arrow)), cyan(target), bold("Can't use target with option --repo -- skipping"))
  93. continue
  94. }
  95. if db != "aur" && db != "" && mode == modeAUR {
  96. fmt.Printf("%s %s %s\n", bold(yellow(arrow)), cyan(target), bold("Can't use target with option --aur -- skipping"))
  97. continue
  98. }
  99. filteredTargets = append(filteredTargets, target)
  100. }
  101. return filteredTargets
  102. }
  103. type MultiError struct {
  104. Errors []error
  105. mux sync.Mutex
  106. }
  107. func (err *MultiError) Error() string {
  108. str := ""
  109. for _, e := range err.Errors {
  110. str += e.Error() + "\n"
  111. }
  112. return str[:len(str)-1]
  113. }
  114. func (err *MultiError) Add(e error) {
  115. if e == nil {
  116. return
  117. }
  118. err.mux.Lock()
  119. err.Errors = append(err.Errors, e)
  120. err.mux.Unlock()
  121. }
  122. func (err *MultiError) Return() error {
  123. if len(err.Errors) > 0 {
  124. return err
  125. }
  126. return nil
  127. }