ReteTree
A RETE-style discrimination network storing Clauses and indexing them for fast retrieval by unification.
Clauses are first split into directives and rules (see Directive/Rule), then, within each of those two families, indexed by their head's functor, then by arity, then recursively by the shape of their first argument (variable, atomic, numeric or compound — see the it.unibo.tuprolog.collections.rete.custom.leaf package), narrowing the set of clauses that get has to actually attempt to unify against a query. This is the storage engine backing both it.unibo.tuprolog.collections.ClauseQueue (ordered) and it.unibo.tuprolog.collections.ClauseMultiSet (unordered), and therefore, transitively, Theory itself.
See also
Properties
The Unificator used to match Clauses stored in this tree against query clauses.
Functions
Retracts all the matching clauses from this ReteTree