Module Vmm_trieSource

A trie data structure where Vmm_core.Name.t elements are the edges, and 'a option is at each nodes.

Since policies are modeled as X.509 arcs, or paths, or domain names - we often need a data structure to access all nodes at the same level (and ensure there's at most one thing at each level.

Sourcetype 'a t

The type of a Vmm_trie.

Sourceval empty : 'a t

empty is the empty trie.

Sourceval insert : Vmm_core.Name.t -> 'a -> 'a t -> 'a t * 'a option

insert name v t returns the new t', where t'(name) = Some v (this is the only modification). Also, potentially t(name) is returned, if it was present.

Sourceval remove : Vmm_core.Name.t -> 'a t -> 'a t

remove name t removes the value t(name), and returns the new t'.

Sourceval find : Vmm_core.Name.t -> 'a t -> 'a option

find name t returns the value t(name), if present.

Sourceval collect : Vmm_core.Name.t -> 'a t -> (Vmm_core.Name.t * 'a) list

collect name t finds for each sub-element of name the connected values. If name is "foo:bar", ("foo:bar", t("foo:bar")) :: ("foo", t("foo")) :: ("", t("")) :: [] are returned (only the values present are returned.

This is at the moment used in the albatross statistics daemon, but it may be removed soon.

Sourceval all : 'a t -> (Vmm_core.Name.t * 'a) list

all t flattens the trie into an associative list.

Sourceval fold : Vmm_core.Name.path -> 'a t -> (Vmm_core.Name.t -> 'a -> 'b -> 'b) -> 'b -> 'b

fold path t f init folds f over t at path. Each subnode of path is passed to f.