Built-in hashtables

Fixed. Snap! Build Your Own Blocks

Some example modifications:

  • Set: All values are false (or 0 or '') Use the contains block to check if the set contains an element.
  • Multiset: Values are numbers specifying the count of a key.
  • Dictionary: A hashtable and a list of keys. Keys are ordered by the list. Slows down removal because of removing from list. Or you could always keep a key, and only remove the value (set to false/0/'')
  • Ordered Set: A list and a set.