Changes in libcfa/src/bits/queue.hfa [636d3715:5e82d56]

File:

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

libcfa/src/bits/queue.hfa

@@ -15 +15 @@
                 } // post: empty() & head() == 0 | !empty() & head() in *q
 
+                bool empty( Queue(T) & q ) with( q ) {                  // 0 <=> *q contains no elements
+                        return empty( (Collection &)q );
+                }
+
+                bool listed( T * n ) {
+                        return Next( (Colable *)n ) != 0;
+                }
+
+                T *& Next( T * n ) {
+                        return (T *)Next( (Colable *)n );
+                }
+
+                T * Root( Queue(T) & q ) with( q ) {
+                        return (T *)root;
+                }
+
                 void ?{}( Queue(T) &, const Queue(T) & ) = void; // no copy
                 Queue(T) & ?=?( const Queue(T) & ) = void;              // no assignment
@@ -39 +55 @@
 #endif // __CFA_DEBUG__
                         if ( last ) {
-                                Next( n ) = head( q );
+                                Next( n ) = Root( q );
                                 q.root = n;
                         } else {
@@ -65 +81 @@
                         if ( root ) {
                                 root = Next( root );
-                                if ( head( q ) == t ) {
+                                if ( Root( q ) == t ) {
                                         root = last = 0p;                                       // only one element
                                 }
@@ -116 +132 @@
                                 root = from.root;
                         } else {                                                                        // "to" list not empty
-                                Next( last ) = head( from );
+                                Next( last ) = Root( from );
                         }
                         last = from.last;
@@ -132 +148 @@
                         to.last = n;                                                            // end of "to" list
                         from.root = Next( n );                                          // start of "from" list
-                        if ( n == head( from ) ) {                                      // last node in list ?
+                        if ( n == Root( from ) ) {                                      // last node in list ?
                                 from.root = from.last = 0p;                             // mark "from" list empty
                         } else {
@@ -148 +164 @@
 
         inline {
+                // wrappers to make ColIter have T
+                T * Curr( QueueIter(T) & qi ) with( qi ) {
+                        return (T *)curr;
+                }
+
                 void ?{}( QueueIter(T) & qi ) with( qi ) {
                         ((ColIter &)qi){};
@@ -166 +187 @@
                 } // 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 );
+                                tp = Curr( qi );
                                 T * n = Next( Curr( qi ) );
                                 curr = (n == Curr( qi ) ) ? 0p : n;
-                        } else &tp = 0p;
-                        return &tp != 0p;
+                        } else tp = 0p;
+                        return tp != 0p;
                 }
                 // post: elts == null & !operator>>(tp) | elts != null & *tp' in elts & elts' == elts - *tp & operator>>(tp)