Benchmark: Set vs Filter vs Reduce for unique

Script Preparation code:

var array = Array.from({length: 40}, () => Math.floor(Math.random() * 140));

Tests:

Set spread
const f = [... new Set(array)]
Array from set
const s = new Set(array) const l = Array.from(s)
Filter
const b = array.filter((i,index) => array.indexOf(i)=== index)
Reduce
const r = array.reduce((previous, current) => { if(!previous.includes(current)) { previous.push(current); } return previous; }, []);

Rendered benchmark preparation results:

Previous results

Latest run results:

Run details: (Test run date: one year ago)

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

Browser/OS: Chrome 135 on Windows

Set spread

2.0M/s

Array from set

1.9M/s

Reduce

1.5M/s

Filter

1.3M/s

View exact numbers

Set vs Filter vs Reduce for unique (version: 1)