Dn.Makeval empty : tadd t f (tree,inf) adds a structured object tree together with the associated information inf to the table t; the function f is used to translated tree into its prefix decomposition: f must decompose any tree into a label characterizing its root node and the list of its subtree
val pattern : 'a decompose_fun -> 'a -> patterntype 'tree lookup_fun = 'tree -> (Y.t * 'tree list) lookup_reslookup t f tree looks for trees (and their associated information) in table t such that the structured object tree matches against them; f is used to translated tree into its prefix decomposition: f must decompose any tree into a label characterizing its root node and the list of its subtree
val lookup : t -> 'term lookup_fun -> 'term -> Z.t list