-
Notifications
You must be signed in to change notification settings - Fork 1.1k
/
opam
33 lines (31 loc) · 1.09 KB
/
opam
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
opam-version: "2.0"
maintainer: "David Kaloper Meršinjak <david@numm.org>"
authors: ["David Kaloper Meršinjak <david@numm.org>"]
homepage: "https://github.com/pqwy/lru"
doc: "https://pqwy.github.io/lru/doc"
license: "ISC"
dev-repo: "git+https://github.com/pqwy/lru.git"
bug-reports: "https://github.com/pqwy/lru/issues"
tags: ["data-structure"]
depends: [
"ocaml" {>= "4.02.0" & < "5.0"}
"ocamlfind" {build}
"ocamlbuild" {build}
"topkg" {build}
"psq" {<"0.2.0"}
"alcotest" {with-test}
]
build: [ "ocaml" "pkg/pkg.ml" "build" "--pinned" "%{pinned}%" ]
synopsis: "Scalable LRU caches"
description: """
lru provides LRU caches for OCaml. These are size-bounded finite maps that
remove the least-recently-used (LRU) bindings to maintain their size constraint.
The library has two implementations: one is functional, the other imperative.
lru is distributed under the ISC license."""
url {
src: "https://github.com/pqwy/lru/releases/download/v0.1.1/lru-0.1.1.tbz"
checksum: [
"sha256=7f3dbf20dcd3b19aa1d950c73fe9be587d7217ed019601cd0a87b4443b581499"
"md5=da7b90c2c635064b5f5646ff40bca25b"
]
}