Constructors
Members
A term name that's derived from an underlying
name and that
adds info
to it.
A term name that's derived from an underlying
name and that
adds info
to it.
A term name that's derived from an underlying
name and that
adds info
to it.
A term name that's derived from an underlying
name and that
adds info
to it.
A name is essentially a string, with three differences 1. Names belong in one of two name spaces: they are type names or term names. Term names have a s...
A name is essentially a string, with three differences 1. Names belong in one of two name spaces: they are type names or term names. Term names have a sub-category of "local" field names. The same string can correspond a name in each of the three namespaces. 2. Names are hash-consed. Two names representing the same string in the same universe are always reference identical. 3. Names are intended to be encoded strings. @see dotc.util.NameTransformer. The encoding will be applied when converting a string to a name.
A common class for things that can be turned into names. Instances are both names and strings, the latter via a decorator.
A common class for things that can be turned into names. Instances are both names and strings, the latter via a decorator.
The term name represented by the empty string
The term name represented by the empty string
The type name represented by the empty string
The type name represented by the empty string
Memory to store all names sequentially.
Memory to store all names sequentially.
The number of characters filled.
The number of characters filled.
The number of defined names.
The number of defined names.
Hashtable for finding term names quickly.
Hashtable for finding term names quickly.
Memory to store all names sequentially.
Memory to store all names sequentially.
Is (the ASCII representation of) name at given index equal to cs[offset..offset+len-1]?
Is (the ASCII representation of) name at given index equal to cs[offset..offset+len-1]?
The hash of a name made of from characters cs[offset..offset+len-1].
The hash of a name made of from characters cs[offset..offset+len-1].
The number of characters filled.
The number of characters filled.
The number of defined names.
The number of defined names.
Hashtable for finding term names quickly.
Hashtable for finding term names quickly.
Create a term name from the characters in cs[offset..offset+len-1]. Assume they are already encoded.
Create a term name from the characters in cs[offset..offset+len-1]. Assume they are already encoded.
Create a term name from the UTF8 encoded bytes in bs[offset..offset+len-1]. Assume they are already encoded.
Create a term name from the UTF8 encoded bytes in bs[offset..offset+len-1]. Assume they are already encoded.
Create a term name from a string, without encoding operators
Create a term name from a string, without encoding operators
Create a type name from the UTF8 encoded bytes in bs[offset..offset+len-1]. Assume they are already encoded.
Create a type name from the UTF8 encoded bytes in bs[offset..offset+len-1]. Assume they are already encoded.
Create a type name from a string, without encoding operators
Create a type name from a string, without encoding operators