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" {>= "5.1.0"}
14 "core" {>= "v0.17" & < "v0.18"}
15 "ppx_jane" {>= "v0.17" & < "v0.18"}
16 "dune" {>= "3.11.0"}
17]
18available: arch != "arm32" & arch != "x86_32"
19synopsis: "A splay tree implementation"
20description: "
21Splay trees are binary search trees that move recently accessed nodes
22closer to the root for easier access. They have amortized O(log
23n)-time access for a large enough sequence of primitive operations.
24
25A splay trees may outperform other trees such as red-black trees when
26recently accessed items are more likely to be accessed in the near
27future.
28
29Notably, this splay tree implementation is parameterized by a
30reduction operation which lets you specify an extra accumulator value,
31which can then be searched by efficiently.
32"
33url {
34src: "https://github.com/janestreet/splay_tree/archive/refs/tags/v0.17.0.tar.gz"
35checksum: "sha256=1b717c0656a2bb1b366ca17db9d576e1504ace1833b41e285a2be401b0082e73"
36}