Run results for: arr.include vs binary search on sorted array vs Map.has() vs Set.has() vs Object[]

Run details:

User agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/125.0.0.0 Safari/537.36 Edg/125.0.0.0

Browser: Chrome 125

Operating system: Windows

Device Platform: Desktop

Date tested: 2 years ago

Set.has()

12.4M/s

Map.has()

12.3M/s

Obj[]

12.2M/s

binary search

5.4M/s

Includes

846K/s

View exact numbers

Test name	Executions per second
✓ Set.has()	12,384,705 Ops/sec
Map.has()	12,282,330 Ops/sec
Obj[]	12,237,529 Ops/sec
binary search	5,412,072 Ops/sec
Includes	846,119 Ops/sec

Script Preparation code:

var arr = []
var map = new Map()
var set = new Set()
var obj = {}

for (var i = 0; i < 2000; i++) {
  arr.push(Math.random())
  map.set(i, true)
  set.add(i)
  obj[i] = true
}
arr = arr.sort()

function binaryIndexOf(searchElement) {
  var minIndex = 0
  var maxIndex = this.length - 1
  var currentIndex
  var currentElement

  while (minIndex <= maxIndex) {
    currentIndex = (minIndex + maxIndex) >>> 1
    currentElement = this[currentIndex]

    if (currentElement < searchElement) {
      minIndex = currentIndex + 1
    }
    else if (currentElement > searchElement) {
      maxIndex = currentIndex - 1
    }
    else {
      return currentIndex
    }
  }

  return -1
}

Tests:

Includes
arr.includes(5)
binary search
binaryIndexOf.call(arr, 5)
Map.has()
map.has(5)
Set.has()
set.has(5)
Obj[]
obj[5]