Automatic generation produced by ISE Eiffel
indexing description: "Sets whose items may be compared according to a total order relation" status: "See notice at end of class" names: comparable_set, comparable_struct access: membership, min, max contents: generic date: "$Date: 2001-11-16 20:32:23 +0000 (Fri, 16 Nov 2001) $" revision: "$Revision: 51435 $" deferred class interface COMPARABLE_SET [G -> COMPARABLE] feature -- Access has (v: like item): BOOLEAN -- Does structure include an occurrence of v? -- (Reference or object equality, -- based on object_comparison.) -- (from LINEAR) ensure -- from CONTAINER not_found_in_empty: Result implies not is_empty feature -- Measurement count: INTEGER -- Number of items -- (from SET) max: G -- Maximum item require not_empty: not is_empty min: G -- Minimum item require not_empty: not is_empty feature -- Comparison disjoint (other: SUBSET [G]): BOOLEAN -- Do current set and other have no items in common? -- (This feature is redefined in all descendants. The default -- implementation given here is only to stay backward-compatible -- with older versions of EiffelBase.) -- (from SUBSET) require -- from SUBSET set_exists: other /= void same_rule: object_comparison = other.object_comparison is_subset (other: SUBSET [G]): BOOLEAN -- Is current set a subset of other? -- (from SUBSET) require -- from SUBSET set_exists: other /= void same_rule: object_comparison = other.object_comparison is_superset (other: SUBSET [G]): BOOLEAN -- Is current set a superset of other? -- (from SUBSET) require -- from SUBSET set_exists: other /= void same_rule: object_comparison = other.object_comparison feature -- Status report extendible: BOOLEAN -- May new items be added? -- (from COLLECTION) is_empty: BOOLEAN -- Is there no element? -- (from CONTAINER) is_inserted (v: G): BOOLEAN -- Has v been inserted by the most recent insertion? -- (By default, the value returned is equivalent to calling -- `has (v)'. However, descendants might be able to provide more -- efficient implementations.) -- (from COLLECTION) object_comparison: BOOLEAN -- Must search operations use equal rather than = -- for comparing references? (Default: no, use =.) -- (from CONTAINER) prunable: BOOLEAN -- May items be removed? -- (from COLLECTION) feature -- Status setting compare_objects -- Ensure that future search operations will use equal -- rather than = for comparing references. -- (from CONTAINER) require -- from CONTAINER changeable_comparison_criterion ensure -- from CONTAINER object_comparison compare_references -- Ensure that future search operations will use = -- rather than equal for comparing references. -- (from CONTAINER) require -- from CONTAINER changeable_comparison_criterion ensure -- from CONTAINER reference_comparison: not object_comparison feature -- Element change extend (v: G) -- Ensure that set includes v. -- Was declared in SET as synonym of put. -- (from SET) require -- from COLLECTION extendible: extendible ensure -- from COLLECTION item_inserted: is_inserted (v) ensure then -- from SET in_set_already: old has (v) implies (count = old count) added_to_set: not old has (v) implies (count = old count + 1) fill (other: CONTAINER [G]) -- Fill with as many items of other as possible. -- The representations of other and current structure -- need not be the same. -- (from COLLECTION) require -- from COLLECTION other_not_void: other /= void extendible merge (other: CONTAINER [G]) -- Add all items of other. -- (from SUBSET) require -- from SUBSET set_exists: other /= void same_rule: object_comparison = other.object_comparison put (v: G) -- Ensure that set includes v. -- Was declared in SET as synonym of extend. -- (from SET) require -- from COLLECTION extendible: extendible ensure -- from COLLECTION item_inserted: is_inserted (v) ensure then -- from SET in_set_already: old has (v) implies (count = old count) added_to_set: not old has (v) implies (count = old count + 1) feature -- Removal changeable_comparison_criterion: BOOLEAN -- May object_comparison be changed? -- (Answer: only if set empty; otherwise insertions might -- introduce duplicates, destroying the set property.) -- (from SET) ensure then -- from SET only_on_empty: Result = is_empty prune (v: G) -- Remove v if present. -- (from SET) require -- from COLLECTION prunable: prunable ensure then -- from SET removed_count_change: old has (v) implies (count = old count - 1) not_removed_no_count_change: not old has (v) implies (count = old count) item_deleted: not has (v) prune_all (v: G) -- Remove all occurrences of v. -- (Reference or object equality, -- based on object_comparison.) -- (from COLLECTION) require -- from COLLECTION prunable ensure -- from COLLECTION no_more_occurrences: not has (v) wipe_out -- Remove all items. -- (from COLLECTION) require -- from COLLECTION prunable ensure -- from COLLECTION wiped_out: is_empty feature -- Conversion linear_representation: LINEAR [G] -- Representation as a linear structure -- (from LINEAR) feature -- Duplication duplicate (n: INTEGER): like Current -- New structure containing min (n, count) -- items from current structure -- (from SUBSET) require -- from SUBSET non_negative: n >= 0 ensure -- from SUBSET correct_count_1: n <= count implies Result.count = n correct_count_2: n >= count implies Result.count = count feature -- Basic operations intersect (other: SUBSET [G]) -- Remove all items not in other. -- (from SUBSET) require -- from SUBSET set_exists: other /= void same_rule: object_comparison = other.object_comparison ensure -- from SUBSET is_subset_other: is_subset (other) subtract (other: SUBSET [G]) -- Remove all items also in other. -- (from SUBSET) require -- from SUBSET set_exists: other /= void same_rule: object_comparison = other.object_comparison ensure -- from SUBSET is_disjoint: disjoint (other) symdif (other: SUBSET [G]) -- Remove all items also in other, and add all -- items of other not already present. -- (This feature is redefined in all descendants. The default -- implementation given here is only to stay backward-compatible -- with older versions of EiffelBase.) -- (from SUBSET) require -- from SUBSET set_exists: other /= void same_rule: object_comparison = other.object_comparison invariant -- from ANY reflexive_equality: standard_is_equal (Current) reflexive_conformance: conforms_to (Current) -- from COMPARABLE_STRUCT empty_constraint: min_max_available implies not is_empty -- from BILINEAR not_both: not (after and before) before_constraint: before implies off -- from LINEAR after_constraint: after implies off -- from TRAVERSABLE empty_constraint: is_empty implies off 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 COMPARABLE_SET -- Generated by ISE Eiffel --
For more details: www.eiffel.com