HE Shi-Jun
HE Shi-Jun
It may also slower, especially in embed js engines. :-P
I think ["composite key" or "compound key"](https://en.wikipedia.org/wiki/Compound_key) is common concept in database?
> the _last in_ was taken as the value to keep. Where in the current typical cases shows the _first in_ being the value and once set not overwritten. Let's...
I raise this issue because there is no simple way to deal with multiple key. But maybe it could be solved by leverage the new tuple/record proposal, though we need...
It seems most userland libs keep first. There are use cases which prefer last. For example, dedup update operations and use the last update. But in such cases, we possible...
Both lodash, ramda keep first. I also found another two packages in npm (but forgot accurate names now, need to search again) also keep first. Note, I guess ramda just...
@ljharb It seems collection normalization will convert the values but `unique` proposal will not.
Not sure how it could be used to *override* the comparator --- As I understand, it's not override the comparator but just change the values, so u may need a...
So it would be `new Set(array, { comparator: (a, b) => a.id === b.id })` just as @sffc suggested? But as I understand, to make such usage efficient, very likely...
> I’m not sure why it wouldn’t be efficient as-is. @ljharb Because comparator could be complex (eg. deep equal). @bergus I think we have similar thought about that. `comparator` by...