package containers-data

  1. Overview
  2. Docs
On This Page
  1. Hash Tries
package containers-data
Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Module CCHashTrieSource

Hash Tries

Trie indexed by the hash of the keys, where the branching factor is fixed. The goal is to have a quite efficient functional structure with fast update and access if the hash function is good. The trie is not binary, to improve cache locality and decrease depth.

Preliminary benchmarks (see the "tbl" section of benchmarks) tend to show that this type is quite efficient for small data sets.

status: unstable

  • since 0.13
Sourcetype 'a iter = ('a -> unit) -> unit
Sourcetype 'a gen = unit -> 'a option
Sourcetype 'a printer = Format.formatter -> 'a -> unit
Sourcetype 'a ktree = unit -> [ `Nil | `Node of 'a * 'a ktree list ]
Sourcemodule Transient : sig ... end
Sourcemodule type S = sig ... end
Sourcemodule type KEY = sig ... end
Sourcemodule Make (K : KEY) : S with type key = K.t
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct