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
	disjoint (other: TRAVERSABLE_SUBSET [G]): BOOLEAN
	Extendible: BOOLEAN
	has (v: [like item] G): BOOLEAN
	is_empty: BOOLEAN
	is_inserted (v: G): BOOLEAN
	is_subset (other: TRAVERSABLE_SUBSET [G]): BOOLEAN
	is_superset (other: SUBSET [G]): BOOLEAN
	item: G
	linear_representation: LINEAR [G]
	max: [like item] G
	min: [like item] G
	new_cursor: ITERATION_CURSOR [G]
	object_comparison: BOOLEAN
	off: BOOLEAN
	Prunable: BOOLEAN

Commands
	back
	compare_objects
	compare_references
	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
	start
	subtract (other: TRAVERSABLE_SUBSET [G])
	symdif (other: TRAVERSABLE_SUBSET [G])
	wipe_out

Constraints
	comparison mode equal

Generated by ISE EiffelStudio