the reader from which to unpickle
the nametable
A lazy datastructure that records how definitions are nested in TASTY data.
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.
Enter all toplevel classes and objects into their scopes
Enter all toplevel classes and objects into their scopes
a set of SymDenotations that should be overwritten by unpickling
The unpickled trees
Make a subsequent call to unpickle
return trees with positions
Make a subsequent call to unpickle
return trees with positions
the range position enclosing all returned trees, or NoPosition if positions should not be unpickled
a map from tree addresses to their positions relative to positions of parent nodes.
Unpickler for typed trees