Module CCHashTrie

module CCHashTrie: sig .. end

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

type 'a sequence = ('a -> unit) -> unit 
type 'a gen = unit -> 'a option 
type 'a printer = Format.formatter -> 'a -> unit 
type 'a ktree = unit -> [ `Nil | `Node of 'a * 'a ktree list ] 
module Transient: sig .. end
Transient Identifiers
module type S = sig .. end
module type KEY = sig .. end
Type for keys
module Make (K : KEY: S  with type key = K.t