note
	description: "Structures whose items are sorted according to a total order relation"
	library: "Free implementation of ELKS library"
	legal: "See notice at end of class."
	status: "See notice at end of class."
	names: sorted_struct, comparable_struct
	access: index, membership, min, max
	contents: generic
	date: "$Date: 2012-07-23 21:02:19 +0000 (Mon, 23 Jul 2012) $"
	revision: "$Revision: 91989 $"

deferred class 
	SORTED_STRUCT [G -> COMPARABLE]

inherit
	COMPARABLE_STRUCT [G]
		undefine
			search,
			off
		redefine
			min,
			max
		end

	INDEXABLE [G, INTEGER_32]
		rename
			item as i_th,
			put as put_i_th,
			bag_put as putt
		redefine
			putt
		end

	LINEAR [G]

feature -- Measurement

	min: like item
			-- Minimum item
		require else
			is_sorted: sorted
		do
			start
			Result := item
		end

	max: like item
			-- Maximum item
		require else
			is_sorted: sorted
		do
			finish
			Result := item
		end

	median: like item
			-- Median element
		deferred
		ensure
			median_present: has (Result)
		end
	
feature -- Status report

	sorted: BOOLEAN
			-- Is structure sorted?
		local
			m: like item
		do
			if is_empty then
				Result := True
			else
				from
					start
					m := item
					forth
				until
					exhausted or else (item < m)
				loop
					m := item
					forth
				end
				Result := exhausted
			end
		end
	
feature -- Transformation

	sort
			-- Sort structure.
		deferred
		ensure
			is_sorted: sorted
		end
	
feature -- Inapplicable

	putt (v: like item)
			-- Ensure that structure includes v.
		do
		end
	
note
	copyright: "Copyright (c) 1984-2012, Eiffel Software and others"
	license: "Eiffel Forum License v2 (see http://www.eiffel.com/licensing/forum.txt)"
	source: "[
		Eiffel Software
		5949 Hollister Ave., Goleta, CA 93117 USA
		Telephone 805-685-1006, Fax 805-685-6869
		Website http://www.eiffel.com
		Customer support http://support.eiffel.com
	]"

end -- class SORTED_STRUCT

Generated by ISE EiffelStudio