    class
    	ARRAYED_LIST [G]

    General
    	cluster: base
    	description: "Lists implemented by resizable arrays"
    	create: array_make, make_from_array, make_filled, make

    Ancestors
    	ARRAY [G]
    	DYNAMIC_LIST* [G]

    Queries
    	after: BOOLEAN
    	before: BOOLEAN
    	capacity: INTEGER_32
    	changeable_comparison_criterion: BOOLEAN
    	count: INTEGER_32
    	cursor: ARRAYED_LIST_CURSOR
    	duplicate (n: INTEGER_32): [like Current] ARRAYED_LIST [G]
    	exhausted: BOOLEAN
    	Extendible: BOOLEAN
    	first: [like item] G
    	for_all (test: FUNCTION [ANY, TUPLE [G], BOOLEAN]): BOOLEAN
    	full: BOOLEAN
    	has (v: [like item] 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] ARRAYED_LIST [G]): BOOLEAN
    	is_inserted (v: G): BOOLEAN
    	isfirst: BOOLEAN
    	islast: BOOLEAN
    	item: G
    	last: [like first] 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
    	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
    	copy (other: [like Current] ARRAYED_LIST [G])
    	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)
    	make (n: INTEGER_32)
    	make_filled (n: INTEGER_32)
    	make_from_array (a: ARRAY [G])
    	merge_left (other: ARRAYED_LIST [G])
    	merge_right (other: ARRAYED_LIST [G])
    	move (i: INTEGER_32)
    	prune (v: [like item] G)
    	prune_all (v: [like item] G)
    	put (v: [like item] G)
    	put_front (v: [like item] G)
    	put_i_th (v: [like i_th] G; i: INTEGER_32)
    	put_left (v: [like item] G)
    	put_right (v: [like item] G)
    	remove
    	remove_left
    	remove_right
    	replace (v: [like first] G)
    	resize (new_capacity: INTEGER_32)
    	search (v: [like item] G)
    	start
    	swap (i: INTEGER_32)
    	wipe_out

    Constraints
    	prunable
    	starts from one
    	empty means storage empty