What are WeakMap data structures?
An ordered list that can be browsed in both directions
A weighted list, associating a weight to each unique item, allowing them to be sorted quickly
A probabilistic data structure, allowing to have fast estimations of the cardinality of an element
Arrays that can contain objects weakly referenced as keys, which allows the destruction of the object, despite it being referenced in the array (ideal for caching)