Automatic generation produced by ISE Eiffel

Classes
Clusters
Cluster hierarchy
Chart
Relations
Flat contracts
Go to: 
class
	SORTABLE_ARRAY [G -> COMPARABLE]

General
	cluster: base_extension
	description: "Sortable Array"
	create: make_empty, make, make_filled, make_from_array

Ancestors
	ARRAY [G]

Queries
	additional_space: INTEGER_32
	all_default: BOOLEAN
	area: SPECIAL [G]
	at alias "@" (i: INTEGER_32): G
	capacity: INTEGER_32
	changeable_comparison_criterion: BOOLEAN
	count: INTEGER_32
	entry (i: INTEGER_32): G
	extendible: BOOLEAN
	filled_with (v: G): BOOLEAN
	for_all (test: FUNCTION [G, BOOLEAN]): BOOLEAN
	found: BOOLEAN
	found_index: INTEGER_32
	full: BOOLEAN
	Growth_percentage: INTEGER_32
	has (v: G): BOOLEAN
	is_empty: BOOLEAN
	is_equal (other: [like Current] SORTABLE_ARRAY [G]): BOOLEAN
	is_inserted (v: G): BOOLEAN
	item alias "[]" (i: INTEGER_32): G
	linear_representation: LINEAR [G]
	lower: INTEGER_32
	Minimal_increase: INTEGER_32
	new_cursor: ARRAY_ITERATION_CURSOR [G]
	next_item_in_range (random_generator: RANDOM; a_min, a_max: INTEGER_32): INTEGER_32
	object_comparison: BOOLEAN
	occurrences (v: G): INTEGER_32
	prunable: BOOLEAN
	resizable: BOOLEAN
	same_items (other: [like Current] SORTABLE_ARRAY [G]): BOOLEAN
	subarray (start_pos, end_pos: INTEGER_32): SORTABLE_ARRAY [G]
	there_exists (test: FUNCTION [G, BOOLEAN]): BOOLEAN
	to_c: ANY
	to_cil: NATIVE_ARRAY [G]
	to_special: SPECIAL [G]
	upper: INTEGER_32
	valid_index (i: INTEGER_32): BOOLEAN

Commands
	automatic_grow
	bag_put (v: G)
	balanced_linear_search (a_item: G; a_start: INTEGER_32)
	binary_search (a_item: G)
	clear_all
	compare_objects
	compare_references
	conservative_resize_with_default (a_default_value: G; min_index, max_index: INTEGER_32)
	copy (other: [like Current] SORTABLE_ARRAY [G])
	discard_items
	do_all (action: PROCEDURE [G])
	do_all_with_index (action: PROCEDURE [G, INTEGER_32])
	do_if (action: PROCEDURE [G]; test: FUNCTION [G, BOOLEAN])
	do_if_with_index (action: PROCEDURE [G, INTEGER_32]; test: FUNCTION [G, INTEGER_32, BOOLEAN])
	enter (v: [like item] G; i: INTEGER_32)
	extend (v: G)
	fill (other: CONTAINER [G])
	fill_with (v: G)
	force (v: [like item] G; i: INTEGER_32)
	force_and_fill (v: [like item] G; i: INTEGER_32)
	grow (i: INTEGER_32)
	keep_head (n: INTEGER_32)
	keep_tail (n: INTEGER_32)
	linear_search (a_item: G)
	make_empty
	make_filled (a_default_value: G; min_index, max_index: INTEGER_32)
	make_from_array (a: ARRAY [G])
	make_from_cil (na: NATIVE_ARRAY [[like item] G])
	make_from_special (a: SPECIAL [G])
	prune (v: G)
	prune_all (v: G)
	put (v: [like item] G; i: INTEGER_32)
	rebase (a_lower: [like lower] INTEGER_32)
	remove_head (n: INTEGER_32)
	remove_tail (n: INTEGER_32)
	sort
	subcopy (other: ARRAY [[like item] G]; start_pos, end_pos, index_pos: INTEGER_32)
	trim



Classes
Clusters
Cluster hierarchy
Chart
Relations
Flat contracts
Go to: 

-- Generated by Eiffel Studio --
For more details: eiffel.org