Class STRING_8

-- Allocate space for at least n characters.

-- Create empty string.

-- Create string of length n filled with c.

-- Initialize from the characters of s.
-- (Useful in proper descendants of class STRING_8,
-- to initialize a string-like object from a manifest string.)

-- Initialize from contents of c_string,
-- a string created by some C function

-- Initialize Current with a_system_string.

-- Object of a type conforming to the type of s,
-- initialized with attributes from s

-- Reset contents of string from contents of c_string,
-- a string created by some C function.

-- Reset contents of string from substring of c_string,
-- a string created by some C function.

-- Allocate space for at least n characters.

-- Create empty string.

-- Create string of length n filled with c.

-- Initialize from contents of c_string,
-- a string created by some C function

-- Initialize Current with a_system_string.

-- Initialize from the characters of s.
-- (Useful in proper descendants of class STRING_8,
-- to initialize a string-like object from a manifest string.)

-- Allocate space for at least n characters.

Use make instead

-- Position of first occurrence of c at or after start_index;
-- 0 if none.
-- (From STRING_GENERAL)

-- Special data zone
-- (From TO_SPECIAL)

-- Numeric code of character at position i
-- (From STRING_GENERAL)

-- Constant string "false"

-- Position of first occurrence of other at or after start
-- with 0..fuzz mismatches between the string and other.
-- 0 if there are no fuzzy matches

-- Hash code value
-- (From HASHABLE)

-- Position of first occurrence of c at or after start_index;
-- 0 if none.

-- Character at position i
-- (From TABLE)

-- Character at position i
-- (From TABLE)

-- Numeric code of character at position i

-- Position of last occurrence of c.
-- 0 if none

-- Does string share the text of other?

-- New STRING_8 having same character sequence as Current.

-- Index of first occurrence of other at or after start_index;
-- 0 if none

-- Position of first occurrence of other at or after start_pos
-- and to or before end_pos;
-- 0 if none.

-- Constant string "true"

-- Allocated space
-- (From STRING_GENERAL)

-- Actual number of characters making up the string
-- (From STRING_GENERAL)

-- Range of acceptable indexes
-- (From INDEXABLE)

-- Number of times c appears in the string
-- (From BAG)

-- Proposed number of additional items
--| Result is a reasonable value, resulting from a space-time tradeoff.
-- (From RESIZABLE)

-- Percentage by which structure will grow automatically
-- (From RESIZABLE)

-- Minimal number of additional items
-- (From RESIZABLE)

-- Is current object less than or equal to other?
-- (From PART_COMPARABLE)

-- Is current object greater than other?
-- (From PART_COMPARABLE)

-- Is current object greater than or equal to other?
-- (From PART_COMPARABLE)

-- The greater of current object and other
-- (From COMPARABLE)

-- The smaller of current object and other
-- (From COMPARABLE)

-- If current object equal to other, 0;
-- if smaller, -1; if greater, 1
-- (From COMPARABLE)

-- Is string lexicographically lower than other?
-- (From PART_COMPARABLE)

-- Is string made of same character sequence as other regardless of casing
-- (possibly with a different capacity)?

-- Is string made of same character sequence as other
-- (possibly with a different capacity)?
-- (From ANY)

-- Do Current and other have same character sequence?

-- Is structure empty?
-- (From STRING_GENERAL)

