matching.go 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687
  1. package matching
  2. import (
  3. "sort"
  4. "github.com/nbutton23/zxcvbn-go/adjacency"
  5. "github.com/nbutton23/zxcvbn-go/frequency"
  6. "github.com/nbutton23/zxcvbn-go/match"
  7. )
  8. var (
  9. DICTIONARY_MATCHERS []match.Matcher
  10. MATCHERS []match.Matcher
  11. ADJACENCY_GRAPHS []adjacency.AdjacencyGraph
  12. L33T_TABLE adjacency.AdjacencyGraph
  13. SEQUENCES map[string]string
  14. )
  15. const (
  16. DATE_RX_YEAR_SUFFIX string = `((\d{1,2})(\s|-|\/|\\|_|\.)(\d{1,2})(\s|-|\/|\\|_|\.)(19\d{2}|200\d|201\d|\d{2}))`
  17. DATE_RX_YEAR_PREFIX string = `((19\d{2}|200\d|201\d|\d{2})(\s|-|/|\\|_|\.)(\d{1,2})(\s|-|/|\\|_|\.)(\d{1,2}))`
  18. DATE_WITHOUT_SEP_MATCH string = `\d{4,8}`
  19. )
  20. func init() {
  21. loadFrequencyList()
  22. }
  23. func Omnimatch(password string, userInputs []string, filters ...func(match.Matcher) bool) (matches []match.Match) {
  24. //Can I run into the issue where nil is not equal to nil?
  25. if DICTIONARY_MATCHERS == nil || ADJACENCY_GRAPHS == nil {
  26. loadFrequencyList()
  27. }
  28. if userInputs != nil {
  29. userInputMatcher := buildDictMatcher("user_inputs", buildRankedDict(userInputs))
  30. matches = userInputMatcher(password)
  31. }
  32. for _, matcher := range MATCHERS {
  33. shouldBeFiltered := false
  34. for i := range filters {
  35. if filters[i](matcher) {
  36. shouldBeFiltered = true
  37. break
  38. }
  39. }
  40. if !shouldBeFiltered {
  41. matches = append(matches, matcher.MatchingFunc(password)...)
  42. }
  43. }
  44. sort.Sort(match.Matches(matches))
  45. return matches
  46. }
  47. func loadFrequencyList() {
  48. for n, list := range frequency.FrequencyLists {
  49. DICTIONARY_MATCHERS = append(DICTIONARY_MATCHERS, match.Matcher{MatchingFunc: buildDictMatcher(n, buildRankedDict(list.List)), ID: n})
  50. }
  51. L33T_TABLE = adjacency.AdjacencyGph["l33t"]
  52. ADJACENCY_GRAPHS = append(ADJACENCY_GRAPHS, adjacency.AdjacencyGph["qwerty"])
  53. ADJACENCY_GRAPHS = append(ADJACENCY_GRAPHS, adjacency.AdjacencyGph["dvorak"])
  54. ADJACENCY_GRAPHS = append(ADJACENCY_GRAPHS, adjacency.AdjacencyGph["keypad"])
  55. ADJACENCY_GRAPHS = append(ADJACENCY_GRAPHS, adjacency.AdjacencyGph["macKeypad"])
  56. //l33tFilePath, _ := filepath.Abs("adjacency/L33t.json")
  57. //L33T_TABLE = adjacency.GetAdjancencyGraphFromFile(l33tFilePath, "l33t")
  58. SEQUENCES = make(map[string]string)
  59. SEQUENCES["lower"] = "abcdefghijklmnopqrstuvwxyz"
  60. SEQUENCES["upper"] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
  61. SEQUENCES["digits"] = "0123456789"
  62. MATCHERS = append(MATCHERS, DICTIONARY_MATCHERS...)
  63. MATCHERS = append(MATCHERS, match.Matcher{MatchingFunc: spatialMatch, ID: SPATIAL_MATCHER_NAME})
  64. MATCHERS = append(MATCHERS, match.Matcher{MatchingFunc: repeatMatch, ID: REPEAT_MATCHER_NAME})
  65. MATCHERS = append(MATCHERS, match.Matcher{MatchingFunc: sequenceMatch, ID: SEQUENCE_MATCHER_NAME})
  66. MATCHERS = append(MATCHERS, match.Matcher{MatchingFunc: l33tMatch, ID: L33T_MATCHER_NAME})
  67. MATCHERS = append(MATCHERS, match.Matcher{MatchingFunc: dateSepMatcher, ID: DATESEP_MATCHER_NAME})
  68. MATCHERS = append(MATCHERS, match.Matcher{MatchingFunc: dateWithoutSepMatch, ID: DATEWITHOUTSEP_MATCHER_NAME})
  69. }