1 /************************************************************************************[ParseUtils.h]
2 Copyright (c) 2003-2006, Niklas Een, Niklas Sorensson
3 Copyright (c) 2007-2010, Niklas Sorensson
5 Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
6 associated documentation files (the "Software"), to deal in the Software without restriction,
7 including without limitation the rights to use, copy, modify, merge, publish, distribute,
8 sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is
9 furnished to do so, subject to the following conditions:
11 The above copyright notice and this permission notice shall be included in all copies or
12 substantial portions of the Software.
14 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT
15 NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
16 NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
17 DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT
18 OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
19 **************************************************************************************************/
21 #ifndef Glucose_ParseUtils_h
22 #define Glucose_ParseUtils_h
32 //-------------------------------------------------------------------------------------------------
33 // A simple buffered character stream class:
35 static const int buffer_size = 1048576;
40 unsigned char buf[buffer_size];
44 void assureLookahead() {
47 size = gzread(in, buf, sizeof(buf)); } }
50 explicit StreamBuffer(gzFile i) : in(i), pos(0), size(0) { assureLookahead(); }
52 int operator * () const { return (pos >= size) ? EOF : buf[pos]; }
53 void operator ++ () { pos++; assureLookahead(); }
54 int position () const { return pos; }
58 //-------------------------------------------------------------------------------------------------
59 // End-of-file detection functions for StreamBuffer and char*:
62 static inline bool isEof(StreamBuffer& in) { return *in == EOF; }
63 static inline bool isEof(const char* in) { return *in == '\0'; }
65 //-------------------------------------------------------------------------------------------------
66 // Generic parse functions parametrized over the input-stream type.
70 static void skipWhitespace(B& in) {
71 while ((*in >= 9 && *in <= 13) || *in == 32)
76 static void skipLine(B& in) {
78 if (isEof(in)) return;
79 if (*in == '\n') { ++in; return; }
83 static double parseDouble(B& in) { // only in the form X.XXXXXe-XX
86 double currentExponent = 1;
90 if(*in == EOF) return 0;
91 if (*in == '-') neg = true, ++in;
92 else if (*in == '+') ++in;
93 if (*in < '1' || *in > '9') printf("PARSE ERROR! Unexpected char: %c\n", *in), exit(3);
94 accu = (double)(*in - '0');
96 if (*in != '.') printf("PARSE ERROR! Unexpected char: %c\n", *in),exit(3);
98 currentExponent = 0.1;
99 while (*in >= '0' && *in <= '9')
100 accu = accu + currentExponent * ((double)(*in - '0')),
101 currentExponent /= 10,
103 if (*in != 'e') printf("PARSE ERROR! Unexpected char: %c\n", *in),exit(3);
105 exponent = parseInt(in); // read exponent
106 accu *= pow(10,exponent);
107 return neg ? -accu:accu;
112 static int parseInt(B& in) {
116 if (*in == '-') neg = true, ++in;
117 else if (*in == '+') ++in;
118 if (*in < '0' || *in > '9') fprintf(stderr, "PARSE ERROR! Unexpected char: %c\n", *in), exit(3);
119 while (*in >= '0' && *in <= '9')
120 val = val*10 + (*in - '0'),
122 return neg ? -val : val; }
125 // String matching: in case of a match the input iterator will be advanced the corresponding
126 // number of characters.
128 static bool match(B& in, const char* str) {
130 for (i = 0; str[i] != '\0'; i++)
139 // String matching: consumes characters eagerly, but does not require random access iterator.
141 static bool eagerMatch(B& in, const char* str) {
142 for (; *str != '\0'; ++str, ++in)
148 //=================================================================================================