#container #hashmap #map

ttlhashmap

Optionally bounded HashMap-like container with decaying nodes

1 unstable release

0.1.0 Mar 4, 2021

#110 in #hashmap

0BSD license

20KB
325 lines


lib.rs:

A HashMap-like container which keeps track of node timestamps and can decay nodes by a timeout or a configured maximum number of nodes.

There are two classes of methods to enforce constraints:

  • Immediate removal
  • "Split" (the "removed" nodes are returned to the caller).

No runtime deps