Construct a new Dtab with the given delegation entry appended.
Construct a new Dtab with the given dtab appended.
Bind the given tree with this namer.
Bind the given tree with this namer. Bind recursively follows paths by looking them up in this namer. A recursion depth of up to 100 is allowed.
Bind, then evaluate the given NameTree with this Namer.
Bind, then evaluate the given NameTree with this Namer. The result is translated into a Var[Addr].
Print a pretty representation of this Dtab.
(Changed in version 2.9.0) The behavior of scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
Efficiently removes prefix prefix
from dtab
.
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
(Since version 2.10.0) use fold instead
A Dtab--short for delegation table--comprises a sequence of delegation rules. Together, these describe how to bind a path to an Addr.