Automatic generation produced by ISE Eiffel

Classes
Clusters
Cluster hierarchy
Chart
Relations
Text
Flat
Contracts
Flat contracts
Go to: 
indexing
	description: "Sorted sets implemented as binary search trees"
	status: "See notice at end of class"
	names: binary_search_tree_set, set, binary_search_tree
	representation: recursive, array
	access: membership, min, max
	contents: generic
	date: "$Date: 2001-11-16 20:32:23 +0000 (Fri, 16 Nov 2001) $"
	revision: "$Revision: 51435 $"

class interface
	BINARY_SEARCH_TREE_SET [G -> COMPARABLE]

create 
	make

feature -- Initialization

	make
			-- Create set.
	
feature -- Measurement

	count: INTEGER
			-- Number of items in tree

	min: like item
			-- Minimum item in tree

	max: like item
			-- Maximum item in tree

	item: G
			-- Current item
	
feature -- Status report

	is_empty: BOOLEAN
			-- Is set empty?

	Extendible: BOOLEAN is True
			-- Can new items be added? (Answer: yes.)

	Prunable: BOOLEAN is True
			-- Can items be removed? (Answer: yes.)

	after: BOOLEAN
			-- Is there no valid cursor position to the right of cursor?

	before: BOOLEAN
			-- Is there no valid cursor position to the left of cursor?

	has (v: like item): BOOLEAN
			-- Is there a node with item v in tree?
			-- (Reference or object equality,
			-- based on object_comparison.)

	off: BOOLEAN
			-- Is there no current item?
			-- off only if tree is_empty or if
			-- it is before or after.
	
feature -- Cursor movement

	start
			-- Move cursor to first node.

	finish
			-- Move cursor to last node.

	forth
			-- Move cursor to next node.

	back
			-- Move cursor to previous node.
	
feature -- Element change

	put (v: like item)
			-- Put v at proper position in set
			-- (unless one already exists).
			-- Was declared in BINARY_SEARCH_TREE_SET as synonym of extend.
		require else
			item_exists: v /= void

	extend (v: like item)
			-- Put v at proper position in set
			-- (unless one already exists).
			-- Was declared in BINARY_SEARCH_TREE_SET as synonym of put.
		require else
			item_exists: v /= void
	
feature -- Removal

	wipe_out
			-- Remove all items.

	prune (v: like item)
			-- Remove v.

	remove
			-- Remove current item.
	
feature -- Duplication

	duplicate (n: INTEGER): BINARY_SEARCH_TREE_SET [G]
			-- New structure containing min (n, count)
			-- items from current structure
	
invariant

	comparison_mode_equal: tree /= void implies object_comparison = tree.object_comparison

indexing
	library: "[
			EiffelBase: Library of reusable components for Eiffel.
	]"
	status: "[
			Copyright 1986-2001 Interactive Software Engineering (ISE).
			For ISE customers the original versions are an ISE product
			covered by the ISE Eiffel license and support agreements.
	]"
	license: "[
			EiffelBase may now be used by anyone as FREE SOFTWARE to
			develop any product, public-domain or commercial, without
			payment to ISE, under the terms of the ISE Free Eiffel Library
			License (IFELL) at http://eiffel.com/products/base/license.html.
	]"
	source: "[
			Interactive Software Engineering Inc.
			ISE Building
			360 Storke Road, Goleta, CA 93117 USA
			Telephone 805-685-1006, Fax 805-685-6869
			Electronic mail <info@eiffel.com>
			Customer support http://support.eiffel.com
	]"
	info: "[
			For latest info see award-winning pages: http://eiffel.com
	]"

end -- class BINARY_SEARCH_TREE_SET


Classes
Clusters
Cluster hierarchy
Chart
Relations
Text
Flat
Contracts
Flat contracts
Go to: 

-- Generated by ISE Eiffel --
For more details: www.eiffel.com