Automatic generation produced by ISE Eiffel
indexing description: "Contiguous integer intervals" 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 INTEGER_INTERVAL create make feature -- Initialization adapt (other: INTEGER_INTERVAL) -- Reset to be the same interval as other. require other_not_void: other /= void ensure same_lower: lower = other.lower same_upper: upper = other.upper same_lower_defined: lower_defined = other.lower_defined same_upper_defined: upper_defined = other.upper_defined feature -- Access lower_defined: BOOLEAN -- Is there a lower bound? lower: INTEGER -- Smallest value in interval require lower_defined: lower_defined upper_defined: BOOLEAN -- Is there an upper bound? upper: INTEGER -- Largest value in interval require upper_defined: upper_defined item (i: INTEGER): INTEGER -- Entry at index i, if in index interval -- Was declared in INTEGER_INTERVAL as synonym of @. infix "@" (i: INTEGER): INTEGER -- Entry at index i, if in index interval -- Was declared in INTEGER_INTERVAL as synonym of item. has (v: INTEGER): BOOLEAN -- Does v appear in interval? -- Was declared in INTEGER_INTERVAL as synonym of valid_index. ensure then iff_within_bounds: Result = ((upper_defined implies v <= upper) and (lower_defined implies v >= lower)) valid_index (v: INTEGER): BOOLEAN -- Does v appear in interval? -- Was declared in INTEGER_INTERVAL as synonym of has. ensure then iff_within_bounds: Result = ((upper_defined implies v <= upper) and (lower_defined implies v >= lower)) feature -- Measurement occurrences (v: INTEGER): INTEGER -- Number of times v appears in structure ensure then one_iff_in_bounds: Result = 1 implies has (v) zero_otherwise: Result /= 1 implies Result = 0 capacity: INTEGER -- Maximum number of items in interval -- (here the same thing as count) count: INTEGER -- Number of items in interval ensure then definition: Result = upper - lower + 1 index_set: INTEGER_INTERVAL -- Range of acceptable indexes -- (here: the interval itself) ensure then index_set_is_range: equal (Result, Current) feature -- Comparison is_equal (other: like Current): BOOLEAN -- Is array made of the same items as other? ensure then iff_same_bounds: Result = ((lower_defined implies (other.lower_defined and lower = other.lower)) and (upper_defined implies (other.upper_defined and upper = other.upper))) feature -- Status report all_cleared: BOOLEAN -- Are all items set to default values? ensure then iff_at_zero: Result = ((lower = 0) and (upper = 0)) extendible: BOOLEAN -- May new items be added? -- Answer: yes prunable: BOOLEAN -- May individual items be removed? -- Answer: no feature -- Element change extend (v: INTEGER) -- Make sure that interval goes all the way -- to v (up or down). -- Was declared in INTEGER_INTERVAL as synonym of put. ensure then extended_down: lower = (old lower).min (v) extended_up: upper = (old upper).max (v) put (v: INTEGER) -- Make sure that interval goes all the way -- to v (up or down). -- Was declared in INTEGER_INTERVAL as synonym of extend. ensure then extended_down: lower = (old lower).min (v) extended_up: upper = (old upper).max (v) feature -- Resizing resize (min_index, max_index: INTEGER) -- Rearrange interval to go from at most -- min_index to at least max_index, -- encompassing previous bounds. resize_exactly (min_index, max_index: INTEGER) -- Rearrange interval to go from -- min_index to max_index. grow (i: INTEGER) -- Ensure that capacity is at least i. ensure then no_loss_from_bottom: lower <= old lower no_loss_from_top: upper >= old upper feature -- Removal wipe_out -- Remove all items. feature -- Conversion as_array: ARRAY [INTEGER] -- Plain array containing interval's items require finite: upper_defined and lower_defined ensure same_lower: Result.lower = lower same_upper: Result.upper = upper to_c: ANY -- Address of actual sequence of values, -- for passing to external (non-Eiffel) routines. require finite: upper_defined and lower_defined linear_representation: LINEAR [INTEGER] -- Representation as a linear structure feature -- Duplication copy (other: like Current) -- Reset to be the same interval as other. ensure then same_lower: lower = other.lower same_upper: upper = other.upper same_lower_defined: lower_defined = other.lower_defined same_upper_defined: upper_defined = other.upper_defined subinterval (start_pos, end_pos: INTEGER): like Current -- Interval made of items of current array within -- bounds start_pos and end_pos. feature -- Iteration for_all (condition: FUNCTION [ANY, TUPLE [INTEGER], BOOLEAN]): BOOLEAN -- Do all interval's values satisfy condition? require finite: upper_defined and lower_defined ensure consistent_with_count: Result = (hold_count (condition) = count) exists (condition: FUNCTION [ANY, TUPLE [INTEGER], BOOLEAN]): BOOLEAN -- Does at least one of interval's values -- satisfy condition? require finite: upper_defined and lower_defined ensure consistent_with_count: Result = (hold_count (condition) > 0) exists1 (condition: FUNCTION [ANY, TUPLE [INTEGER], BOOLEAN]): BOOLEAN -- Does exactly one of interval's values -- satisfy condition? require finite: upper_defined and lower_defined ensure consistent_with_count: Result = (hold_count (condition) = 1) hold_count (condition: FUNCTION [ANY, TUPLE [INTEGER], BOOLEAN]): INTEGER -- Number of interval's values that -- satisfy condition require finite: upper_defined and lower_defined ensure non_negative: Result >= 0 invariant count_definition: upper_defined and lower_defined implies count = upper - lower + 1 index_set_is_range: equal (index_set, Current) not_infinite: upper_defined and lower_defined 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 INTEGER_INTERVAL -- Generated by ISE Eiffel --
For more details: www.eiffel.com