Return a new name of the same variety.
The next name in the same hash bucket.
Return the subname with characters from from to to-1.
TODO - find some efficiency.
the i'th Char of this name
Copy bytes of this name to buffer cs, starting at position offset
.
Write to UTF8 representation of this name to given character array.
Write to UTF8 representation of this name to given character array.
Start copying to index to
. Return index of next free byte in array.
Array must have enough remaining space for all bytes
(i.e. maximally 3*length bytes).
Replace $op_name by corresponding operator symbol.
!!! Duplicative but consistently named.
!!! Duplicative but consistently named.
Replace operator symbols by corresponding $op_name.
Does this name end with suffix just before given end index?
Does this name end with suffix?
the hash value of this name
Returns the index of the last occurrence of string s in this name from start, -1 if not found.
Returns the index of the last occurrence of string s in this name from start, -1 if not found.
the string
...
the index of the last occurrence of s
Returns the index of the last occurrence of char c in this name from start, -1 if not found.
Returns the index of the last occurrence of char c in this name from start, -1 if not found.
the character
...
the index of the last occurrence of c
Returns the index of last occurrence of char c in this name, -1 if not found.
Returns the index of last occurrence of char c in this name, -1 if not found.
the character
the index of the last occurrence of c
The length of this name.
Return a new name based on string transformation.
Returns the index of the first occurrence of nonempty string s in this name from start, length if not found.
Returns the index of the first occurrence of nonempty string s in this name from start, length if not found.
the string
...
the index of the first occurrence of s
Returns the index of the first occurrence of character c in this name from start, length if not found.
Returns the index of the first occurrence of character c in this name from start, length if not found.
the character
...
the index of the first occurrence of c
the index of first occurrence of char c in this name, length if not found
the index of first occurrence of char c in this name, length if not found
Replace all occurrences of from
by to
in
name; result is always a term name.
Index into name table
Some thoroughly self-explanatory convenience functions.
Some thoroughly self-explanatory convenience functions. They assume that what they're being asked to do is known to be valid.
Does this name start with prefix at given start index?
Does this name start with prefix?
the ascii representation of this name
The name class. TODO - resolve schizophrenia regarding whether to treat Names as Strings or Strings as Names. Give names the key functions the absence of which make people want Strings all the time.