Place an entry into the cache and associate it with the
provided key. Note that there can be only one entry for
any particular key. If two entries are added with the
same key, the second effectively overwrites the first.
Returns true if we added a new entry; false if we just
replaced an existing one. A replacement does not change
the order of the keys, and thus does not change stack
ordering.
classStackMap(K, V, alias Hash = Container.hash, alias Reap = Container.reap, alias Heap = Container.Collect)
Place an entry into the cache and associate it with the provided key. Note that there can be only one entry for any particular key. If two entries are added with the same key, the second effectively overwrites the first.
Returns true if we added a new entry; false if we just replaced an existing one. A replacement does not change the order of the keys, and thus does not change stack ordering.