Message from JavaScript discussions

May 2017

— Anyway, I need to traverse down, and then back up on deletion

— 

Hash consing, where the element is hashed and deduction is used to tell if it's "probably in set" or "definitely not in set"

— I see

— Map is easy to implement after this

— Just change .end to .value

— And point it to user-defined value

— I dont think you need an end value

— I doo

— Set = new Set();
set.add('Hello');

set.has('Hello'); // should be true
set.has('Hell'); // should be false

Message permanent page

— You can make a named accessor point to null

— Eh?

— My version also makes sets stringifyable and loadable from disk