-
Notifications
You must be signed in to change notification settings - Fork 1.1k
/
opam
35 lines (33 loc) · 1.29 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
34
35
opam-version: "2.0"
maintainer: "Jane Street developers"
authors: ["Jane Street Group, LLC"]
homepage: "https://github.com/janestreet/splay_tree"
bug-reports: "https://github.com/janestreet/splay_tree/issues"
dev-repo: "git+https://github.com/janestreet/splay_tree.git"
doc: "https://ocaml.janestreet.com/ocaml-core/latest/doc/splay_tree/index.html"
license: "MIT"
build: [
["dune" "build" "-p" name "-j" jobs]
]
depends: [
"ocaml" {>= "4.08.0"}
"core" {>= "v0.15" & < "v0.16"}
"ppx_jane" {>= "v0.15" & < "v0.16"}
"dune" {>= "2.0.0"}
]
synopsis: "A splay tree implementation"
description: "
Splay trees are binary search trees that move recently accessed nodes
closer to the root for easier access. They have amortized O(log
n)-time access for a large enough sequence of primitive operations.
A splay trees may outperform other trees such as red-black trees when
recently accessed items are more likely to be accessed in the near
future.
Notably, this splay tree implementation is parameterized by a
reduction operation which lets you specify an extra accumulator value,
which can then be searched by efficiently.
"
url {
src: "https://ocaml.janestreet.com/ocaml-core/v0.15/files/splay_tree-v0.15.0.tar.gz"
checksum: "sha256=0fa105bb09ea3eae1ec7d81e1326608a502c1bc3af0670afb564a9897efcd2e2"
}