lruversion Documentation on ocaml.org
Scalable LRU caches
Lru provides weight-bounded finite maps that can remove the least-recently-used (LRU) bindings in order to maintain a weight constraint.
| Author | David Kaloper Meršinjak <dk505@cam.ac.uk> |
|---|---|
| License | ISC |
| Published | |
| Homepage | https://github.com/pqwy/lru |
| Issue Tracker | https://github.com/pqwy/lru/issues |
| Maintainer | David Kaloper Meršinjak <dk505@cam.ac.uk> |
| Dependencies |
|
| Source [http] | https://github.com/pqwy/lru/releases/download/v0.3.0/lru-v0.3.0.tbz sha256=84efe3e123c89e2622f973eef4483fbfc0943c27844a0e3aa2b504cc4ecb69a9 md5=ecaa8c9f5f708879140961ce35bcdba4 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/lru/lru.0.3.0-1/opam |
Required by
- arp>=4.1.0
- cactus
- dns>=4.4.1
- dns-resolver
- earlybird>=1.0.1
- git<3.2.0
- index>=1.5.0
- mirage-nat
- tcpip


