indexing
description: "Stacks with a bounded physical size, implemented by arrays"
legal: "See notice at end of class."
status: "See notice at end of class."
names: dispenser, array
representation: array
access: fixed, lifo, membership
size: fixed
contents: generic
date: "$Date: 2006-01-22 18:25:44 -0800 (Sun, 22 Jan 2006) $"
revision: "$Revision: 56675 $"
class interface
BOUNDED_STACK [G]
create
make (n: INTEGER_32)
`n'
require
non_negative_argument: n >= 0
ensure
stack_allocated: capacity = n
empty_stack: count = 0
feature
make (n: INTEGER_32)
`n'
require
non_negative_argument: n >= 0
ensure
stack_allocated: capacity = n
empty_stack: count = 0
feature
generating_type: STRING_8
ANY
generator: STRING_8
ANY
has (v: G): BOOLEAN
`v'
object_comparison
ensure CONTAINER
not_found_in_empty: Result implies not is_empty
item: G
require ACTIVE
readable: readable
require else
not_empty: count > 0
item_for_iteration: G
require
not_off: not off
feature
capacity: INTEGER_32
count: INTEGER_32
occurrences (v: G): INTEGER_32
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'
ANY
require ANY
other_not_void: other /= Void
ensure ANY
symmetric: Result implies other.is_equal (Current)
consistent: standard_is_equal (other) implies Result
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
require COLLECTION
True
ensure then
Result = not full
full: BOOLEAN
BOUNDED
require BOX
True
is_empty: BOOLEAN
FINITE
is_inserted (v: G): BOOLEAN
`v'
`has (v)'
COLLECTION
object_comparison: BOOLEAN
equal`='
`='
CONTAINER
prunable: BOOLEAN is True
readable: BOOLEAN
DISPENSER
resizable: BOOLEAN is 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
DISPENSER
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'
fill
DISPENSER
extend (v: like item)
`v'
BOUNDED_STACKforceput
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 STACK
item_pushed: item = v
fill (other: LINEAR [G])
`other'
`other'
`other'
`other'
STACK
require COLLECTION
other_not_void: other /= Void
extendible: extendible
force (v: like item)
`v'
BOUNDED_STACKextendput
require DISPENSER
True
ensure then STACK
item_pushed: item = v
put (v: like item)
`v'
BOUNDED_STACKextendforce
require COLLECTION
extendible: extendible
ensure COLLECTION
item_inserted: is_inserted (v)
ensure then STACK
item_pushed: item = v
replace (v: like item)
`v'
require ACTIVE
writable: writable
ensure ACTIVE
item_replaced: item = v
feature
remove
require ACTIVE
prunable: prunable
writable: writable
require else
not_empty: count /= 0
wipe_out
require COLLECTION
prunable: prunable
ensure COLLECTION
wiped_out: is_empty
feature
linear_representation: ARRAYED_LIST [G]
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
finish
forth
off: BOOLEAN
start
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
count_small_enough: count <= capacity
extendible_definition: extendible = not full
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
BOUNDED
valid_count: count <= capacity
full_definition: full = (count = capacity)
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 BOUNDED_STACK