search

blitzcode / lru-bounded-map

Haskell implementations of associative containers (maps / dictionaries) which retire elements in least recently used (LRU) order when growing past a specified limit
3 stars 3 forks source link

issues

Newest
Newest Most commented Recently updated Oldest Least commented Least recently updated