Run results for: Include vs Binary search in sorted array vs Map.has() vs Object[] (100 elements)

Run details:

User agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/134.0.0.0 Safari/537.36

Browser: Chrome 134

Operating system: Mac OS X 10.15.7

Device Platform: Desktop

Date tested: one year ago

Map.has()

165.2M/s

Obj[]

151.5M/s

binary

86.8M/s

Includes

51.7M/s

View exact numbers

Test name	Executions per second
✓ Map.has()	165,189,904 Ops/sec
Obj[]	151,493,792 Ops/sec
binary	86,836,960 Ops/sec
Includes	51,699,276 Ops/sec

Script Preparation code:

var array = [];
var map = new Map();
var obj = {};

for (var i = 0; i < 100; i++){
  array.push(Math.floor(Math.random()* 100));
  map.set(i,true);
  obj[i]=true;
}
var sorted = array.sort()

function binaryIndexOf(searchElement) {

 
    var minIndex = 0;
    var maxIndex = this.length - 1;
    var currentIndex;
    var currentElement;
 
    while (minIndex <= maxIndex) {
        currentIndex = (minIndex + maxIndex) / 2 | 0;
        currentElement = this[currentIndex];
 
        if (currentElement < searchElement) {
            minIndex = currentIndex + 1;
        }
        else if (currentElement > searchElement) {
            maxIndex = currentIndex - 1;
        }
        else {
            return currentIndex;
        }
    }
 
    return -1;
}

Tests:

Includes
sorted.includes(5)
binary
binaryIndexOf.call(sorted, 5)
Map.has()
map.has(5);
Obj[]
obj[5]