Changes in libcfa/src/bits/stack.hfa [a3a76ea:9536761]

File:

• libcfa/src/bits/stack.hfa (modified) (4 diffs)

libcfa/src/bits/stack.hfa

@@ -2 +2 @@
 
 #include "bits/collection.hfa"
+
+// A Stack(T) is a Collection(T) defining the ordering that nodes are returned by drop() in the reverse order from those
+// added by add(). T must be a public descendant of uColable.
+
+// The implementation is a typical singly-linked list, except the next field of the last element points to itself
+// instead of being null.
 
 forall( dtype T | { T *& Next ( T * ); } ) {
@@ -58 +64 @@
 } // distribution
 
+// A StackIter(T) is a subclass of ColIter(T) that generates the elements of a Stack(T).  It returns the elements in the
+// order returned by drop().
 
 forall( dtype T | { T *& Next ( T * ); } ) {
@@ -69 +77 @@
                 } // post: curr == 0p
 
-                // create an iterator active in Stack s
+                // create an iterator active in stack s
                 void ?{}( StackIter(T) & si, Stack(T) & s ) with( si ) {
                         curr = &head( s );
@@ -78 +86 @@
                 } // post: curr = {e in s}
 
-                // make existing iterator active in Stack q
+                // make existing iterator active in stack s
                 void over( StackIter(T) & si, Stack(T) & s ) with( si ) {
                         curr = &head( s );
                 } // post: curr = {e in s}
 
-                bool ?>>?( StackIter(T) & si, T && tp ) with( si ) {
+                bool ?|?( StackIter(T) & si, T && tp ) with( si ) {
                         if ( curr ) {
                                 &tp = Curr( si );