Changeset 58870e6b for libcfa/src/bits/queue.hfa

Timestamp:

Dec 7, 2020, 3:51:50 PM (4 years ago)

Author:

Peter A. Buhr <pabuhr@…>

Branches:

ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, master, new-ast-unique-expr, pthread-emulation, qualifiedEnum

Children:

d6089ad

Parents:

e91a255

Message:

switch from reference back to pointer

File:

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

libcfa/src/bits/queue.hfa

@@ -31 +31 @@
                         if ( ! listed( n ) ) abort( "(Queue &)%p.succ( %p ) : Node is not on a list.", &q, n );
                         #endif // __CFA_DEBUG__
-                        return (Next( *n ) == n) ? 0p : Next( *n );
+                        return (Next( n ) == n) ? 0p : Next( n );
                 } // post: n == tail() & succ(n) == 0 | n != tail() & *succ(n) in *q
 
@@ -39 +39 @@
                         #endif // __CFA_DEBUG__
                         if ( last ) {
-                                Next( n ) = &head( q );
+                                Next( &n ) = &head( q );
                                 q.root = &n;
                         } else {
                                 root = last = &n;
-                                Next( n ) = &n;                                                 // last node points to itself
+                                Next( &n ) = &n;                                                // last node points to itself
                         }
                 }
@@ -51 +51 @@
                         if ( listed( &n ) ) abort( "(Queue &)%p.addTail( %p ) : Node is already on another list.", &q, &n );
                         #endif // __CFA_DEBUG__
-                        if ( last ) Next( *last ) = &n;
+                        if ( last ) Next( last ) = &n;
                         else root = &n;
                         last = &n;
-                        Next( n ) = &n;                                                         // last node points to itself
+                        Next( &n ) = &n;                                                        // last node points to itself
                 }
 
@@ -64 +64 @@
                         T & t = head( q );
                         if ( root ) {
-                                root = Next( *root );
+                                root = Next( root );
                                 if ( &head( q ) == &t ) {
                                         root = last = 0p;                                       // only one element
                                 }
-                                Next( t ) = 0p;
+                                Next( &t ) = 0p;
                         }
                         return t;
@@ -81 +81 @@
                         if ( ! listed( (Colable &)n ) ) abort( "(Queue &)%p.remove( %p ) : Node is not on a list.", &q, &n );
                         #endif // __CFA_DEBUG__
-                        T & prev = *0p;
-                        T & curr = *(T *)root;
+                        T * prev = 0p;
+                        T * curr = (T *)root;
                         for ( ;; ) {
-                                if ( &n == &curr ) {                                            // found => remove
+                                if ( &n == curr ) {                                             // found => remove
                                         if ( (T *)root == &n ) {
                                                 dropHead( q );
                                         } else if ( last == &n ) {
-                                                last = &prev;
-                                                Next( *last ) = last;
+                                                last = prev;
+                                                Next( last ) = last;
                                         } else {
                                                 Next( prev ) = Next( curr );
                                         }
-                                        Next( n ) = 0p;
+                                        Next( &n ) = 0p;
                                         break;
                                 }
                                 // not found => error
                                 #ifdef __CFA_DEBUG__
-                                if ( &curr == last ) abort( "(Queue &)%p.remove( %p ) : Node is not in list.", &q, &n );
+                                if ( curr == last ) abort( "(Queue &)%p.remove( %p ) : Node is not in list.", &q, &n );
                                 #endif // __CFA_DEBUG__
-                                &prev = &curr;
-                                &curr = Next( curr );
+                                prev = curr;
+                                curr = Next( curr );
                         }
                 } // post: ! listed( n )
@@ -116 +116 @@
                                 root = from.root;
                         } else {                                                                        // "to" list not empty
-                                Next( *last ) = &head( from );
+                                Next( last ) = &head( from );
                         }
                         last = from.last;
@@ -131 +131 @@
                         to.root = from.root;                                            // start of "to" list
                         to.last = &n;                                                           // end of "to" list
-                        from.root = Next( n );                                          // start of "from" list
+                        from.root = Next( &n );                                         // start of "from" list
                         if ( &n == &head( from ) ) {                            // last node in list ?
                                 from.root = from.last = 0p;                             // mark "from" list empty
                         } else {
-                                Next( n ) = &n;                                                 // fix end of "to" list
+                                Next( &n ) = &n;                                                // fix end of "to" list
                         }
                         transfer( q, to );
@@ -169 +169 @@
                         if ( curr ) {
                                 &tp = Curr( qi );
-                                T * n = Next( *Curr( qi ) );
+                                T * n = Next( Curr( qi ) );
                                 curr = (n == Curr( qi ) ) ? 0p : n;
                         } else &tp = 0p;