class
	BINARY_SEARCH_TREE_SET [G -> COMPARABLE]

General
	cluster: elks
	description: "Sorted sets implemented as binary search trees"
	create: make, make_from_iterable

Ancestors
	COMPARABLE_SET* [G -> COMPARABLE]
	TRAVERSABLE_SUBSET* [G]

Queries
	after: BOOLEAN
	before: BOOLEAN
	changeable_comparison_criterion: BOOLEAN
	count: INTEGER_32
	cs_max: [like item] G
	cs_min: [like item] G
	disjoint (other: TRAVERSABLE_SUBSET [G]): BOOLEAN
	exhausted: BOOLEAN
	Extendible: BOOLEAN
	for_all (test: FUNCTION [G, BOOLEAN]): BOOLEAN
	has alias "∋" (v: [like item] G): BOOLEAN
	index: INTEGER_32
	index_of (v: [like item] G; i: INTEGER_32): INTEGER_32
	is_empty: BOOLEAN
	is_inserted (v: G): BOOLEAN
	is_subset alias "⊆" (other: TRAVERSABLE_SUBSET [G]): BOOLEAN
	is_superset alias "⊇" (other: SUBSET [G]): BOOLEAN
	item: G
	item_for_iteration: G
	linear_representation: LINEAR [G]
	max: [like item] G
	min: [like item] G
	min_max_available: BOOLEAN
	new_cursor: ITERATION_CURSOR [G]
	object_comparison: BOOLEAN
	occurrences (v: [like item] G): INTEGER_32
	off: BOOLEAN
	Prunable: BOOLEAN
	there_exists (test: FUNCTION [G, BOOLEAN]): BOOLEAN

Commands
	back
	compare_objects
	compare_references
	do_all (action: PROCEDURE [G])
	do_if (action: PROCEDURE [G]; test: FUNCTION [G, BOOLEAN])
	extend (v: [like item] G)
	fill (other: CONTAINER [G])
	finish
	forth
	intersect (other: TRAVERSABLE_SUBSET [G])
	merge (other: CONTAINER [G])
	prune (v: [like item] G)
	prune_all (v: G)
	put (v: [like item] G)
	remove
	search (v: [like item] G)
	start
	subtract (other: TRAVERSABLE_SUBSET [G])
	symdif (other: TRAVERSABLE_SUBSET [G])
	wipe_out

Constraints
	comparison mode equal

Generated by ISE EiffelStudio