package containers

  1. Overview
  2. Docs
A modular, clean and powerful extension of the OCaml standard library

Install 

dune-project
 Dependency

github.com Readme Changelog Edit opam file Versions (23)

Authors

  1. S
    Simon Cruanes

Maintainers

  1. S
    simon.cruanes.2007@m4x.org

Sources

v2.8.1.tar.gz
md5=d84e09c5d0abc501aa17cd502e31a038
sha512=8b832f4ada6035e80d81be0cfb7bdffb695ec67d465ed6097a144019e2b8a8f909095e78019c3da2d8181cc3cd730cd48f7519e87d3162442562103b7f36aabb

doc/containers.data/CCTrie/MakeArray/index.html

Module CCTrie.MakeArraySource

Parameters

module X : ORDERED

Signature

Sourcetype char_ = X.t
Sourcetype key = X.t array
Sourcetype 'a t
Sourceval empty : 'a t
Sourceval is_empty : _ t -> bool
Sourceval add : key -> 'a -> 'a t -> 'a t

Add a binding to the trie (possibly erasing the previous one).

Sourceval remove : key -> 'a t -> 'a t

Remove the key, if present.

Sourceval find : key -> 'a t -> 'a option

Find the value associated with the key, if any.

Sourceval find_exn : key -> 'a t -> 'a

Same as find but can fail.

Sourceval longest_prefix : key -> 'a t -> key

longest_prefix k m finds the longest prefix of k that leads to at least one path in m (it does not mean that the prefix is bound to a value.

Example: if m has keys "abc0" and "abcd", then longest_prefix "abc2" m will return "abc".

  • since 0.17
Sourceval update : key -> ('a option -> 'a option) -> 'a t -> 'a t

Update the binding for the given key. The function is given None if the key is absent, or Some v if key is bound to v; if it returns None the key is removed, otherwise it returns Some y and key becomes bound to y.

Sourceval fold : ('b -> key -> 'a -> 'b) -> 'b -> 'a t -> 'b

Fold on key/value bindings. Will use WORD.of_list to rebuild keys.

Sourceval mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

Map values, giving both key and value. Will use WORD.of_list to rebuild keys.

  • since 0.17
Sourceval map : ('a -> 'b) -> 'a t -> 'b t

Map values, giving only the value.

  • since 0.17
Sourceval iter : (key -> 'a -> unit) -> 'a t -> unit

Same as fold, but for effectful functions.

Sourceval fold_values : ('b -> 'a -> 'b) -> 'b -> 'a t -> 'b

More efficient version of fold, that doesn't keep keys.

Sourceval iter_values : ('a -> unit) -> 'a t -> unit
Sourceval merge : ('a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t

Merge two tries together. The function is used in case of conflicts, when a key belongs to both tries.

Sourceval size : _ t -> int

Number of bindings.

Conversions
Sourceval to_list : 'a t -> (key * 'a) list
Sourceval of_list : (key * 'a) list -> 'a t
Sourceval to_seq : 'a t -> (key * 'a) sequence
Sourceval of_seq : (key * 'a) sequence -> 'a t
Sourceval to_seq_values : 'a t -> 'a sequence
Sourceval to_tree : 'a t -> [ `Char of char_ | `Val of 'a | `Switch ] ktree
Ranges
Sourceval above : key -> 'a t -> (key * 'a) sequence

All bindings whose key is bigger or equal to the given key, in ascending order.

Sourceval below : key -> 'a t -> (key * 'a) sequence

All bindings whose key is smaller or equal to the given key, in decreasing order.