Prove aziz wrong on Twitter about comprehension speed

list_comprehension_vs_js_methods.sh

ash@ly:~$ python3
Python 3.8.5 (default, Jul 28 2020, 12:59:40) 
[GCC 9.3.0] on linux
Type "help", "copyright", "credits" or "license" for more information.
>>> from time import perf_counter
>>> lst = range(10_000)
>>> before = perf_counter(); _=[i for i in lst if i % 2]; perf_counter() - before
0.0010968240001147933

## compare to JS

ash@ly:~$ node
> const arr = []
undefined
> for (let i = 0; i < 10000; i++) { arr[i] = i; }
9999
> console.time(); arr.filter(e=>e%2); console.timeEnd()
default: 1.108ms

but ur using generators :d :P ok so we could use generators in JS as well and get the same benefit! I'll try it later

yeah that's my winning card, since js doesnt have inline generator..