| [4597] | 1 | /* | 
|---|
| [3941] | 2 | orxonox - the future of 3D-vertical-scrollers | 
|---|
|  | 3 |  | 
|---|
|  | 4 | Copyright (C) 2004 orx | 
|---|
|  | 5 |  | 
|---|
|  | 6 | This program is free software; you can redistribute it and/or modify | 
|---|
|  | 7 | it under the terms of the GNU General Public License as published by | 
|---|
|  | 8 | the Free Software Foundation; either version 2, or (at your option) | 
|---|
|  | 9 | any later version. | 
|---|
|  | 10 |  | 
|---|
|  | 11 | ### File Specific: | 
|---|
|  | 12 | main-programmer: Christian Meyer | 
|---|
| [4597] | 13 | co-programmer: Benjamin Grauer | 
|---|
|  | 14 |  | 
|---|
|  | 15 | 2005-06-10: some naming conventions | 
|---|
| [7221] | 16 |  | 
|---|
|  | 17 | // | 
|---|
|  | 18 | //  splitLine | 
|---|
|  | 19 | //  STL string tokenizer | 
|---|
|  | 20 | // | 
|---|
|  | 21 | //  Created by Clemens Wacha. | 
|---|
|  | 22 | //  Version 1.0 | 
|---|
|  | 23 | //  Copyright (c) 2005 Clemens Wacha. All rights reserved. | 
|---|
|  | 24 | // | 
|---|
|  | 25 |  | 
|---|
| [4220] | 26 | */ | 
|---|
|  | 27 |  | 
|---|
|  | 28 | #include "substring.h" | 
|---|
|  | 29 |  | 
|---|
|  | 30 | #include <string.h> | 
|---|
| [7221] | 31 | #include <cassert> | 
|---|
| [4220] | 32 |  | 
|---|
| [7323] | 33 |  | 
|---|
| [7319] | 34 | /** | 
|---|
| [7323] | 35 | * @brief default constructor | 
|---|
|  | 36 | */ | 
|---|
|  | 37 | SubString::SubString() | 
|---|
| [7398] | 38 | {} | 
|---|
| [7323] | 39 |  | 
|---|
|  | 40 |  | 
|---|
|  | 41 | /** | 
|---|
| [7319] | 42 | * @brief create a SubString from | 
|---|
|  | 43 | * @param string the String to Spilit | 
|---|
| [7474] | 44 | * @param delimiter the Character at which to split string (delimiter) | 
|---|
| [7319] | 45 | */ | 
|---|
| [7474] | 46 | SubString::SubString(const std::string& string, char delimiter) | 
|---|
| [4220] | 47 | { | 
|---|
| [7474] | 48 | this->split(string, delimiter); | 
|---|
| [7221] | 49 | } | 
|---|
| [4597] | 50 |  | 
|---|
| [7319] | 51 |  | 
|---|
|  | 52 | /** | 
|---|
|  | 53 | * @brief Splits a String into multiple splitters. | 
|---|
|  | 54 | * @param string the String to split | 
|---|
| [7474] | 55 | * @param delimiters multiple set of characters at what to split. (delimiters) | 
|---|
|  | 56 | * @param delimiterNeighbours neighbours of the delimiters, that will be erased only when near a delimiter. | 
|---|
| [7319] | 57 | * @param escapeChar The Escape Character that overrides splitters commends and so on... | 
|---|
|  | 58 | * @param safemode_char within these characters splitting won't happen | 
|---|
|  | 59 | * @param comment_char the Comment character. | 
|---|
|  | 60 | */ | 
|---|
| [7474] | 61 | SubString::SubString(const std::string& string, | 
|---|
|  | 62 | const std::string& delimiters, const std::string& delimiterNeighbours, bool emptyEntries, | 
|---|
|  | 63 | char escapeChar, char safemode_char, char comment_char) | 
|---|
| [7221] | 64 | { | 
|---|
| [7474] | 65 | SubString::splitLine(this->strings, string, delimiters, delimiterNeighbours, emptyEntries, escapeChar, safemode_char, comment_char); | 
|---|
| [7221] | 66 | } | 
|---|
| [4597] | 67 |  | 
|---|
| [7221] | 68 | /** | 
|---|
| [7319] | 69 | * @brief creates a SubSet of a SubString. | 
|---|
|  | 70 | * @param subString the SubString to take a set from. | 
|---|
|  | 71 | * @param subSetBegin the beginning to the end | 
|---|
| [7221] | 72 | */ | 
|---|
| [7319] | 73 | SubString::SubString(const SubString& subString, unsigned int subSetBegin) | 
|---|
|  | 74 | { | 
|---|
|  | 75 | for (unsigned int i = subSetBegin; i < subString.size(); i++) | 
|---|
|  | 76 | this->strings.push_back(subString[i]); | 
|---|
|  | 77 | } | 
|---|
|  | 78 |  | 
|---|
|  | 79 |  | 
|---|
|  | 80 | /** | 
|---|
|  | 81 | * @brief creates a SubSet of a SubString. | 
|---|
|  | 82 | * @param subString the SubString to take a Set from | 
|---|
|  | 83 | * @param subSetBegin the beginning to the end | 
|---|
|  | 84 | * @param subSetEnd the end of the SubSet (max subString.size() will be checked internaly) | 
|---|
|  | 85 | */ | 
|---|
|  | 86 | SubString::SubString(const SubString& subString, unsigned int subSetBegin, unsigned int subSetEnd) | 
|---|
|  | 87 | { | 
|---|
|  | 88 | for (unsigned int i = subSetBegin; i < subString.size() || i < subSetEnd; i++) | 
|---|
|  | 89 | this->strings.push_back(subString[i]); | 
|---|
|  | 90 | } | 
|---|
|  | 91 |  | 
|---|
| [7477] | 92 | /** | 
|---|
|  | 93 | * @brief creates a Substring from a count and values set. | 
|---|
|  | 94 | * @param argc: the Arguments Count. | 
|---|
|  | 95 | * @param argv: Argument Values. | 
|---|
|  | 96 | */ | 
|---|
|  | 97 | SubString::SubString(unsigned int argc, const char** argv) | 
|---|
|  | 98 | { | 
|---|
|  | 99 | for(unsigned int i = 0; i < argc; ++i) | 
|---|
|  | 100 | this->strings.push_back(std::string(argv[i])); | 
|---|
|  | 101 | } | 
|---|
| [7319] | 102 |  | 
|---|
|  | 103 | /** | 
|---|
|  | 104 | * @brief removes the object from memory | 
|---|
|  | 105 | */ | 
|---|
|  | 106 | SubString::~SubString() | 
|---|
|  | 107 | { } | 
|---|
|  | 108 |  | 
|---|
| [7325] | 109 | /** @brief An empty String */ | 
|---|
| [7221] | 110 | const std::string SubString::emptyString = ""; | 
|---|
| [7325] | 111 | /** @brief Helper that gets you a String consisting of all White Spaces */ | 
|---|
|  | 112 | const std::string SubString::WhiteSpaces = " \n\t"; | 
|---|
|  | 113 | /** @brief Helper that gets you a String consisting of all WhiteSpaces and the Comma */ | 
|---|
|  | 114 | const std::string SubString::WhiteSpacesWithComma = " \n\t,"; | 
|---|
| [4597] | 115 |  | 
|---|
| [7319] | 116 | /** | 
|---|
|  | 117 | * @brief stores the Value of subString in this SubString | 
|---|
|  | 118 | * @param subString will be copied into this String. | 
|---|
|  | 119 | * @returns this SubString. | 
|---|
|  | 120 | */ | 
|---|
|  | 121 | SubString& SubString::operator=(const SubString& subString) | 
|---|
|  | 122 | { | 
|---|
|  | 123 | this->strings = subString.strings; | 
|---|
|  | 124 | return *this; | 
|---|
|  | 125 | } | 
|---|
| [4597] | 126 |  | 
|---|
|  | 127 |  | 
|---|
| [7319] | 128 | /** | 
|---|
|  | 129 | * @brief comparator. | 
|---|
|  | 130 | * @param subString the SubString to compare against this one. | 
|---|
|  | 131 | * @returns true if the Stored Strings match | 
|---|
|  | 132 | */ | 
|---|
| [7398] | 133 | bool SubString::operator==(const SubString& subString) const | 
|---|
| [7319] | 134 | { | 
|---|
|  | 135 | return (this->strings == subString.strings); | 
|---|
|  | 136 | } | 
|---|
|  | 137 |  | 
|---|
| [7398] | 138 | /** | 
|---|
|  | 139 | * @brief comparator. | 
|---|
|  | 140 | * @param subString the SubString to compare against this one. | 
|---|
|  | 141 | * @returns true if the Stored Strings match | 
|---|
|  | 142 | */ | 
|---|
|  | 143 | bool SubString::compare(const SubString& subString) const | 
|---|
|  | 144 | { | 
|---|
|  | 145 | return (*this == subString); | 
|---|
|  | 146 | } | 
|---|
| [7319] | 147 |  | 
|---|
|  | 148 | /** | 
|---|
| [7398] | 149 | * @brief comparator. | 
|---|
|  | 150 | * @param subString the SubString to compare against this one. | 
|---|
|  | 151 | * @returns true if the Stored Strings match | 
|---|
|  | 152 | */ | 
|---|
|  | 153 | bool SubString::compare(const SubString& subString, unsigned int length) const | 
|---|
|  | 154 | { | 
|---|
|  | 155 | if (length > this->size() || length > subString.size()) | 
|---|
|  | 156 | return false; | 
|---|
|  | 157 |  | 
|---|
|  | 158 | for (unsigned int i = 0; i < length; i++) | 
|---|
|  | 159 | if (this->strings[i] != subString.strings[i]) | 
|---|
|  | 160 | return false; | 
|---|
|  | 161 | return true; | 
|---|
|  | 162 | } | 
|---|
|  | 163 |  | 
|---|
|  | 164 |  | 
|---|
|  | 165 | /** | 
|---|
| [7319] | 166 | * @brief append operator | 
|---|
|  | 167 | * @param subString the String to append. | 
|---|
|  | 168 | * @returns a SubString where this and subString are appended. | 
|---|
|  | 169 | */ | 
|---|
|  | 170 | SubString SubString::operator+(const SubString& subString) const | 
|---|
|  | 171 | { | 
|---|
| [7323] | 172 | return SubString(*this) += subString; | 
|---|
| [7319] | 173 | } | 
|---|
|  | 174 |  | 
|---|
|  | 175 |  | 
|---|
|  | 176 | /** | 
|---|
|  | 177 | * @brief append operator. | 
|---|
|  | 178 | * @param subString append subString to this SubString. | 
|---|
|  | 179 | * @returns this substring appended with subString | 
|---|
|  | 180 | */ | 
|---|
|  | 181 | SubString& SubString::operator+=(const SubString& subString) | 
|---|
|  | 182 | { | 
|---|
|  | 183 | for (unsigned int i = 0; i < subString.size(); i++) | 
|---|
|  | 184 | this->strings.push_back(subString[i]); | 
|---|
| [7323] | 185 | return *this; | 
|---|
| [7319] | 186 | } | 
|---|
|  | 187 |  | 
|---|
|  | 188 |  | 
|---|
|  | 189 | /** | 
|---|
|  | 190 | * @brief Split the String at | 
|---|
|  | 191 | * @param string where to split | 
|---|
|  | 192 | * @param splitter delimiter. | 
|---|
|  | 193 | */ | 
|---|
| [7221] | 194 | unsigned int SubString::split(const std::string& string, char splitter) | 
|---|
|  | 195 | { | 
|---|
|  | 196 | this->strings.clear(); | 
|---|
|  | 197 | char split[2]; | 
|---|
|  | 198 | split[0] = splitter; | 
|---|
|  | 199 | split[1] = '\0'; | 
|---|
| [7320] | 200 | SubString::splitLine(this->strings, string, split); | 
|---|
| [7221] | 201 | return strings.size(); | 
|---|
| [4220] | 202 | } | 
|---|
|  | 203 |  | 
|---|
| [5183] | 204 |  | 
|---|
| [3941] | 205 | /** | 
|---|
| [7319] | 206 | * @brief Splits a String into multiple splitters. | 
|---|
|  | 207 | * @param string the String to split | 
|---|
| [7474] | 208 | * @param delimiters multiple set of characters at what to split. (delimiters) | 
|---|
|  | 209 | * @param delimiterNeighbours: Neighbours to the Delimiters that will be erased too. | 
|---|
|  | 210 | * @param emptyEntries: If empty entries are added to the List of SubStrings | 
|---|
| [7319] | 211 | * @param escapeChar The Escape Character that overrides splitters commends and so on... | 
|---|
|  | 212 | * @param safemode_char within these characters splitting won't happen | 
|---|
|  | 213 | * @param comment_char the Comment character. | 
|---|
|  | 214 | */ | 
|---|
| [7474] | 215 | unsigned int SubString::split(const std::string& string, | 
|---|
|  | 216 | const std::string& delimiters, const std::string& delimiterNeighbours, bool emptyEntries, | 
|---|
|  | 217 | char escapeChar,char safemode_char, char comment_char) | 
|---|
| [7221] | 218 | { | 
|---|
|  | 219 | this->strings.clear(); | 
|---|
| [7474] | 220 | SubString::splitLine(this->strings, string, delimiters, delimiterNeighbours, emptyEntries, escapeChar, safemode_char, comment_char); | 
|---|
| [7323] | 221 | return this->strings.size(); | 
|---|
| [7221] | 222 | } | 
|---|
| [5183] | 223 |  | 
|---|
|  | 224 |  | 
|---|
| [7221] | 225 | /** | 
|---|
| [7319] | 226 | * @brief joins together all Strings of this Substring. | 
|---|
|  | 227 | * @param delimiter the String between the subStrings. | 
|---|
|  | 228 | * @returns the joined String. | 
|---|
|  | 229 | */ | 
|---|
|  | 230 | std::string SubString::join(const std::string& delimiter) const | 
|---|
|  | 231 | { | 
|---|
|  | 232 | if (!this->strings.empty()) | 
|---|
|  | 233 | { | 
|---|
|  | 234 | std::string retVal = this->strings[0]; | 
|---|
| [7321] | 235 | for (unsigned int i = 1; i < this->strings.size(); i++) | 
|---|
| [7319] | 236 | retVal += delimiter + this->strings[i]; | 
|---|
|  | 237 | return retVal; | 
|---|
|  | 238 | } | 
|---|
|  | 239 | else | 
|---|
|  | 240 | return SubString::emptyString; | 
|---|
|  | 241 | } | 
|---|
|  | 242 |  | 
|---|
|  | 243 |  | 
|---|
|  | 244 | /** | 
|---|
|  | 245 | * @brief creates a SubSet of a SubString. | 
|---|
|  | 246 | * @param subSetBegin the beginning to the end | 
|---|
|  | 247 | * @returns the SubSet | 
|---|
|  | 248 | * | 
|---|
|  | 249 | * This function is added for your convenience, and does the same as | 
|---|
|  | 250 | * SubString::SubString(const SubString& subString, unsigned int subSetBegin) | 
|---|
|  | 251 | */ | 
|---|
|  | 252 | SubString SubString::getSubSet(unsigned int subSetBegin) const | 
|---|
|  | 253 | { | 
|---|
|  | 254 | return SubString(*this, subSetBegin); | 
|---|
|  | 255 | } | 
|---|
|  | 256 |  | 
|---|
|  | 257 |  | 
|---|
|  | 258 | /** | 
|---|
|  | 259 | * @brief creates a SubSet of a SubString. | 
|---|
|  | 260 | * @param subSetBegin the beginning to | 
|---|
|  | 261 | * @param subSetEnd the end of the SubSet to select (if bigger than subString.size() it will be downset.) | 
|---|
|  | 262 | * @returns the SubSet | 
|---|
|  | 263 | * | 
|---|
|  | 264 | * This function is added for your convenience, and does the same as | 
|---|
|  | 265 | * SubString::SubString(const SubString& subString, unsigned int subSetBegin) | 
|---|
|  | 266 | */ | 
|---|
|  | 267 | SubString SubString::getSubSet(unsigned int subSetBegin, unsigned int subSetEnd) const | 
|---|
|  | 268 | { | 
|---|
|  | 269 | return SubString(*this, subSetBegin, subSetEnd); | 
|---|
|  | 270 | } | 
|---|
|  | 271 |  | 
|---|
|  | 272 |  | 
|---|
|  | 273 | /** | 
|---|
| [7221] | 274 | * @brief splits line into tokens and stores them in ret. | 
|---|
|  | 275 | * @param ret the Array, where the Splitted strings will be stored in | 
|---|
|  | 276 | * @param offsets an Array of Offsets, here the distance from the inputstring | 
|---|
|  | 277 | * to the beginning of the current token is stored | 
|---|
|  | 278 | * @param line the inputLine to split | 
|---|
|  | 279 | * @param delimiters a String of Delimiters (here the input will be splitted) | 
|---|
| [7474] | 280 | * @param delimiterNeighbour Naighbours to the Delimitter, that will be removed if they are to the left or the right of a Delimiter. | 
|---|
|  | 281 | * @param emptyEntries: if empty Strings are added to the List of Strings. | 
|---|
| [7221] | 282 | * @param escape_char: Escape carater (escapes splitters) | 
|---|
|  | 283 | * @param safemode_char: the beginning of the safemode is marked with this | 
|---|
|  | 284 | * @param comment_char: the beginning of a comment is marked with this: (until the end of a Line) | 
|---|
|  | 285 | * @param start_state: the Initial state on how to parse the String. | 
|---|
|  | 286 | * @returns SPLIT_LINE_STATE the parser was in when returning | 
|---|
|  | 287 | * | 
|---|
| [7319] | 288 | * This is the Actual Splitting Algorithm from Clemens Wacha | 
|---|
| [7221] | 289 | * Supports delimiters, escape characters, | 
|---|
|  | 290 | * ignores special  characters between safemode_char and between comment_char and linend '\n'. | 
|---|
|  | 291 | * | 
|---|
| [7474] | 292 | * | 
|---|
| [7221] | 293 | */ | 
|---|
| [7474] | 294 | SubString::SPLIT_LINE_STATE | 
|---|
|  | 295 | SubString::splitLine(std::vector<std::string>& ret, | 
|---|
|  | 296 | const std::string& line, | 
|---|
|  | 297 | const std::string& delimiters, | 
|---|
|  | 298 | const std::string& delimiterNeighbours, | 
|---|
|  | 299 | bool emptyEntries, | 
|---|
|  | 300 | char escape_char, | 
|---|
|  | 301 | char safemode_char, | 
|---|
|  | 302 | char comment_char, | 
|---|
|  | 303 | SPLIT_LINE_STATE start_state) | 
|---|
| [7221] | 304 | { | 
|---|
|  | 305 | SPLIT_LINE_STATE state = start_state; | 
|---|
| [5183] | 306 | unsigned int i = 0; | 
|---|
| [7474] | 307 | unsigned int fallBackNeighbours = 0; | 
|---|
|  | 308 |  | 
|---|
| [7221] | 309 | std::string token; | 
|---|
| [5183] | 310 |  | 
|---|
| [7221] | 311 | if(start_state != SL_NORMAL && ret.size() > 0) | 
|---|
| [5656] | 312 | { | 
|---|
| [7221] | 313 | token = ret[ret.size()-1]; | 
|---|
|  | 314 | ret.pop_back(); | 
|---|
| [5656] | 315 | } | 
|---|
|  | 316 |  | 
|---|
| [7221] | 317 | while(i < line.size()) | 
|---|
| [5656] | 318 | { | 
|---|
| [7221] | 319 | switch(state) | 
|---|
| [5656] | 320 | { | 
|---|
| [7474] | 321 | case SL_NORMAL: | 
|---|
| [7319] | 322 | if(line[i] == escape_char) | 
|---|
| [7221] | 323 | { | 
|---|
| [7319] | 324 | state = SL_ESCAPE; | 
|---|
| [7221] | 325 | } | 
|---|
| [7319] | 326 | else if(line[i] == safemode_char) | 
|---|
| [7221] | 327 | { | 
|---|
| [7319] | 328 | state = SL_SAFEMODE; | 
|---|
| [7221] | 329 | } | 
|---|
| [7319] | 330 | else if(line[i] == comment_char) | 
|---|
|  | 331 | { | 
|---|
| [7474] | 332 | if (fallBackNeighbours > 0) | 
|---|
|  | 333 | token = token.substr(0, token.size() - fallBackNeighbours); | 
|---|
| [7319] | 334 | /// FINISH | 
|---|
| [7474] | 335 | if(emptyEntries || token.size() > 0) | 
|---|
| [7319] | 336 | { | 
|---|
|  | 337 | ret.push_back(token); | 
|---|
|  | 338 | token.clear(); | 
|---|
|  | 339 | } | 
|---|
|  | 340 | token += line[i];       // EAT | 
|---|
|  | 341 | state = SL_COMMENT; | 
|---|
|  | 342 | } | 
|---|
|  | 343 | else if(delimiters.find(line[i]) != std::string::npos) | 
|---|
|  | 344 | { | 
|---|
|  | 345 | // line[i] is a delimiter | 
|---|
| [7474] | 346 | if (fallBackNeighbours > 0) | 
|---|
|  | 347 | token = token.substr(0, token.size() - fallBackNeighbours); | 
|---|
| [7319] | 348 | /// FINISH | 
|---|
| [7474] | 349 | if(emptyEntries || token.size() > 0) | 
|---|
| [7319] | 350 | { | 
|---|
|  | 351 | ret.push_back(token); | 
|---|
|  | 352 | token.clear(); | 
|---|
|  | 353 | } | 
|---|
| [7474] | 354 | state = SL_NORMAL; | 
|---|
| [7319] | 355 | } | 
|---|
|  | 356 | else | 
|---|
|  | 357 | { | 
|---|
| [7474] | 358 | if (delimiterNeighbours.find(line[i]) != std::string::npos) | 
|---|
|  | 359 | { | 
|---|
|  | 360 | if (token.size() > 0) | 
|---|
|  | 361 | ++fallBackNeighbours; | 
|---|
|  | 362 | else | 
|---|
|  | 363 | { | 
|---|
|  | 364 | i++; | 
|---|
|  | 365 | continue; | 
|---|
|  | 366 | } | 
|---|
|  | 367 | } | 
|---|
|  | 368 | else | 
|---|
|  | 369 | fallBackNeighbours = 0; | 
|---|
| [7319] | 370 | token += line[i];       // EAT | 
|---|
|  | 371 | } | 
|---|
|  | 372 | break; | 
|---|
| [7474] | 373 | case SL_ESCAPE: | 
|---|
| [7319] | 374 | if(line[i] == 'n') token += '\n'; | 
|---|
|  | 375 | else if(line[i] == 't') token += '\t'; | 
|---|
|  | 376 | else if(line[i] == 'v') token += '\v'; | 
|---|
|  | 377 | else if(line[i] == 'b') token += '\b'; | 
|---|
|  | 378 | else if(line[i] == 'r') token += '\r'; | 
|---|
|  | 379 | else if(line[i] == 'f') token += '\f'; | 
|---|
|  | 380 | else if(line[i] == 'a') token += '\a'; | 
|---|
|  | 381 | else if(line[i] == '?') token += '\?'; | 
|---|
|  | 382 | else token += line[i];  // EAT | 
|---|
| [7221] | 383 | state = SL_NORMAL; | 
|---|
| [7319] | 384 | break; | 
|---|
| [7474] | 385 | case SL_SAFEMODE: | 
|---|
| [7319] | 386 | if(line[i] == safemode_char) | 
|---|
| [7221] | 387 | { | 
|---|
| [7319] | 388 | state = SL_NORMAL; | 
|---|
| [7221] | 389 | } | 
|---|
| [7319] | 390 | else if(line[i] == escape_char) | 
|---|
|  | 391 | { | 
|---|
|  | 392 | state = SL_SAFEESCAPE; | 
|---|
|  | 393 | } | 
|---|
|  | 394 | else | 
|---|
|  | 395 | { | 
|---|
|  | 396 | token += line[i];       // EAT | 
|---|
|  | 397 | } | 
|---|
|  | 398 | break; | 
|---|
| [7474] | 399 |  | 
|---|
|  | 400 | case SL_SAFEESCAPE: | 
|---|
| [7319] | 401 | if(line[i] == 'n') token += '\n'; | 
|---|
|  | 402 | else if(line[i] == 't') token += '\t'; | 
|---|
|  | 403 | else if(line[i] == 'v') token += '\v'; | 
|---|
|  | 404 | else if(line[i] == 'b') token += '\b'; | 
|---|
|  | 405 | else if(line[i] == 'r') token += '\r'; | 
|---|
|  | 406 | else if(line[i] == 'f') token += '\f'; | 
|---|
|  | 407 | else if(line[i] == 'a') token += '\a'; | 
|---|
|  | 408 | else if(line[i] == '?') token += '\?'; | 
|---|
|  | 409 | else token += line[i];  // EAT | 
|---|
|  | 410 | state = SL_SAFEMODE; | 
|---|
|  | 411 | break; | 
|---|
| [7474] | 412 |  | 
|---|
|  | 413 | case SL_COMMENT: | 
|---|
| [7319] | 414 | if(line[i] == '\n') | 
|---|
|  | 415 | { | 
|---|
|  | 416 | /// FINISH | 
|---|
|  | 417 | if(token.size() > 0) | 
|---|
|  | 418 | { | 
|---|
|  | 419 | ret.push_back(token); | 
|---|
|  | 420 | token.clear(); | 
|---|
|  | 421 | } | 
|---|
|  | 422 | state = SL_NORMAL; | 
|---|
|  | 423 | } | 
|---|
|  | 424 | else | 
|---|
|  | 425 | { | 
|---|
|  | 426 | token += line[i];       // EAT | 
|---|
|  | 427 | } | 
|---|
|  | 428 | break; | 
|---|
| [7474] | 429 |  | 
|---|
|  | 430 | default: | 
|---|
| [7319] | 431 | // nothing | 
|---|
|  | 432 | break; | 
|---|
| [5656] | 433 | } | 
|---|
| [7221] | 434 | i++; | 
|---|
| [5656] | 435 | } | 
|---|
|  | 436 |  | 
|---|
| [7221] | 437 | /// FINISH | 
|---|
| [7474] | 438 | if (fallBackNeighbours > 0) | 
|---|
|  | 439 | token = token.substr(0, token.size() - fallBackNeighbours); | 
|---|
|  | 440 | if(emptyEntries || token.size() > 0) | 
|---|
| [5656] | 441 | { | 
|---|
| [7221] | 442 | ret.push_back(token); | 
|---|
|  | 443 | token.clear(); | 
|---|
| [5656] | 444 | } | 
|---|
| [7221] | 445 | return(state); | 
|---|
| [5656] | 446 | } | 
|---|
|  | 447 |  | 
|---|
| [3941] | 448 |  | 
|---|
|  | 449 | /** | 
|---|
| [7319] | 450 | * @brief Some nice debug information about this SubString | 
|---|
| [5200] | 451 | */ | 
|---|
| [4833] | 452 | void SubString::debug() const | 
|---|
|  | 453 | { | 
|---|
| [7221] | 454 | printf("Substring-information::count=%d ::", this->strings.size()); | 
|---|
|  | 455 | for (unsigned int i = 0; i < this->strings.size(); i++) | 
|---|
|  | 456 | printf("s%d='%s'::", i, this->strings[i].c_str()); | 
|---|
|  | 457 | printf("\n"); | 
|---|
| [4833] | 458 | } | 
|---|