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

File:

• libcfa/src/bits/queue.hfa (modified) (5 diffs)

libcfa/src/bits/queue.hfa

@@ -2 +2 @@
 
 #include "bits/collection.hfa"
+
+// A Queue(T) is a Collection(T) defining the ordering that nodes are returned by drop() in the same 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 * ); } ) {
@@ -108 +114 @@
                 } // post: ! listed( n )
 
-                T & dropTail( Queue(T) & q ) with( q ) { // O(n)
+                T & dropTail( Queue(T) & q ) with( q ) {                // O(n)
                         T & n = tail( q );
                         return &n ? remove( q, n ), n : *0p;
@@ -155 +161 @@
                 } // post: curr == 0p
 
-                // create an iterator active in Queue q
+                // create an iterator active in queue q
                 void ?{}( QueueIter(T) & qi, Queue(T) & q ) with( qi ) {
                         curr = &head( q );
@@ -164 +170 @@
                 } // post: curr = {e in q}
 
-                // make existing iterator active in Queue q
+                // make existing iterator active in queue q
                 void over( QueueIter(T) & qi, Queue(T) & q ) with( qi ) {
                         curr = &head( q );
                 } // post: curr = {e in q}
 
-                bool ?>>?( QueueIter(T) & qi, T && tp ) with( qi ) {
+                bool ?|?( QueueIter(T) & qi, T && tp ) with( qi ) {
                         if ( curr ) {
                                 &tp = Curr( qi );
@@ -177 +183 @@
                         return &tp != 0p;
                 }
-                // post: elts == null & !operator>>(tp) | elts != null & *tp' in elts & elts' == elts - *tp & operator>>(tp)
+                // post: elts == null & !operator|(tp) | elts != null & *tp' in elts & elts' == elts - *tp & operator|(tp)
         } // distribution
 } // distribution