[de2f969] | 1 | #include <fstream.hfa> |
---|
| 2 | #include <stdlib.hfa> // new, delete |
---|
| 3 | #include <bits/stack.hfa> |
---|
| 4 | |
---|
[a7d696f] | 5 | struct Fred { |
---|
| 6 | inline Colable; // Plan 9 inheritance |
---|
| 7 | int i; |
---|
| 8 | }; |
---|
| 9 | |
---|
| 10 | Stack(Fred) fred; |
---|
| 11 | |
---|
[de2f969] | 12 | int main() { |
---|
| 13 | // Fred test |
---|
| 14 | |
---|
[a7d696f] | 15 | |
---|
[de2f969] | 16 | void ?{}( Fred & fred ) { abort(); } |
---|
| 17 | void ?{}( Fred & fred, int p ) with( fred ) { |
---|
| 18 | i = p; |
---|
| 19 | } |
---|
| 20 | Fred *& Next( Fred * n ) { |
---|
| 21 | return (Fred *)Next( (Colable *)n ); |
---|
| 22 | } |
---|
| 23 | |
---|
[a7d696f] | 24 | |
---|
[657c36f] | 25 | StackIter(Fred) inter = { fred }; |
---|
[de2f969] | 26 | Fred & f; |
---|
| 27 | |
---|
| 28 | sout | nlOff; // turn off auto newline |
---|
| 29 | |
---|
[657c36f] | 30 | for ( ; inter | f; ) { // empty list |
---|
[de2f969] | 31 | sout | f.i | ' '; |
---|
| 32 | } |
---|
| 33 | sout | "empty" | nl; |
---|
| 34 | |
---|
| 35 | for ( i; 10 ) { |
---|
| 36 | push( fred, *new( 2 * i ) ); |
---|
| 37 | } |
---|
| 38 | |
---|
[657c36f] | 39 | for ( StackIter(Fred) iter = { fred }; iter | f; ) { |
---|
[de2f969] | 40 | sout | f.i | ' '; |
---|
| 41 | } |
---|
| 42 | sout | nl; |
---|
| 43 | |
---|
[62a7cc0] | 44 | sout | head( fred ).i | nl; |
---|
[de2f969] | 45 | |
---|
| 46 | for ( i; 9 ) { |
---|
| 47 | delete( &pop( fred ) ); |
---|
| 48 | } |
---|
| 49 | |
---|
[657c36f] | 50 | for ( over( inter, fred ); inter | f; ) { |
---|
[de2f969] | 51 | sout | f.i | ' '; |
---|
| 52 | } |
---|
| 53 | sout | nl; |
---|
| 54 | |
---|
| 55 | for ( i; 10 ) { |
---|
| 56 | push( fred, *new( 2 * i + 1 ) ); |
---|
| 57 | } |
---|
[657c36f] | 58 | for ( over( inter, fred ); inter | f; ) { |
---|
[de2f969] | 59 | sout | f.i | ' '; |
---|
| 60 | } |
---|
| 61 | sout | nl; |
---|
| 62 | |
---|
[657c36f] | 63 | for ( over( inter, fred ); inter | f; ) { |
---|
[de2f969] | 64 | delete( &f ); |
---|
| 65 | } |
---|
| 66 | |
---|
| 67 | // Mary test |
---|
| 68 | |
---|
| 69 | struct Mary { |
---|
| 70 | inline Fred; // Plan 9 inheritance |
---|
| 71 | int j; |
---|
| 72 | }; |
---|
| 73 | void ?{}( Mary & mary ) { abort(); } |
---|
| 74 | void ?{}( Mary & mary, int p ) with( mary ) { |
---|
| 75 | ((Fred &)mary){ p }; |
---|
[62a7cc0] | 76 | j = p; |
---|
[de2f969] | 77 | } |
---|
| 78 | |
---|
| 79 | Mary *& Next( Mary * n ) { |
---|
| 80 | return (Mary *)Next( (Fred *)n ); |
---|
| 81 | } |
---|
| 82 | |
---|
| 83 | Stack(Mary) mary; |
---|
| 84 | StackIter(Mary) maryIter = { mary }; |
---|
| 85 | Mary & m; |
---|
| 86 | |
---|
[657c36f] | 87 | for ( ; maryIter | m; ) { // empty list |
---|
[de2f969] | 88 | sout | m.i | m.j | ' '; |
---|
| 89 | } |
---|
| 90 | sout | "empty" | nl; |
---|
| 91 | |
---|
| 92 | for ( i; 10 ) { |
---|
| 93 | push( mary, *new( 2 * i ) ); |
---|
| 94 | } |
---|
| 95 | |
---|
[657c36f] | 96 | for ( StackIter(Mary) iter = { mary }; iter | m; ) { |
---|
[de2f969] | 97 | sout | m.i | m.j | ' '; |
---|
| 98 | } |
---|
| 99 | sout | nl; |
---|
| 100 | |
---|
| 101 | for ( i; 9 ) { |
---|
| 102 | delete( &pop( mary ) ); |
---|
| 103 | } |
---|
| 104 | |
---|
[657c36f] | 105 | for ( over( maryIter, mary ); maryIter | m; ) { |
---|
[de2f969] | 106 | sout | m.i | m.j | ' '; |
---|
| 107 | } |
---|
| 108 | sout | nl; |
---|
| 109 | |
---|
| 110 | for ( i; 10 ) { |
---|
| 111 | push( mary, *new( 2 * i + 1 ) ); |
---|
| 112 | } |
---|
[657c36f] | 113 | for ( over( maryIter, mary ); maryIter | m; ) { |
---|
[de2f969] | 114 | sout | m.i | m.j | ' '; |
---|
| 115 | } |
---|
| 116 | sout | nl; |
---|
| 117 | |
---|
[657c36f] | 118 | for ( over( maryIter, mary ); maryIter | m; ) { |
---|
[de2f969] | 119 | delete( &m ); |
---|
| 120 | } |
---|
| 121 | } |
---|