indexing
description: "Priority queues implemented as sorted lists"
legal: "See notice at end of class."
status: "See notice at end of class."
names: priority_queue, queue
contents: generic
date: "$Date: 2006-01-22 18:25:44 -0800 (Sun, 22 Jan 2006) $"
revision: "$Revision: 56675 $"
class interface
LINKED_PRIORITY_QUEUE [G -> COMPARABLE]
create
make
LINKED_LIST
ensure LINKED_LIST
is_before: before
create {LINKED_PRIORITY_QUEUE}
make_sublist (first_item, last_item: like first_element; n: INTEGER_32)
TWO_WAY_LIST
feature
generating_type: STRING_8
ANY
generator: STRING_8
ANY
has (v: G): BOOLEAN
`v'
object_comparison
PART_SORTED_LIST
require CONTAINER
True
ensure CONTAINER
not_found_in_empty: Result implies not is_empty
item: G
require ACTIVE
readable: readable
feature
count: INTEGER_32
LINKED_LIST
occurrences (v: like sl_item): INTEGER_32
`v'
object_comparison
CHAIN
require BAG
True
require LINEAR
True
ensure BAG
non_negative_occurrences: Result >= 0
feature
frozen deep_equal (some: ANY; other: like arg #1): BOOLEAN
`some'`other'
ANY
ensure ANY
shallow_implies_deep: standard_equal (some, other) implies Result
both_or_none_void: (some = Void) implies (Result = (other = Void))
same_type: (Result and (some /= Void)) implies some.same_type (other)
symmetric: Result implies deep_equal (other, some)
frozen equal (some: ANY; other: like arg #1): BOOLEAN
`some'`other'
ANY
ensure ANY
definition: Result = (some = Void and other = Void) or else ((some /= Void and other /= Void) and then some.is_equal (other))
is_equal (other: like Current): BOOLEAN
`other'
LIST
require ANY
other_not_void: other /= Void
ensure ANY
symmetric: Result implies other.is_equal (Current)
consistent: standard_is_equal (other) implies Result
ensure then LIST
indices_unchanged: index = old index and other.index = old other.index
true_implies_same_size: Result implies count = other.count
frozen standard_equal (some: ANY; other: like arg #1): BOOLEAN
`some'`other'
ANY
ensure ANY
definition: Result = (some = Void and other = Void) or else ((some /= Void and other /= Void) and then some.standard_is_equal (other))
frozen standard_is_equal (other: like Current): BOOLEAN
`other'
ANY
require ANY
other_not_void: other /= Void
ensure ANY
same_type: Result implies same_type (other)
symmetric: Result implies other.standard_is_equal (Current)
feature
changeable_comparison_criterion: BOOLEAN
object_comparison
CONTAINER
conforms_to (other: ANY): BOOLEAN
`other'
ANY
require ANY
other_not_void: other /= Void
extendible: BOOLEAN is True
DYNAMIC_CHAIN
full: BOOLEAN is False
LINKED_LIST
is_empty: BOOLEAN
FINITE
require CONTAINER
True
is_inserted (v: G): BOOLEAN
`v'
`has (v)'
COLLECTION
object_comparison: BOOLEAN
equal`='
`='
CONTAINER
prunable: BOOLEAN
DYNAMIC_CHAIN
require COLLECTION
True
readable: BOOLEAN
LINKED_LIST
require ACTIVE
True
same_type (other: ANY): BOOLEAN
`other'
ANY
require ANY
other_not_void: other /= Void
ensure ANY
definition: Result = (conforms_to (other) and other.conforms_to (Current))
writable: BOOLEAN
SEQUENCE
require ACTIVE
True
feature
compare_objects
equal
`='
CONTAINER
require CONTAINER
changeable_comparison_criterion: changeable_comparison_criterion
ensure CONTAINER
object_comparison
compare_references
`='
equal
CONTAINER
require CONTAINER
changeable_comparison_criterion: changeable_comparison_criterion
ensure CONTAINER
reference_comparison: not object_comparison
feature
append (s: SEQUENCE [G])
`s'
CHAIN
require SEQUENCE
argument_not_void: s /= Void
require DISPENSER
True
ensure SEQUENCE
new_count: count >= old count
extend (v: like sl_item)
`v'
SORTED_TWO_WAY_LIST
require COLLECTION
extendible: extendible
ensure COLLECTION
item_inserted: is_inserted (v)
ensure then BAG
one_more_occurrence: occurrences (v) = old (occurrences (v)) + 1
ensure then PART_SORTED_LIST
remains_sorted: (old sorted) implies sorted
item_inserted: sl_item = v
fill (other: CONTAINER [G])
`other'
`other'
CHAIN
require COLLECTION
other_not_void: other /= Void
extendible: extendible
force (v: like sl_item)
`v'
SEQUENCE
require DISPENSER
True
require SEQUENCE
extendible: extendible
ensure then SEQUENCE
new_count: count = old count + 1
item_inserted: has (v)
put (v: like item)
`v'
require COLLECTION
extendible: extendible
ensure COLLECTION
item_inserted: is_inserted (v)
replace (v: like sl_item)
`v'
LINKED_LIST
require ACTIVE
writable: writable
ensure ACTIVE
item_replaced: item = v
feature
prune (v: like sl_item)
`v'
exhausted
DYNAMIC_CHAIN
require COLLECTION
prunable: prunable
prune_all (v: like sl_item)
`v'
object_comparison
off
SORTED_TWO_WAY_LIST
require COLLECTION
prunable: prunable
ensure COLLECTION
no_more_occurrences: not has (v)
ensure then DYNAMIC_CHAIN
is_exhausted: exhausted
remove
require ACTIVE
prunable: prunable
writable: writable
wipe_out
TWO_WAY_LIST
require COLLECTION
prunable: prunable
ensure COLLECTION
wiped_out: is_empty
ensure then DYNAMIC_LIST
is_before: before
feature
linear_representation: LINEAR [G]
LINEAR
require CONTAINER
True
feature
copy (other: like Current)
`other'
ANY
require ANY
other_not_void: other /= Void
type_identity: same_type (other)
ensure ANY
is_equal: is_equal (other)
frozen deep_copy (other: like Current)
copy`other'deep_twin
ANY
require ANY
other_not_void: other /= Void
ensure ANY
deep_equal: deep_equal (Current, other)
frozen deep_twin: like Current
ANY
ensure ANY
deep_equal: deep_equal (Current, Result)
frozen standard_copy (other: like Current)
`other'
ANY
require ANY
other_not_void: other /= Void
type_identity: same_type (other)
ensure ANY
is_standard_equal: standard_is_equal (other)
frozen standard_twin: like Current
`other'
ANY
ensure ANY
standard_twin_not_void: Result /= Void
equal: standard_equal (Result, Current)
frozen twin: like Current
`Current'
twincopycopy
ANY
ensure ANY
twin_not_void: Result /= Void
is_equal: Result.is_equal (Current)
feature
frozen default: like Current
ANY
frozen default_pointer: POINTER
`POINTER'
`p'default
`p'`POINTER'
ANY
default_rescue
ANY
frozen do_nothing
ANY
feature
io: STD_FILES
ANY
out: STRING_8
ANYtagged_out
ANY
print (some: ANY)
`some'
ANY
frozen tagged_out: STRING_8
ANYout
ANY
feature
operating_environment: OPERATING_ENVIRONMENT
ANY
invariant
DISPENSER
readable_definition: readable = not is_empty
writable_definition: writable = not is_empty
ACTIVE
writable_constraint: writable implies readable
empty_constraint: is_empty implies (not readable) and (not writable)
ANY
reflexive_equality: standard_is_equal (Current)
reflexive_conformance: conforms_to (Current)
FINITE
empty_definition: is_empty = (count = 0)
non_negative_count: count >= 0
TWO_WAY_LIST
non_empty_list_has_two_endpoints: not is_empty implies (first_element /= Void and last_element /= Void)
first_element_constraint: first_element /= Void implies first_element.left = Void
last_element_constraint: last_element /= Void implies last_element.right = Void
LINKED_LIST
prunable: prunable
empty_constraint: is_empty implies ((first_element = Void) and (active = Void))
not_void_unless_empty: (active = Void) implies is_empty
before_constraint: before implies (active = first_element)
after_constraint: after implies (active = last_element)
LIST
before_definition: before = (index = 0)
after_definition: after = (index = count + 1)
CHAIN
non_negative_index: index >= 0
index_small_enough: index <= count + 1
off_definition: off = ((index = 0) or (index = count + 1))
isfirst_definition: isfirst = ((not is_empty) and (index = 1))
islast_definition: islast = ((not is_empty) and (index = count))
item_corresponds_to_index: (not off) implies (sl_item = i_th (index))
index_set_has_same_count: index_set.count = count
INDEXABLE
index_set_not_void: index_set /= Void
BILINEAR
not_both: not (after and before)
before_constraint: before implies off
LINEAR
after_constraint: after implies off
TRAVERSABLE
empty_constraint: is_empty implies off
DYNAMIC_CHAIN
extendible: extendible
indexing
library: "EiffelBase: Library of reusable components for Eiffel."
copyright: "Copyright (c) 1984-2006, Eiffel Software and others"
license: "Eiffel Forum License v2 (see http://www.eiffel.com/licensing/forum.txt)"
source: "[
Eiffel Software
356 Storke Road, Goleta, CA 93117 USA
Telephone 805-685-1006, Fax 805-685-6869
Website http://www.eiffel.com
Customer support http://support.eiffel.com
]"
end LINKED_PRIORITY_QUEUE