class
	FIXED_LIST [G]

General
	cluster: base
	description: "Lists with fixed maximum numbers of items, implemented by arrays"
	create: make_filled, make

Ancestors
	ARRAY [G]
	FIXED* [G]
	LIST* [G]

Queries
	after: BOOLEAN
	area: SPECIAL [G]
	before: BOOLEAN
	capacity: INTEGER_32
	changeable_comparison_criterion: BOOLEAN
	count: INTEGER_32
	cursor: ARRAYED_LIST_CURSOR
	duplicate (n: INTEGER_32): [like Current] FIXED_LIST [G]
	exhausted: BOOLEAN
	extendible: BOOLEAN
	first: G
	for_all (test: FUNCTION [ANY, TUPLE [G], BOOLEAN]): BOOLEAN
	full: BOOLEAN
	has (v: [like item] G): BOOLEAN
	i_th alias "[]" (i: INTEGER_32): G
	index: INTEGER_32
	index_of (v: [like item] G; i: INTEGER_32): INTEGER_32
	index_set: INTEGER_INTERVAL
	infix "@" (i: INTEGER_32): G
	is_empty: BOOLEAN
	is_equal (other: [like Current] FIXED_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
	Resizable: 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] FIXED_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)
	finish
	forth
	go_i_th (i: INTEGER_32)
	go_to (p: CURSOR)
	make (n: INTEGER_32)
	make_filled (n: INTEGER_32)
	move (i: INTEGER_32)
	put (v: [like first] G)
	put_i_th (v: [like i_th] G; i: INTEGER_32)
	remove
	replace (v: [like first] G)
	search (v: [like item] G)
	start
	swap (i: INTEGER_32)

Constraints
	empty means storage empty