Skip to content
Closed
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
27 changes: 11 additions & 16 deletions dist/bloodhound.js
Original file line number Diff line number Diff line change
Expand Up @@ -523,23 +523,18 @@
}
return uniques;
}
function getIntersection(arrayA, arrayB) {
var ai = 0, bi = 0, intersection = [];
arrayA = arrayA.sort();
arrayB = arrayB.sort();
var lenArrayA = arrayA.length, lenArrayB = arrayB.length;
while (ai < lenArrayA && bi < lenArrayB) {
if (arrayA[ai] < arrayB[bi]) {
ai++;
} else if (arrayA[ai] > arrayB[bi]) {
bi++;
} else {
intersection.push(arrayA[ai]);
ai++;
bi++;
}
function getIntersection(array) {
var result = [],
argsLength = arguments.length;
for (var i = 0, length = array.length; i < length; i++) {
var item = array[i];
if (result.indexOf(item) > -1) continue;
for (var j = 1; j < argsLength; j++) {
if (arguments[j].indexOf(item) === -1) break;
}
if (j === argsLength) result.push(item);
}
return intersection;
return result;
}
}();
var Prefetch = function() {
Expand Down
27 changes: 11 additions & 16 deletions dist/typeahead.bundle.js
Original file line number Diff line number Diff line change
Expand Up @@ -523,23 +523,18 @@
}
return uniques;
}
function getIntersection(arrayA, arrayB) {
var ai = 0, bi = 0, intersection = [];
arrayA = arrayA.sort();
arrayB = arrayB.sort();
var lenArrayA = arrayA.length, lenArrayB = arrayB.length;
while (ai < lenArrayA && bi < lenArrayB) {
if (arrayA[ai] < arrayB[bi]) {
ai++;
} else if (arrayA[ai] > arrayB[bi]) {
bi++;
} else {
intersection.push(arrayA[ai]);
ai++;
bi++;
}
function getIntersection(array) {
var result = [],
argsLength = arguments.length;
for (var i = 0, length = array.length; i < length; i++) {
var item = array[i];
if (result.indexOf(item) > -1) continue;
for (var j = 1; j < argsLength; j++) {
if (arguments[j].indexOf(item) === -1) break;
}
if (j === argsLength) result.push(item);
}
return intersection;
return result;
}
}();
var Prefetch = function() {
Expand Down
28 changes: 10 additions & 18 deletions src/bloodhound/search_index.js
Original file line number Diff line number Diff line change
Expand Up @@ -162,30 +162,22 @@ var SearchIndex = window.SearchIndex = (function() {
return uniques;
}

function getIntersection(arrayA, arrayB) {
var ai = 0, bi = 0, intersection = [];
function getIntersection(array) {
var result = [],
argsLength = arguments.length;

arrayA = arrayA.sort();
arrayB = arrayB.sort();
for (var i = 0, length = array.length; i < length; i++) {
var item = array[i];

var lenArrayA = arrayA.length, lenArrayB = arrayB.length;
if (result.indexOf(item) > -1) continue;

while (ai < lenArrayA && bi < lenArrayB) {
if (arrayA[ai] < arrayB[bi]) {
ai++;
for (var j = 1; j < argsLength; j++) {
if (arguments[j].indexOf(item) === -1) break;
}

else if (arrayA[ai] > arrayB[bi]) {
bi++;
}

else {
intersection.push(arrayA[ai]);
ai++;
bi++;
}
if (j === argsLength) result.push(item);
}

return intersection;
return result;
}
})();