Fast array search

Benchmark created on November 20, 2025

Setup

function generatePoints(count = 10000, min = 0, max = 300) {
    const points = new Array(count);
    const range = max - min + 1;

    for (let i = 0; i < count; i++) {
        points[i] = {
            x: Math.floor(Math.random() * range) + min,
            y: Math.floor(Math.random() * range) + min
        };
    }

    return points;
}

function buildPointIndex(points, keyCreator) {
    const index = new Set();
    for (const p of points) {
        index.add(keyCreator(p));
    }
    return index;
}

function toIndexedArray(array, keyCreator) {
  let result = {
    index: new Set(),
    keyCreator,
    check(value) {
      return this.index.has(this.keyCreator(value))
    }
  };

  for (const arrayItem of array) {
      result.index.add(keyCreator(arrayItem));
  }

  return result;
}

var mainArr = generatePoints();
var mainSet = toIndexedArray(mainArr, (p) => p.x + "," + p.y);

var mainSet2 = toIndexedArray(mainArr, (p) => p.x + p.y*1000);

var mainSet3 = toIndexedArray(mainArr, (p) => (p.x | (p.y << 10)));

var mainSet4 = toIndexedArray(mainArr, (p) => ((p.y << 16) | p.x) >>> 0);

var arrToCheck = generatePoints();

Test runner

for (const check of arrToCheck) {
	let r = mainArr.find(p => p.x == check.x && p.y == check.y) != undefined;
}

for (const check of arrToCheck) {
	let r = mainSet.check(check);
}

for (const check of arrToCheck) {
	let r = mainSet2.check(check);
}

for (const check of arrToCheck) {
	let r = mainSet3.check(check);
}

for (const check of arrToCheck) {
	let r = mainSet4.check(check);
}

Revisions

You can edit these tests or add more tests to this page by appending /edit to the URL.

• Revision 1: published on November 20, 2025