[c333ed2] | 1 | #include "enum.hfa" |
---|
[85855b0] | 2 | #include "fstream.hfa" |
---|
[6d2b3dc] | 3 | #include <string.h> |
---|
[c333ed2] | 4 | |
---|
[03ac869] | 5 | #pragma GCC visibility push(default) |
---|
| 6 | |
---|
[0c327ce] | 7 | forall( E | Serial( E ) ) { |
---|
[0097d08] | 8 | E fromInt( unsigned i ) { |
---|
| 9 | E upper = upperBound(); |
---|
| 10 | E lower = lowerBound(); |
---|
| 11 | // It is okay to overflow as overflow will be theoretically caught by the other bound |
---|
[2e6b2a0] | 12 | if ( i < fromInstance( lower ) || i > fromInstance( upper ) ) |
---|
| 13 | abort( "call to fromInt has index %d outside enumeration range %d-%d", |
---|
| 14 | i, fromInstance( lower ), fromInstance( upper ) ); |
---|
[0097d08] | 15 | return fromInt_unsafe( i ); |
---|
| 16 | } |
---|
[0c327ce] | 17 | |
---|
[0097d08] | 18 | E succ( E e ) { |
---|
| 19 | E upper = upperBound(); |
---|
[2e6b2a0] | 20 | if ( fromInstance( e ) >= fromInstance( upper ) ) |
---|
| 21 | abort( "call to succ() exceeds enumeration upper bound of %d", fromInstance( upper ) ); |
---|
[0097d08] | 22 | return succ_unsafe(e); |
---|
| 23 | } |
---|
[0c327ce] | 24 | |
---|
[0097d08] | 25 | E pred( E e ) { |
---|
| 26 | E lower = lowerBound(); |
---|
[2e6b2a0] | 27 | if ( fromInstance(e) <= fromInstance(lower ) ) |
---|
| 28 | abort( "call to pred() exceeds enumeration lower bound of %d", fromInstance( lower ) ); |
---|
[0097d08] | 29 | return pred_unsafe(e); |
---|
| 30 | } |
---|
[0c327ce] | 31 | |
---|
[0097d08] | 32 | int Countof( __attribute__((unused)) E e ) { |
---|
| 33 | E upper = upperBound(); |
---|
| 34 | E lower = lowerBound(); |
---|
[0c327ce] | 35 | return fromInstance( upper ) + fromInstance( lower ) + 1; |
---|
[0097d08] | 36 | } |
---|
[0c327ce] | 37 | } |
---|
| 38 | |
---|
[0097d08] | 39 | forall( istype & | istream( istype ), E | CfaEnum( E ) | Serial( E ) ) |
---|
[64eeb06] | 40 | istype & ?|?( istype & is, E & e ) { |
---|
[2e6b2a0] | 41 | // fprintf( stderr, "here0\n" ); |
---|
[64eeb06] | 42 | if ( eof( is ) ) throwResume ExceptionInst( missing_data ); |
---|
[d287f3e] | 43 | |
---|
[d796be70] | 44 | // Match longest input enumerator string to enumerator labels, where enumerator names are unique. |
---|
| 45 | |
---|
[0097d08] | 46 | int N = countof( E ), lnths[N], max = 0; |
---|
[2e6b2a0] | 47 | // printf( "N %d\n", N ); |
---|
[0097d08] | 48 | int r = 0; |
---|
| 49 | // for ( s; E : r; 0~@ ) { |
---|
| 50 | for ( s; E ) { // scan string rows gathering lengths |
---|
| 51 | lnths[r] = strlen( label( s ) ); |
---|
| 52 | if ( lnths[r] > max ) max = lnths[r]; |
---|
| 53 | // fprintf( stderr, "%s %d %d\n", label( s ), lnths[r], max ); |
---|
| 54 | r += 1; |
---|
[6d2b3dc] | 55 | } // for |
---|
[d287f3e] | 56 | |
---|
[0097d08] | 57 | int mcol = -1; // last match column |
---|
[2e6b2a0] | 58 | char ch, curr = '\0', prev = '\0'; |
---|
| 59 | |
---|
| 60 | fmt( is, " " ); // skip optional whitespace |
---|
[0097d08] | 61 | for ( c; max ) { // scan columns of the label matix (some columns missing) |
---|
[2e6b2a0] | 62 | int args = fmt( is, "%c", &ch ); // read character |
---|
[d796be70] | 63 | if ( eof( is ) ) { |
---|
[2e6b2a0] | 64 | // fprintf( stderr, "Eof1\n" ); |
---|
| 65 | if ( c == 0 ) return is; // no characters read ? |
---|
[d796be70] | 66 | clear( is ); // => read something => reset EOF => detect again on next read |
---|
[2e6b2a0] | 67 | // fprintf( stderr, "Eof2\n" ); |
---|
[d796be70] | 68 | break; |
---|
| 69 | } // if |
---|
[0097d08] | 70 | if ( args != 1 ) throwResume ExceptionInst( missing_data ); // may be unnecessary since reading single character |
---|
[d796be70] | 71 | |
---|
[2e6b2a0] | 72 | // printf( "read '%c'\n", ch ); |
---|
[0097d08] | 73 | for ( r; N ) { // scan enumeration strings for matching character in current column |
---|
| 74 | // printf( "%d %d %d\n", c, r, lnths[r] ); |
---|
| 75 | if ( c < lnths[r] ) { // string long enough for this column check ? |
---|
| 76 | char match = label( fromInt( r ) )[c]; // optimization |
---|
[2e6b2a0] | 77 | // printf( "%c '%c'\n", match, ch ); |
---|
[d796be70] | 78 | // Stop on first match, could be other matches. |
---|
[0097d08] | 79 | if ( (match == ch) && (c == 0 || curr == label( fromInt( r ) )[c - 1]) ) { |
---|
| 80 | // printf( "match %d %d %d '%c' '%c' '%c' '%c' 'c'\n", c, r, lnths[r], match, ch, prev, label( fromInt( r ) )[c - 1] ); |
---|
| 81 | mcol = c; // matching column |
---|
| 82 | prev = curr; // last matching character |
---|
| 83 | curr = ch; // current matching character |
---|
[2e6b2a0] | 84 | break; |
---|
| 85 | } // if |
---|
| 86 | } // if |
---|
| 87 | } else { |
---|
[0097d08] | 88 | // fprintf( stderr, "finished mcol: %d ch: '%c' curr: '%c' prev: '%c'\n", mcol, ch, curr, prev ); |
---|
| 89 | ungetc( ch, is ); // push back last unmatching character |
---|
| 90 | if ( mcol == -1 ) throwResume ExceptionInst( missing_data ); // no matching character in first column |
---|
| 91 | break; |
---|
[2e6b2a0] | 92 | } // for |
---|
| 93 | // printf( "\n" ); |
---|
| 94 | // } else { |
---|
[0097d08] | 95 | // fprintf( stderr, "finished2 %d\n", mcol ); |
---|
[2e6b2a0] | 96 | } // for |
---|
[0097d08] | 97 | |
---|
| 98 | for ( c; N ) { // scan enumeration strings of length "mcol" for match |
---|
| 99 | if ( mcol == lnths[c] - 1 ) { |
---|
| 100 | char match = label( fromInt( c ) )[mcol]; // optimization |
---|
| 101 | // printf( "finished1 mcol: %d c: %d lnth: %d match: '%c' curr: '%c' prev: '%c'\n", mcol, c, lnths[c], match, curr, prev ); |
---|
| 102 | if ( (match == curr) && (mcol == 0 || prev == label( fromInt( c ) )[mcol - 1]) ) { |
---|
| 103 | e = fromInt( c ); |
---|
[2e6b2a0] | 104 | break; |
---|
[d796be70] | 105 | } // if |
---|
[2e6b2a0] | 106 | } // if |
---|
| 107 | } else { |
---|
[0097d08] | 108 | // fprintf( stderr, "finished3 %d\n", mcol ); |
---|
| 109 | throwResume ExceptionInst( missing_data ); // no match in this column |
---|
[2e6b2a0] | 110 | } // for |
---|
[64eeb06] | 111 | return is; |
---|
| 112 | } |
---|
| 113 | |
---|
[236f133] | 114 | forall( ostype & | ostream( ostype ), E | CfaEnum( E ) ) { |
---|
[64eeb06] | 115 | ostype & ?|?( ostype & os, E e ) { |
---|
| 116 | return os | label( e ); |
---|
| 117 | } |
---|
| 118 | OSTYPE_VOID_IMPL( E ) |
---|
[259012e] | 119 | } |
---|