Changes in libcfa/src/bits/queue.hfa [a3a76ea:19de7864]
- File:
-
- 1 edited
-
libcfa/src/bits/queue.hfa (modified) (5 diffs)
Legend:
- Unmodified
- Added
- Removed
-
libcfa/src/bits/queue.hfa
ra3a76ea r19de7864 34 34 } // post: n == tail() & succ(n) == 0 | n != tail() & *succ(n) in *q 35 35 36 T &addHead( Queue(T) & q, T & n ) with( q ) {36 void addHead( Queue(T) & q, T & n ) with( q ) { 37 37 #ifdef __CFA_DEBUG__ 38 38 if ( listed( &n ) ) abort( "(Queue &)%p.addHead( %p ) : Node is already on another list.", &q, &n ); … … 45 45 Next( &n ) = &n; // last node points to itself 46 46 } 47 return n;48 47 } 49 48 50 T &addTail( Queue(T) & q, T & n ) with( q ) {49 void addTail( Queue(T) & q, T & n ) with( q ) { 51 50 #ifdef __CFA_DEBUG__ 52 51 if ( listed( &n ) ) abort( "(Queue &)%p.addTail( %p ) : Node is already on another list.", &q, &n ); … … 56 55 last = &n; 57 56 Next( &n ) = &n; // last node points to itself 58 return n;59 57 } 60 58 61 T &add( Queue(T) & q, T & n ) with( q ) {62 returnaddTail( q, n );59 void add( Queue(T) & q, T & n ) with( q ) { 60 addTail( q, n ); 63 61 } 64 62 … … 79 77 } 80 78 81 T &remove( Queue(T) & q, T & n ) with( q ) { // O(n)79 void remove( Queue(T) & q, T & n ) with( q ) { // O(n) 82 80 #ifdef __CFA_DEBUG__ 83 81 if ( ! listed( (Colable &)n ) ) abort( "(Queue &)%p.remove( %p ) : Node is not on a list.", &q, &n ); … … 105 103 curr = Next( curr ); 106 104 } 107 return n;108 105 } // post: ! listed( n ) 109 106
Note:
See TracChangeset
for help on using the changeset viewer.
