Changeset a3a76ea for libcfa/src/bits/stack.hfa

Timestamp:

Dec 27, 2020, 5:55:50 PM (3 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:

62a7cc0

Parents:

83c7e3c

Message:

modify routines to return added/removed node to allow cascading calls

File:

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

libcfa/src/bits/stack.hfa

@@ -25 +25 @@
                 }
 
-                void addHead( Stack(T) & s, T & n ) with( s ) {
+                T & addHead( Stack(T) & s, T & n ) with( s ) {
                         #ifdef __CFA_DEBUG__
                         if ( listed( (Colable &)(n) ) ) abort( "(Stack &)%p.addHead( %p ) : Node is already on another list.", &s, n );
@@ -31 +31 @@
                         Next( &n ) = &head( s ) ? &head( s ) : &n;
                         root = &n;
+                        return n;
                 }
 
-                void add( Stack(T) & s, T & n ) with( s ) {
-                        addHead( s, n );
+                T & add( Stack(T) & s, T & n ) with( s ) {
+                        return addHead( s, n );
                 }
 
-                void push( Stack(T) & s, T & n ) with( s ) {
-                        addHead( s, n );
+                T & push( Stack(T) & s, T & n ) with( s ) {
+                        return addHead( s, n );
                 }