deferred class PART_SORTED_LIST [G -> PART_COMPARABLE] General cluster: base description: "Sequential lists whose items are sorted in ascending order according to the relational operators of PART_COMPARABLE" Ancestors LIST* [G] Queries after: BOOLEAN before: BOOLEAN changeable_comparison_criterion: BOOLEAN count: INTEGER_32 cursor: CURSOR duplicate (n: INTEGER_32): [like Current] PART_SORTED_LIST [G] exhausted: BOOLEAN extendible: BOOLEAN first: [like item] G for_all (test: FUNCTION [ANY, TUPLE [G], BOOLEAN]): BOOLEAN full: BOOLEAN has (v: G): BOOLEAN i_th alias "[]" (i: INTEGER_32): [like item] G index: INTEGER_32 index_of (v: [like item] G; i: INTEGER_32): INTEGER_32 index_set: INTEGER_INTERVAL infix "@" (i: INTEGER_32): [like item] G is_empty: BOOLEAN is_equal (other: [like Current] PART_SORTED_LIST [G]): BOOLEAN is_inserted (v: G): BOOLEAN isfirst: BOOLEAN islast: BOOLEAN item: G last: [like item] G linear_representation: LINEAR [G] object_comparison: BOOLEAN occurrences (v: [like item] G): INTEGER_32 off: BOOLEAN prunable: BOOLEAN readable: BOOLEAN sequential_occurrences (v: [like item] G): INTEGER_32 sorted: BOOLEAN there_exists (test: FUNCTION [ANY, TUPLE [G], BOOLEAN]): BOOLEAN valid_cursor (p: CURSOR): BOOLEAN valid_cursor_index (i: INTEGER_32): BOOLEAN valid_index (i: INTEGER_32): BOOLEAN writable: BOOLEAN Commands append (s: SEQUENCE [G]) back compare_objects compare_references do_all (action: PROCEDURE [ANY, TUPLE [G]]) do_if (action: PROCEDURE [ANY, TUPLE [G]]; test: FUNCTION [ANY, TUPLE [G], BOOLEAN]) extend (v: [like item] G) fill (other: CONTAINER [G]) finish force (v: [like item] G) forth go_i_th (i: INTEGER_32) go_to (p: CURSOR) merge (other: LINEAR [G]) move (i: INTEGER_32) prune (v: [like item] G) prune_all (v: [like item] G) put (v: [like item] G) put_i_th (v: [like item] G; i: INTEGER_32) remove replace (v: G) search (v: [like item] G) search_after (v: [like item] G) search_before (v: [like item] G) start swap (i: INTEGER_32) wipe_out