-- May current object be hashed?
-- (True if it is not its type's default.)
-- (From HASHABLE)

-- Has v been inserted by the most recent insertion?
-- (By default, the value returned is equivalent to calling
-- has (v). However, descendants might be able to provide more
-- efficient implementations.)
-- (From COLLECTION)

-- May capacity be changed? (Answer: yes.)
-- (From BOUNDED)

-- Is structure full?
-- (From BOX)

-- Is there no element?
-- (From CONTAINER)

ELKS 2000: Use is_empty instead

-- Must search operations use equal rather than =
-- for comparing references? (Default: no, use =.)
-- (From CONTAINER)

-- Does string include c?
-- (From STRING_GENERAL)

-- (From CONTAINER)

-- May new items be added? (Answer: yes.)
-- (From COLLECTION)

-- Does string include c?
-- (From CONTAINER)

-- Does Current contain other?

-- Does Current represent a BOOLEAN?

-- Does Current represent a REAL_64?

-- Does Current represent an INTEGER_32?

-- Does Current represent an INTEGER_16?

-- Does Current represent an INTEGER_32?

-- Does Current represent an INTEGER_64?

-- Does Current represent an INTEGER_8?

-- Does Current represent a NATURAL_32?

-- Does Current represent a NATURAL_16?

-- Does Current represent a NATURAL_32?

-- Does Current represent a NATURAL_64?

-- Does Current represent a NATURAL_8?

-- Does Current represent a number sequence?

-- Does Current represent a REAL_32?

-- Current is a STRING_32 instance
-- (From STRING_GENERAL)

-- Current is not a STRING_8 instance
-- (From STRING_GENERAL)

-- Is Current convertible to STRING_8 without information loss?
-- (From STRING_GENERAL)

-- May items be removed? (Answer: yes.)
-- (From COLLECTION)

-- Is v a valid code for a CHARACTER_32?
-- (From STRING_GENERAL)

-- Is i within the bounds of the string?
-- (From STRING_GENERAL)

-- Ensure that future search operations will use equal
-- rather than = for comparing references.
-- (From CONTAINER)

-- Ensure that future search operations will use =
-- rather than equal for comparing references.
-- (From CONTAINER)

-- Append a copy of s at end.

-- Append the string representation of b at end.

-- Append c at end.

-- Append the string representation of d at end.

-- Append the string representation of i at end.

-- Append the string representation of r at end.

-- Append a copy of s, if not void, at end.

-- Append a copy of s at end.
-- (From STRING_GENERAL)

-- Reinitialize by copying the characters of other.
-- (This is also used by twin.)
-- (From ANY)

-- Append c at end.
-- (From COLLECTION)

-- Fill with capacity blank characters.

-- Fill with capacity characters all equal to c.

-- Replace every character with c.

-- Remove all characters except for the first n;
-- do nothing if n >= count.

ELKS 2001: use keep_head instead'

-- Append a copy of 's' at the end of a copy of Current,
-- Then return the Result.

-- Add s to left of position i in current string.

ELKS 2001: use insert_string instead

-- Insert c at index i, shifting characters between ranks
-- i and count rightwards.

-- Insert s at index i, shifting characters between ranks
-- i and count rightwards.

-- Remove all characters except for the first n;
-- do nothing if n >= count.

-- Remove all characters except for the last n;
-- do nothing if n >= count.

-- Remove leading whitespace.

-- Add c at front.

-- Prepend a copy of s at front.

-- Prepend the string representation of b at front.

-- Add c at front.

-- Prepend the string representation of d at front.

-- Prepend the string representation of i at front.

-- Prepend the string representation of r at front.

-- Prepend a copy of s, if not void, at front.

-- Replace character at position i by c.
-- (From TABLE)

-- Replace character at position i by character of code v.
-- (From STRING_GENERAL)

-- Replace all current characters with blanks.

-- Replace every character with c.

ELKS 2001: use fill_with instead'

-- Replace characters from start_index to end_index with s.

-- Replace every occurrence of original with new.

-- Remove trailing whitespace.

-- Set current string to substring of t from indices n1
-- to n2, or to empty string if no such substring.

-- Make current string share the text of other.
-- Subsequent changes to the characters of current string
-- will also affect other, and conversely.

-- Copy characters of other within bounds start_pos and
-- end_pos to current string starting at index index_pos.

-- Remove all characters except for the last n;
-- do nothing if n >= count.

ELKS 2001: use keep_tail instead'

-- Fill with as many items of other as possible.
-- The representations of other and current structure
-- need not be the same.
-- (From COLLECTION)

-- Append c at end.
-- (From STRING_GENERAL)

-- Reset all characters.

-- Remove first occurrence of c, if any.
-- (From COLLECTION)

-- Remove all occurrences of c.
-- (From COLLECTION)

-- Remove all leading occurrences of c.

-- Remove all trailing occurrences of c.

-- Remove i-th character.
-- (From STRING_GENERAL)

-- Remove first n characters;
-- if n > count, remove all.

-- Remove all characters from start_index
-- to end_index inclusive.

-- Remove last n characters;
-- if n > count, remove all.

-- Remove all characters.
-- (From COLLECTION)

-- Adapt the size to accommodate count characters.

-- Ensure that the capacity is at least newsize.
-- (From RESIZABLE)

-- Rearrange string so that it can accommodate
-- at least newsize characters.
-- Do not lose any previously entered character.
-- (From STRING_GENERAL)

-- Change the capacity to accommodate at least
-- Growth_percentage more items.
--| Trades space for time:
--| allocates fairly large chunks of memory but not very often.
-- (From RESIZABLE)

-- Convert Current as a STRING_32.
-- (From STRING_GENERAL)

-- Convert Current as a STRING_8. If a code of Current is
-- node a valid code for a STRING_8 it is replaced with the null
-- character.
-- (From STRING_GENERAL)

-- Create an instance of SYSTEM_STRING using characters
-- of Current between indices 1 and count.
-- (From STRING_GENERAL)

-- Convert Current as a STRING_32.
-- (From STRING_GENERAL)

-- Convert Current as a STRING_8.
-- (From STRING_GENERAL)

-- New object with all letters in lower case.

-- New object with all letters in upper case

-- Center justify Current using count as width.

-- Justify a string based on a pivot
-- and the position it needs to be in
-- the final string.
-- This will grow the string if necessary
-- to get the pivot in the correct place.

-- Left justify Current using count as witdth.

-- Representation as a linear structure
-- (From CONTAINER)

-- Reverse the order of characters.
-- "Hello world" -> "dlrow olleH".

-- Mirror image of string;
-- Result for "Hello world" is "dlrow olleH".

-- Right justify Current using count as width.

-- Split on a_separator.

-- Boolean value;
-- "True" yields True, "False" yields False
-- (case-insensitive)

-- A reference to a C form of current string.
-- Useful only for interfacing with C software.

-- "Double" value;
-- for example, when applied to "123.0", will yield 123.0 (double)

-- 32-bit integer value

-- 16-bit integer value

-- 32-bit integer value

-- 64-bit integer value

-- 8-bit integer value

-- Convert to lower case.

-- 32-bit natural value

-- 16-bit natural value

-- 32-bit natural value

-- 64-bit natural value

-- 8-bit natural value

-- Real value;
-- for example, when applied to "123.0", will yield 123.0

-- Convert to upper case.

-- Duplicate a string within itself
-- ("hello").multiply(3) => "hellohellohello"

-- Copy of substring containing all characters at indices
-- between start_index and end_index
-- (From STRING_GENERAL)

-- Original attribute values of mismatched object
-- (From MISMATCH_CORRECTOR)

-- Printable representation
-- (From ANY)

-- Set count to number of characters.
-- (From STRING_GENERAL)