mirrors/eiffel-org
1
0
Fork 0
mirror of https://github.com/EiffelSoftware/eiffel-org.git synced 2025-12-07 15:22:31 +01:00
Code Issues Packages Projects Releases Wiki Activity

Corrections in the paragraph about Stacks based on user's comments.

Browse Source 
Updated wikipage EiffelBase, Dispensers.
	(Signed-off-by:WilliamsLima).

git-svn-id: https://svn.eiffel.com/eiffel-org/trunk@2080 abb3cda0-5349-4a8f-a601-0c33ac3a8c38
This commit is contained in:
eiffel-org
2018-09-14 22:39:40 +00:00
parent 33c3a941f5
commit c4694a0ea0
1 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
documentation/18.07/solutions/basic-computing/eiffelbase/eiffelbase-tutorial/eiffelbase-data-structures-overview/eiffelbase-dispensers.wiki
View File

@@ -1,3 +1,5 @@
[[Property:modification_date|Fri, 14 Sep 2018 22:39:40 GMT]]
[[Property:publication_date|Fri, 14 Sep 2018 22:39:40 GMT]]
[[Property:title|EiffelBase, Dispensers]]
[[Property:weight|2]]
[[Property:uuid|4f65d62b-940b-c3c2-557e-d709a2a1bcaf]]
@@ -10,7 +12,7 @@ The deferred class [[ref:libraries/base/reference/dispenser_chart|DISPENSER]] p
==Stacks==
Stacks - dispensers with a LIFO retrieval policy - are a ubiquitous structure in software development. Their most famous application is to parsing (syntactic analysis), but many other types of systems use one or more stacks. Class STACK describes general stacks, without commitment to a representation. This is a deferred class which may not be directly instantiated. The fundamental operations are put (add an element at end of queue), item (retrieve the oldest element, non-destructively), remove (remove the oldest element), is_empty (test for empty queue). <br/>
Stacks - dispensers with a LIFO retrieval policy - are a ubiquitous structure in software development. Their most famous application is to parsing (syntactic analysis), but many other types of systems use one or more stacks. Class STACK describes general stacks, without commitment to a representation. This is a deferred class which may not be directly instantiated. The fundamental operations are put (add an element to the top of the stack), item (retrieve the element from the top, non-destructively), remove (remove the element from the top), is_empty (test for an empty stack). <br/>
Three effective heirs are provided:
* [[ref:libraries/base/reference/linked_stack_chart|LINKED_STACK]] : stacks implemented as linked lists, with no limit on the number of items (<eiffel>count</eiffel>).
* [[ref:libraries/base/reference/bounded_stack_chart|BOUNDED_STACK]] : stacks implemented as arrays. For such stacks, the maximum number of items (<eiffel>capacity</eiffel>) is set at creation time.