Benchmark: Include vs Binary search in sorted array vs Map.has() vs Object[]

Script Preparation code:

var array = [];
var map = new Map();
var obj = {};

for (var i = 0; i < 2000; i++){
  array.push(Math.random());
  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(30)
binary
binaryIndexOf.call(sorted, 30)
Map.has()
map.has(30);
Obj[]
obj[30]

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
Includes
binary
Map.has()
Obj[]

Include vs Binary search in sorted array vs Map.has() vs Object[] (version: 1)

Comparing performance of: Includes vs binary vs Map.has() vs Obj[]

Created: one year ago by: Guest

Jump to the latest result

Includes

binary

Map.has()

Obj[]

Suite status: <idle, ready to run>

Fastest: N/A

Slowest: N/A

No previous run results