1 | #include "enum.hfa" |
---|
2 | #include "fstream.hfa" |
---|
3 | #include <string.h> |
---|
4 | |
---|
5 | #pragma GCC visibility push(default) |
---|
6 | |
---|
7 | forall( E | Serial( E ) ) { |
---|
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 |
---|
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 ) ); |
---|
15 | return fromInt_unsafe( i ); |
---|
16 | } |
---|
17 | |
---|
18 | E succ( E e ) { |
---|
19 | E upper = upperBound(); |
---|
20 | if ( fromInstance( e ) >= fromInstance( upper ) ) |
---|
21 | abort( "call to succ() exceeds enumeration upper bound of %d", fromInstance( upper ) ); |
---|
22 | return succ_unsafe(e); |
---|
23 | } |
---|
24 | |
---|
25 | E pred( E e ) { |
---|
26 | E lower = lowerBound(); |
---|
27 | if ( fromInstance(e) <= fromInstance(lower ) ) |
---|
28 | abort( "call to pred() exceeds enumeration lower bound of %d", fromInstance( lower ) ); |
---|
29 | return pred_unsafe(e); |
---|
30 | } |
---|
31 | |
---|
32 | int Countof( __attribute__((unused)) E e ) { |
---|
33 | E upper = upperBound(); |
---|
34 | E lower = lowerBound(); |
---|
35 | return fromInstance( upper ) + fromInstance( lower ) + 1; |
---|
36 | } |
---|
37 | } |
---|
38 | |
---|
39 | forall( istype & | istream( istype ), E | CfaEnum( E )| Serial(E) ) |
---|
40 | istype & ?|?( istype & is, E & e ) { |
---|
41 | // fprintf( stderr, "here0\n" ); |
---|
42 | if ( eof( is ) ) throwResume ExceptionInst( missing_data ); |
---|
43 | |
---|
44 | // Match longest input enumerator string to enumerator labels, where enumerator names are unique. |
---|
45 | |
---|
46 | int N = Countof( e ), lnths[N], max = 0; |
---|
47 | // printf( "N %d\n", N ); |
---|
48 | // for ( s; E : i; 0~@ ) { |
---|
49 | int i = 0; |
---|
50 | for ( s; E ) { |
---|
51 | lnths[i] = strlen( label( s ) ); |
---|
52 | if ( lnths[i] > max ) max = lnths[i]; |
---|
53 | // fprintf( stderr, "%s %d %d\n", label( s ), lnths[i], max ); |
---|
54 | i += 1; |
---|
55 | } // for |
---|
56 | |
---|
57 | int win = -1; |
---|
58 | char ch, curr = '\0', prev = '\0'; |
---|
59 | |
---|
60 | fmt( is, " " ); // skip optional whitespace |
---|
61 | for ( c; max ) { |
---|
62 | int args = fmt( is, "%c", &ch ); // read character |
---|
63 | if ( eof( is ) ) { |
---|
64 | // fprintf( stderr, "Eof1\n" ); |
---|
65 | if ( c == 0 ) return is; // no characters read ? |
---|
66 | clear( is ); // => read something => reset EOF => detect again on next read |
---|
67 | // fprintf( stderr, "Eof2\n" ); |
---|
68 | break; |
---|
69 | } // if |
---|
70 | if ( args != 1 ) throwResume ExceptionInst( missing_data ); |
---|
71 | |
---|
72 | // printf( "read '%c'\n", ch ); |
---|
73 | for ( i; N ) { // scan enumeration strings for winner |
---|
74 | // printf( "%d %d %d\n", c, i, lnths[i] ); |
---|
75 | if ( c < lnths[i] ) { // eligible for this checking round ? |
---|
76 | char match = label( fromInt( i ) )[c]; // optimization |
---|
77 | // printf( "%c '%c'\n", match, ch ); |
---|
78 | // Stop on first match, could be other matches. |
---|
79 | if ( (match == ch) && (c == 0 || curr == label( fromInt( i ) )[c - 1]) ) { |
---|
80 | // printf( "match %d %d %d '%c' '%c' '%c' '%c' 'c'\n", c, i, lnths[i], match, ch, prev, label( fromInt( i ) )[c - 1] ); |
---|
81 | win = c; |
---|
82 | prev = curr; |
---|
83 | curr = ch; |
---|
84 | break; |
---|
85 | } // if |
---|
86 | } // if |
---|
87 | } else { |
---|
88 | // fprintf( stderr, "finished win: %d ch: '%c' curr: '%c' prev: '%c'\n", win, ch, curr, prev ); |
---|
89 | ungetc( ch, is ); |
---|
90 | if ( win == -1 ) throwResume ExceptionInst( missing_data ); |
---|
91 | goto W; // break does not work |
---|
92 | } // for |
---|
93 | // printf( "\n" ); |
---|
94 | // } else { |
---|
95 | // fprintf( stderr, "finished2 %d\n", win ); |
---|
96 | } // for |
---|
97 | W: ; |
---|
98 | for ( i; N ) { // scan enumeration strings for winner |
---|
99 | if ( win == lnths[i] - 1 ) { |
---|
100 | char match = label( fromInt( i ) )[win]; // optimization |
---|
101 | // printf( "finished1 win: %d i: %d lnth: %d match: '%c' curr: '%c' prev: '%c'\n", win, i, lnths[i], match, curr, prev ); |
---|
102 | if ( (match == curr) && (win == 0 || prev == label( fromInt( i ) )[win - 1]) ) { |
---|
103 | e = fromInt( i ); |
---|
104 | break; |
---|
105 | } // if |
---|
106 | } // if |
---|
107 | } else { |
---|
108 | // fprintf( stderr, "finished3 %d\n", win ); |
---|
109 | throwResume ExceptionInst( missing_data ); |
---|
110 | } // for |
---|
111 | return is; |
---|
112 | } |
---|
113 | |
---|
114 | forall( ostype & | ostream( ostype ), E | CfaEnum( E ) ) { |
---|
115 | ostype & ?|?( ostype & os, E e ) { |
---|
116 | return os | label( e ); |
---|
117 | } |
---|
118 | OSTYPE_VOID_IMPL( E ) |
---|
119 | } |
---|