1 line of code: How to get every odd item of an Array

const oddItems = arr => arr.filter((_, i) => i & 1 === 1);

Returns an array which contains every odd (second) item of the original array.

---

The repository & npm package

You can find the all the utility functions from this series at github.com/martinkr/onelinecode
The library is also published to npm as @onelinecode for your convenience.

The code and the npm package will be updated every time I publish a new article.

---

Follow me on Twitter: @martinkr and consider to buy me a coffee

Photo by zoo_monkey on Unsplash

---

Comments

[Jon Randy 🎖️]

Not looked for faster methods yet, but the current one seems overly verbose. Also, what is which for?

const oddItems = arr => arr.filter((_, index) => index % 2)

[Alex Lohr]

Binary filters are even faster than the modulo:

const oddItems = arr => arr.filter((_, i) => i & 1 === 1);

[Jon Randy 🎖️]

Faster still if you omit the unnecesary === 1 - it's about even on Firefox, but consistently quicker on Chrome (10-15%) - link

const oddItems = arr => arr.filter((_, i) => i & 1)

[Jon Randy 🎖️]

Much faster again (on all tested browsers):

const oddItems = (arr, odds=[], i=0)=>{ for (i=0;i<arr.length;i++) (i & 1) && odds.push(arr[i]); return odds}

[Martin Krause]

Hi Jon Randy,

I updated the benchmark on hasty - impressive improvement!
I updated the code and the article.

Thank you for the improved code.

Cheers!

Thank you!

[Alex Lohr]

If you are already using a for loop, you can also jump 2 steps on every iteration:

const oddItems = (arr, odds=[], i) => { for (i = 1; i < arr.length; i = i + 2) odds.push(arr[i]); return odds}

[Jon Randy 🎖️]

Haha... yeah - oops

[Jon Randy 🎖️]

You might want to make the benchmark call the functions as well as define them! :P

[Giulio "Joshi"]

wouldn't jumping 2 steps ensure only odd positional, but not values?
(I just assume an unsorted array of random values)

[Jon Randy 🎖️]

Odd positional is what we're after

[Martin Krause]

Hi Alex,

I checked the performance on hasty and indeed much faster. I updated the code and the article.

Thank you!

[Martin Krause]

Thank you for your contribution. The "which" is a copy paste error :D
If you have any performance improvements, please share them and I'll happily adjust the code and the article.

Cheers,

Martin