1
0
Fork 0

Update Posts “using-js-sets-to-find-elements”

This commit is contained in:
Jo Wroten 2019-07-09 20:33:20 +00:00
parent e40175d8d1
commit dacade6fcc

View file

@ -26,7 +26,11 @@ description: >-
```
---
Functionally for one check, this is identical to checking the `.indexOf()` or `.includes()` of an Array. However, in cases where you're filtering a large array down to match a list of ID's, for example, the nested looping can result in a performance hit. Traditionally hash tables were used for speeding up this search, but with ES2015 we can now leverage Sets which are easier to read and still result in a single loop that's equal to the length of the Array and no more. (Can be further optimized by ending when running out of needles)
Functionally for one check, this is identical to checking the `.indexOf()` or `.includes()` of an Array. However, in cases where you're filtering a large array down to match a list of ID's, for example, the nested looping can result in a performance hit.
Traditionally hash tables were used for speeding up this search, but with ES2015 we can now leverage Sets which are easier to read and still result in a single loop that's equal to the length of the Array and no more.
(Can be further optimized by ending when running out of needles)
```js
// Example Data