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.1/lru-0.3.1.tbz sha256=6cbe23d27a7d5b244f869c0b88140d47f70f413a6462ef35c0009325d4b236fd sha512=81144e258d6e488d4677ade91132401b6f8871c72aadf2f1c190c4dee918c71c5df10c4e690c5bf1ab0f364d87989d44aec3695310a3477f6473eb17c1261734 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/lru/lru.0.3.1/opam |
Required by
- arp>=4.1.0
- cactus
- caqti>=2.2.4
- dns>=4.4.1
- dns-resolver
- earlybird>=1.0.1
- git<3.2.0
- index>=1.5.0
- mirage-nat
- tcpip
