Merge pull request #51 from DebidYadav/main

Add. Search Bar using JavaScript

Author: Chayandas07

.talismanrc

@@ -0,0 +1,4 @@
+fileignoreconfig:
+- filename: Search Bar/yarn.lock
+  checksum: 3aa2a354bcdab7bc6969ff6cbc8ba618498bb208105009d18f57ad441ac2d061
+version: ""

Search Bar/.DS_Store

@@ -0,0 +1,3 @@
+node_modules
+package-lock.json
+

Search Bar/.gitignore

@@ -0,0 +1,322 @@
+(function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c="function"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error("Cannot find module '"+i+"'");throw a.code="MODULE_NOT_FOUND",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u="function"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){
+const createTrie = require('autosuggest-trie');
+const levenshtein = require('js-levenshtein');
+
+window.createTrie = createTrie;
+window.levenshtein = levenshtein;
+},{"autosuggest-trie":4,"js-levenshtein":6}],2:[function(require,module,exports){
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+var unique = function unique(arr) {
+  var seen = {};
+  var result = [];
+  var len = arr.length;
+
+  for (var i = 0; i < len; i++) {
+    var item = arr[i];
+
+    if (!seen[item]) {
+      seen[item] = true;
+      result[result.length] = item;
+    }
+  }
+
+  return result;
+};
+
+exports.default = function (arr1, arr2) {
+  return unique(arr1.concat(arr2));
+};
+},{}],3:[function(require,module,exports){
+'use strict';
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+
+var _intersectionWithLimit = require('../intersection-with-limit/intersection-with-limit');
+
+var _intersectionWithLimit2 = _interopRequireDefault(_intersectionWithLimit);
+
+var _concatAndRemoveDups = require('../concat-and-remove-dups/concat-and-remove-dups');
+
+var _concatAndRemoveDups2 = _interopRequireDefault(_concatAndRemoveDups);
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+exports.default = function (items, textKey) {
+  var _ref = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {},
+      comparator = _ref.comparator,
+      _ref$splitRegex = _ref.splitRegex,
+      splitRegex = _ref$splitRegex === undefined ? /\s+/ : _ref$splitRegex;
+
+  var data = items;
+  var trie = {};
+
+  var compareFunction = comparator ? function (id1, id2) {
+    return comparator(items[id1], items[id2]);
+  } : null;
+
+  var addWord = function addWord(word, id, wordIndex) {
+    var wordLength = word.length;
+    var node = trie;
+
+    for (var i = 0; i < wordLength; i++) {
+      var letter = word[i];
+
+      if (!node[letter]) {
+        node[letter] = {
+          ids: []
+        };
+      }
+
+      if (!node[letter].ids[wordIndex]) {
+        node[letter].ids[wordIndex] = [];
+      }
+
+      node[letter].ids[wordIndex].push(id);
+
+      if (compareFunction) {
+        node[letter].ids[wordIndex].sort(compareFunction);
+      }
+
+      node = node[letter];
+    }
+  };
+
+  var addPhrase = function addPhrase(phrase, id) {
+    var words = phrase.trim().toLowerCase().split(splitRegex);
+    var wordsCount = words.length;
+
+    for (var i = 0; i < wordsCount; i++) {
+      addWord(words[i], id, i);
+    }
+  };
+
+  var getWordIndices = function getWordIndices(word) {
+    var wordLength = word.length;
+    var node = trie;
+
+    for (var i = 0; i < wordLength; i++) {
+      if (node[word[i]]) {
+        node = node[word[i]];
+      } else {
+        return [];
+      }
+    }
+
+    var ids = node.ids;
+    var length = ids.length;
+    var result = [];
+
+    for (var _i = 0; _i < length; _i++) {
+      if (ids[_i]) {
+        result = (0, _concatAndRemoveDups2.default)(result, ids[_i]);
+      }
+    }
+
+    return result;
+  };
+
+  var getPhraseIndices = function getPhraseIndices(phrase, _ref2) {
+    var limit = _ref2.limit,
+        _ref2$splitRegex = _ref2.splitRegex,
+        splitRegex = _ref2$splitRegex === undefined ? /\s+/ : _ref2$splitRegex;
+
+    var words = phrase.toLowerCase().split(splitRegex).filter(Boolean);
+
+    if (words.length === 0) {
+      return [];
+    }
+
+    var wordsCount = words.length;
+    var indicesArray = [];
+
+    for (var i = 0; i < wordsCount; i++) {
+      indicesArray[indicesArray.length] = getWordIndices(words[i]);
+    }
+
+    return (0, _intersectionWithLimit2.default)(indicesArray, limit);
+  };
+
+  var getMatches = function getMatches(query) {
+    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+
+    var indices = getPhraseIndices(query, options);
+    var indicesCount = indices.length;
+    var result = [];
+
+    for (var i = 0; i < indicesCount; i++) {
+      result[result.length] = data[indices[i]];
+    }
+
+    return result;
+  };
+
+  var itemsCount = items.length;
+
+  for (var i = 0; i < itemsCount; i++) {
+    addPhrase(items[i][textKey], i);
+  }
+
+  return {
+    getMatches: getMatches
+  };
+};
+},{"../concat-and-remove-dups/concat-and-remove-dups":2,"../intersection-with-limit/intersection-with-limit":5}],4:[function(require,module,exports){
+'use strict';
+
+var _createTrie = require('./create-trie/create-trie');
+
+var _createTrie2 = _interopRequireDefault(_createTrie);
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+module.exports = _createTrie2.default;
+},{"./create-trie/create-trie":3}],5:[function(require,module,exports){
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+
+exports.default = function (arrays, limit) {
+  var arraysCount = arrays.length;
+  var firstArray = arrays[0];
+  var firstArrayCount = firstArray.length;
+
+  limit = limit || firstArrayCount;
+
+  var result = [],
+      candidate = void 0,
+      found = void 0;
+
+  for (var i = 0; i < firstArrayCount && result.length < limit; i++) {
+    candidate = firstArray[i];
+    found = true;
+
+    for (var k = 1; k < arraysCount; k++) {
+      if (arrays[k].indexOf(candidate) === -1) {
+        found = false;
+        break;
+      }
+    }
+
+    if (found) {
+      result[result.length] = candidate;
+    }
+  }
+
+  return result;
+};
+},{}],6:[function(require,module,exports){
+'use strict';
+module.exports = (function()
+{
+  function _min(d0, d1, d2, bx, ay)
+  {
+    return d0 < d1 || d2 < d1
+        ? d0 > d2
+            ? d2 + 1
+            : d0 + 1
+        : bx === ay
+            ? d1
+            : d1 + 1;
+  }
+
+  return function(a, b)
+  {
+    if (a === b) {
+      return 0;
+    }
+
+    if (a.length > b.length) {
+      var tmp = a;
+      a = b;
+      b = tmp;
+    }
+
+    var la = a.length;
+    var lb = b.length;
+
+    while (la > 0 && (a.charCodeAt(la - 1) === b.charCodeAt(lb - 1))) {
+      la--;
+      lb--;
+    }
+
+    var offset = 0;
+
+    while (offset < la && (a.charCodeAt(offset) === b.charCodeAt(offset))) {
+      offset++;
+    }
+
+    la -= offset;
+    lb -= offset;
+
+    if (la === 0 || lb < 3) {
+      return lb;
+    }
+
+    var x = 0;
+    var y;
+    var d0;
+    var d1;
+    var d2;
+    var d3;
+    var dd;
+    var dy;
+    var ay;
+    var bx0;
+    var bx1;
+    var bx2;
+    var bx3;
+
+    var vector = [];
+
+    for (y = 0; y < la; y++) {
+      vector.push(y + 1);
+      vector.push(a.charCodeAt(offset + y));
+    }
+
+    var len = vector.length - 1;
+
+    for (; x < lb - 3;) {
+      bx0 = b.charCodeAt(offset + (d0 = x));
+      bx1 = b.charCodeAt(offset + (d1 = x + 1));
+      bx2 = b.charCodeAt(offset + (d2 = x + 2));
+      bx3 = b.charCodeAt(offset + (d3 = x + 3));
+      dd = (x += 4);
+      for (y = 0; y < len; y += 2) {
+        dy = vector[y];
+        ay = vector[y + 1];
+        d0 = _min(dy, d0, d1, bx0, ay);
+        d1 = _min(d0, d1, d2, bx1, ay);
+        d2 = _min(d1, d2, d3, bx2, ay);
+        dd = _min(d2, d3, dd, bx3, ay);
+        vector[y] = dd;
+        d3 = d2;
+        d2 = d1;
+        d1 = d0;
+        d0 = dy;
+      }
+    }
+
+    for (; x < lb;) {
+      bx0 = b.charCodeAt(offset + (d0 = x));
+      dd = ++x;
+      for (y = 0; y < len; y += 2) {
+        dy = vector[y];
+        vector[y] = dd = _min(dy, d0, dd, bx0, vector[y + 1]);
+        d0 = dy;
+      }
+    }
+
+    return dd;
+  };
+})();
+
+
+},{}]},{},[1]);