fuzzySearch.js 1.6 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
  1. var filter = require('./filter');
  2. var map = require('./map');
  3. var isStr = require('./isStr');
  4. var safeGet = require('./safeGet');
  5. var levenshtein = require('./levenshtein');
  6. var pluck = require('./pluck');
  7. exports = function(needle, haystacks) {
  8. var options =
  9. arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};
  10. if (!options.caseSensitive) {
  11. needle = needle.toLowerCase();
  12. }
  13. haystacks = map(haystacks, function(haystack) {
  14. var string = toStr(haystack, options);
  15. if (!options.caseSensitive) {
  16. string = string.toLowerCase();
  17. }
  18. return {
  19. value: haystack,
  20. levenshtein: levenshtein(needle, string),
  21. string: string
  22. };
  23. });
  24. haystacks = filter(haystacks, function(haystack) {
  25. return hasAllLetters(needle, haystack.string, options);
  26. });
  27. haystacks.sort(function(a, b) {
  28. return a.levenshtein - b.levenshtein;
  29. });
  30. return pluck(haystacks, 'value');
  31. };
  32. function toStr(haystack, options) {
  33. if (isStr(haystack)) return haystack;
  34. return safeGet(haystack, options.key) || '';
  35. }
  36. function hasAllLetters(needle, haystack) {
  37. var hLen = haystack.length;
  38. var nLen = needle.length;
  39. if (nLen > hLen) return false;
  40. if (nLen === hLen) return needle === haystack;
  41. for (var i = 0, j = 0; i < nLen; i++) {
  42. var c = needle.charCodeAt(i);
  43. var has = false;
  44. while (j < hLen) {
  45. if (haystack.charCodeAt(j++) === c) {
  46. has = true;
  47. break;
  48. }
  49. }
  50. if (!has) return false;
  51. }
  52. return true;
  53. }
  54. module.exports = exports;