Other than the fact that Object.keys existed really before Sets, you are comparing apples and oranges here in your benchmarks. the include method has to scan the array in order to find elements, but sets are objects which are just hash tables. Also you typically don't get the keys array to check that a key is there, you can do that directly using the object you have. Another thing is that the typical use case for Object.keys is to get an iterator over the keys, returning a set for that purpose does not serve that purpose directly.
On Sat, Oct 17, 2020 at 4:51 AM #!/JoePea <[email protected]> wrote: > Sets are faster, even for tiny lists of four items. See the perf tests > (tested in Chrome): > > https://twitter.com/trusktr/status/1315848017535098880 > > https://twitter.com/trusktr/status/1317281652540731392 > > #!/JoePea > _______________________________________________ > es-discuss mailing list > [email protected] > https://mail.mozilla.org/listinfo/es-discuss >
_______________________________________________ es-discuss mailing list [email protected] https://mail.mozilla.org/listinfo/es-discuss
