A lazy datastructure that records how definitions are nested in TASTY data.
The structure is lazy because it needs to be computed only for forward references
to symbols that happen before the referenced symbol is created (see symbolAt).
Such forward references are rare.
A lazy datastructure that records how definitions are nested in TASTY data.
The structure is lazy because it needs to be computed only for forward references
to symbols that happen before the referenced symbol is created (see symbolAt).
Such forward references are rare.
Attributes
addr
The address of tree representing an owning definition, NoAddr for root tree
end
The end of the owning definition
reader
The reader to be used for scanning for children
tag
The tag at addr. Used to determine which subtrees to scan for children
(i.e. if tag is template, don't scan member defs, as these belong already
to enclosing class).