this repo has no description
anil.recoil.org
1opam-version: "2.0"
2maintainer: "Jane Street developers"
3authors: ["Jane Street Group, LLC"]
4homepage: "https://github.com/janestreet/splay_tree"
5bug-reports: "https://github.com/janestreet/splay_tree/issues"
6dev-repo: "git+https://github.com/janestreet/splay_tree.git"
7doc: "https://ocaml.janestreet.com/ocaml-core/latest/doc/splay_tree/index.html"
8license: "MIT"
9build: [
10 ["dune" "build" "-p" name "-j" jobs]
11]
12depends: [
13 "ocaml" {>= "4.08.0"}
14 "core_kernel" {>= "v0.13" & < "v0.14"}
15 "ppx_jane" {>= "v0.13" & < "v0.14"}
16 "dune" {>= "1.5.1"}
17]
18synopsis: "A splay tree implementation"
19description: "
20Splay trees are binary search trees that move recently accessed nodes
21closer to the root for easier access. They have amortized O(log
22n)-time access for a large enough sequence of primitive operations.
23
24A splay trees may outperform other trees such as red-black trees when
25recently accessed items are more likely to be accessed in the near
26future.
27
28Notably, this splay tree implementation is parameterized by a
29reduction operation which lets you specify an extra accumulator value,
30which can then be searched by efficiently.
31"
32url {
33 src:
34 "https://ocaml.janestreet.com/ocaml-core/v0.13/files/splay_tree-v0.13.0.tar.gz"
35 checksum: [
36 "sha256=728c6fa152989055082fe2775d19731d4af131bc67788e81ca93a5008ffbae75"
37 "md5=fd926dcdef1c6db78f450687c7e40cde"
38 ]
39}