Automatic generation produced by ISE Eiffel
indexing description: "[ Strategies for calculating several features for subsets represented by binary search trees. Contained items have to be COMPARABLE ]" status: "See notice at end of class" date: "$Date: 2001-11-16 20:32:23 +0000 (Fri, 16 Nov 2001) $" revision: "$Revision: 51435 $" class interface SUBSET_STRATEGY_TREE [G -> COMPARABLE] feature -- Comparison disjoint (set1, set2: BINARY_SEARCH_TREE_SET [G]): BOOLEAN -- Are set1 and set2 disjoint? feature -- Basic operations symdif (set1, set2: BINARY_SEARCH_TREE_SET [G]) -- Remove all items of set1 that are also in set2, and add all -- items of set2 not already present in set1. 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 SUBSET_STRATEGY_TREE -- Generated by ISE Eiffel --
For more details: www.eiffel.com