Implement standard Set and Map

[dcodeIO]

Besides a filler implementation of sets, there's not much implemented in this regard yet.

See: std/assembly/set.ts
See: std/assembly/map.ts

Useful resources:

• Set - JavaScript | MDN
• Map - JavaScript | MDN
• ECMAScript® 2018 Language Specification

[enjoythelive1]

I want to implement this. I have the time (kinda).

[alperr]

is there anyone actively working on this ?

[dcodeIO]

is there anyone actively working on this ?

Not that I am aware of :)

[MaxGraey]

I don't think so anyone working on this. It will be great implement this via Determenistic Hash Table. More info: https://wiki.mozilla.org/User:Jorend/Deterministic_hash_tables#Lookup_speed

PS @enjoythelive1 May be you have some drafts?

[dcodeIO]

Anyone already working on this? Seems like an open or close table from the link provided by MaxGraey shouldn't be too hard to implement. Might give it a shot otherwise.

[MaxGraey]

What about me, I'm focusing on reimplementing argument reduction for sin/cos/tan.
Close Table looks very promising and it seems using by Mozilla's Map/Set with some modifications.

[dcodeIO]

The commit above adds a variant of the previously mentioned CloseTable implementation to tests, so feel free to give it a try. Once stable, it should be straight forward to derive a Set implementation from it, and start thinking about iterators.