Benchmark: find range in array

Script Preparation code:

function randomIntFromInterval(min, max) { // min and max included 
  return Math.floor(Math.random() * (max - min + 1) + min)
}
var rows = [];
for(let i = 0; i<10000;i++) {
  rows.push(i * randomIntFromInterval(16,50));
}
function filterBinary(arr,min,max){
 var len   = arr.length
    ,up    = -1
    ,down  = len
    ,rrange= []
    ,mid   = Math.floor(len/2) 
 ;
 while (up++<mid && down-->mid){
    if (arr[up]>=max || arr[down]<=min){break;}
    if (arr[up]>=min){
      rrange.push(arr[up]);
    }
    if (arr[down]<=max){
      rrange.push(arr[down]);
    }
 }
 return rrange;   
}
  Array.prototype.sliceRange = function(min, max) {
    if (min > max) return this.sliceRange(max, min);
    var l = 0,
        r = this.length;
    rough: {
        while (l < r) {
            var m = ~~(l + (r - l) / 2);
            if (this[m] < min)
                l = m + 1;
            else if (this[m] > max)
                r = m;
            else
                break rough;
        }
        return [];
    }
    var lr = m,
        rl = m;
    while (l < lr) {
        m = ~~(l + (lr - l) / 2);
        if (this[m] < min)
            l = m + 1;
        else
            lr = m;
    }
    while (rl < r) {
        m = ~~(rl + (r - rl) / 2);
        if (this[m] > max)
            r = m;
        else
            rl = m + 1;
    }
    return this.slice(l, r);
}
  function getDatesBetweenRange(dates, min, max) {
    var subArray = [];
    var value, iCntr;
    var start, end;

    var low = 0, high = dates.length - 1;
    while (high - low > 1) {
        centre = Math.floor((high + low) / 2);
        if (dates[centre] < min)
            low = centre;
        else 
            high = centre;
    }
    start = low;
    high = dates.length - 1
    while (high - low > 1) {
        centre = Math.floor((high + low) / 2);
        if (dates[centre] > max)
            high = centre;
        else 
            low = centre;
    }
    end = high;

    for (var i = start; i < end; i++) {
        value = dates[i];
        if (value < min) {
            continue;
        }
        if (value > max) {
            break;
        }
        subArray.push(value);
    }
    return subArray;
}

Tests:

filterBinary
filterBinary(rows, 70000, 70400)
sliceRange
rows.sliceRange(70000, 70400)
getDatesBetweenRange
getDatesBetweenRange(rows,70000, 70400)

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
filterBinary
sliceRange
getDatesBetweenRange

Fastest: N/A

Slowest: N/A

ⓘ Get performance results from real users on your website with Request Metrics.

Website Performance Monitoring by Request Metrics

Latest run results:

Run details: (Test run date: 2 years ago)

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

Browser/OS: Chrome 98 on Windows

View result in a separate tab

Test name	Executions per second
filterBinary	268950.6 Ops/sec
sliceRange	5868207.0 Ops/sec
getDatesBetweenRange	65968.9 Ops/sec

find range in array (version: 0)

Comparing performance of: filterBinary vs sliceRange vs getDatesBetweenRange

Created: 2 years ago by: Guest

Jump to the latest result

filterBinary

sliceRange

getDatesBetweenRange

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A