Unpickler for typed trees
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
Such forward references are rare.
The root owner tree. See
OwnerTree class definition. Set by
The root symbol denotation which are defined by the Tasty file associated with this
TreeUnpickler. Set by
The root symbols that are defined in this Tasty file. This
is a subset of
A map from addresses of definition entries to the symbols they define
A temporary map from addresses of definition entries to the trees they define. Used to remember trees of symbols that are created by a completion. Emptied once the tree is inlined into a larger tree.
A map from addresses of type entries to the types they define. Currently only populated for types that might be recursively referenced from within themselves (i.e. RecTypes, LambdaTypes).
Enter all toplevel classes and objects into their scopes
The unpickled trees