note
	description: "[
		Sets whose items may be compared according to a total order relation;
		implemented as sorted two-way lists.
	]"
	library: "Free implementation of ELKS library"
	legal: "See notice at end of class."
	status: "See notice at end of class."
	names: sorted_set, set, two_way_list
	representation: linked
	access: membership, min, max
	contents: generic
	date: "$Date: 2019-07-05 15:26:16 +0000 (Fri, 05 Jul 2019) $"
	revision: "$Revision: 103325 $"

class interface
	TWO_WAY_SORTED_SET [G -> COMPARABLE]

create 
	make,
	make_from_iterable


create {TWO_WAY_SORTED_SET}
	make_sublist

feature -- Element change

	extend (v: G)
			-- Ensure that structure includes v.
			-- Was declared in TWO_WAY_SORTED_SET as synonym of put.

	put (v: G)
			-- Ensure that structure includes v.
			-- Was declared in TWO_WAY_SORTED_SET as synonym of extend.

	merge (other: TRAVERSABLE_SUBSET [G])
			-- Add all items of other.
	
feature -- Removal

	prune (v: like item)
			-- Remove v if present.
	
feature -- Basic operations

	intersect (other: like Current)
			-- Remove all items not in other.

	subtract (other: like Current)
			-- Remove all items also in other.
	
feature -- Inapplicable

	subset_symdif (other: SUBSET [G])
			-- Inapplicable symdif.
	
note
	copyright: "Copyright (c) 1984-2019, 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 TWO_WAY_SORTED_SET

Generated by ISE EiffelStudio