src/stc/scintilla/src/PropSet.cxx

   1 // SciTE - Scintilla based Text Editor
   2 /** @file PropSet.cxx
   3  ** A Java style properties file module.
   4  **/
   5 // Copyright 1998-2003 by Neil Hodgson <neilh@scintilla.org>
   6 // The License.txt file describes the conditions under which this software may be distributed.
   7
   8 // Maintain a dictionary of properties
   9
  10 #include <stdlib.h>
  11 #include <string.h>
  12 #include <stdio.h>
  13
  14 #include "Platform.h"
  15
  16 #include "PropSet.h"
  17
  18 #ifdef SCI_NAMESPACE
  19 using namespace Scintilla;
  20 #endif
  21
  22 // The comparison and case changing functions here assume ASCII
  23 // or extended ASCII such as the normal Windows code page.
  24
  25 static inline char MakeUpperCase(char ch) {
  26         if (ch < 'a' || ch > 'z')
  27                 return ch;
  28         else
  29                 return static_cast<char>(ch - 'a' + 'A');
  30 }
  31
  32 static inline bool IsLetter(char ch) {
  33         return ((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z'));
  34 }
  35
  36 inline bool IsASpace(unsigned int ch) {
  37     return (ch == ' ') || ((ch >= 0x09) && (ch <= 0x0d));
  38 }
  39
  40 int CompareCaseInsensitive(const char *a, const char *b) {
  41         while (*a && *b) {
  42                 if (*a != *b) {
  43                         char upperA = MakeUpperCase(*a);
  44                         char upperB = MakeUpperCase(*b);
  45                         if (upperA != upperB)
  46                                 return upperA - upperB;
  47                 }
  48                 a++;
  49                 b++;
  50         }
  51         // Either *a or *b is nul
  52         return *a - *b;
  53 }
  54
  55 int CompareNCaseInsensitive(const char *a, const char *b, size_t len) {
  56         while (*a && *b && len) {
  57                 if (*a != *b) {
  58                         char upperA = MakeUpperCase(*a);
  59                         char upperB = MakeUpperCase(*b);
  60                         if (upperA != upperB)
  61                                 return upperA - upperB;
  62                 }
  63                 a++;
  64                 b++;
  65                 len--;
  66         }
  67         if (len == 0)
  68                 return 0;
  69         else
  70                 // Either *a or *b is nul
  71                 return *a - *b;
  72 }
  73
  74 bool EqualCaseInsensitive(const char *a, const char *b) {
  75         return 0 == CompareCaseInsensitive(a, b);
  76 }
  77
  78 // Since the CaseInsensitive functions declared in SString
  79 // are implemented here, I will for now put the non-inline
  80 // implementations of the SString members here as well, so
  81 // that I can quickly see what effect this has.
  82
  83 SString::SString(int i) : sizeGrowth(sizeGrowthDefault) {
  84         char number[32];
  85         sprintf(number, "%0d", i);
  86         s = StringAllocate(number);
  87         sSize = sLen = (s) ? strlen(s) : 0;
  88 }
  89
  90 SString::SString(double d, int precision) : sizeGrowth(sizeGrowthDefault) {
  91         char number[32];
  92         sprintf(number, "%.*f", precision, d);
  93         s = StringAllocate(number);
  94         sSize = sLen = (s) ? strlen(s) : 0;
  95 }
  96
  97 bool SString::grow(lenpos_t lenNew) {
  98         while (sizeGrowth * 6 < lenNew) {
  99                 sizeGrowth *= 2;
 100         }
 101         char *sNew = new char[lenNew + sizeGrowth + 1];
 102         if (sNew) {
 103                 if (s) {
 104                         memcpy(sNew, s, sLen);
 105                         delete []s;
 106                 }
 107                 s = sNew;
 108                 s[sLen] = '\0';
 109                 sSize = lenNew + sizeGrowth;
 110         }
 111         return sNew != 0;
 112 }
 113
 114 SString &SString::assign(const char *sOther, lenpos_t sSize_) {
 115         if (!sOther) {
 116                 sSize_ = 0;
 117         } else if (sSize_ == measure_length) {
 118                 sSize_ = strlen(sOther);
 119         }
 120         if (sSize > 0 && sSize_ <= sSize) {     // Does not allocate new buffer if the current is big enough
 121                 if (s && sSize_) {
 122                         memcpy(s, sOther, sSize_);
 123                 }
 124                 s[sSize_] = '\0';
 125                 sLen = sSize_;
 126         } else {
 127                 delete []s;
 128                 s = StringAllocate(sOther, sSize_);
 129                 if (s) {
 130                         sSize = sSize_; // Allow buffer bigger than real string, thus providing space to grow
 131                         sLen = sSize_;
 132                 } else {
 133                         sSize = sLen = 0;
 134                 }
 135         }
 136         return *this;
 137 }
 138
 139 bool SString::operator==(const SString &sOther) const {
 140         if ((s == 0) && (sOther.s == 0))
 141                 return true;
 142         if ((s == 0) || (sOther.s == 0))
 143                 return false;
 144         return strcmp(s, sOther.s) == 0;
 145 }
 146
 147 bool SString::operator==(const char *sOther) const {
 148         if ((s == 0) && (sOther == 0))
 149                 return true;
 150         if ((s == 0) || (sOther == 0))
 151                 return false;
 152         return strcmp(s, sOther) == 0;
 153 }
 154
 155 SString SString::substr(lenpos_t subPos, lenpos_t subLen) const {
 156         if (subPos >= sLen) {
 157                 return SString();                                       // return a null string if start index is out of bounds
 158         }
 159         if ((subLen == measure_length) || (subPos + subLen > sLen)) {
 160                 subLen = sLen - subPos;         // can't substr past end of source string
 161         }
 162         return SString(s, subPos, subPos + subLen);
 163 }
 164
 165 SString &SString::lowercase(lenpos_t subPos, lenpos_t subLen) {
 166         if ((subLen == measure_length) || (subPos + subLen > sLen)) {
 167                 subLen = sLen - subPos;         // don't apply past end of string
 168         }
 169         for (lenpos_t i = subPos; i < subPos + subLen; i++) {
 170                 if (s[i] < 'A' || s[i] > 'Z')
 171                         continue;
 172                 else
 173                         s[i] = static_cast<char>(s[i] - 'A' + 'a');
 174         }
 175         return *this;
 176 }
 177
 178 SString &SString::uppercase(lenpos_t subPos, lenpos_t subLen) {
 179         if ((subLen == measure_length) || (subPos + subLen > sLen)) {
 180                 subLen = sLen - subPos;         // don't apply past end of string
 181         }
 182         for (lenpos_t i = subPos; i < subPos + subLen; i++) {
 183                 if (s[i] < 'a' || s[i] > 'z')
 184                         continue;
 185                 else
 186                         s[i] = static_cast<char>(s[i] - 'a' + 'A');
 187         }
 188         return *this;
 189 }
 190
 191 SString &SString::append(const char *sOther, lenpos_t sLenOther, char sep) {
 192         if (!sOther) {
 193                 return *this;
 194         }
 195         if (sLenOther == measure_length) {
 196                 sLenOther = strlen(sOther);
 197         }
 198         int lenSep = 0;
 199         if (sLen && sep) {      // Only add a separator if not empty
 200                 lenSep = 1;
 201         }
 202         lenpos_t lenNew = sLen + sLenOther + lenSep;
 203         // Conservative about growing the buffer: don't do it, unless really needed
 204         if ((lenNew < sSize) || (grow(lenNew))) {
 205                 if (lenSep) {
 206                         s[sLen] = sep;
 207                         sLen++;
 208                 }
 209                 memcpy(&s[sLen], sOther, sLenOther);
 210                 sLen += sLenOther;
 211                 s[sLen] = '\0';
 212         }
 213         return *this;
 214 }
 215
 216 SString &SString::insert(lenpos_t pos, const char *sOther, lenpos_t sLenOther) {
 217         if (!sOther || pos > sLen) {
 218                 return *this;
 219         }
 220         if (sLenOther == measure_length) {
 221                 sLenOther = strlen(sOther);
 222         }
 223         lenpos_t lenNew = sLen + sLenOther;
 224         // Conservative about growing the buffer: don't do it, unless really needed
 225         if ((lenNew < sSize) || grow(lenNew)) {
 226                 lenpos_t moveChars = sLen - pos + 1;
 227                 for (lenpos_t i = moveChars; i > 0; i--) {
 228                         s[pos + sLenOther + i - 1] = s[pos + i - 1];
 229                 }
 230                 memcpy(s + pos, sOther, sLenOther);
 231                 sLen = lenNew;
 232         }
 233         return *this;
 234 }
 235
 236 /**
 237  * Remove @a len characters from the @a pos position, included.
 238  * Characters at pos + len and beyond replace characters at pos.
 239  * If @a len is 0, or greater than the length of the string
 240  * starting at @a pos, the string is just truncated at @a pos.
 241  */
 242 void SString::remove(lenpos_t pos, lenpos_t len) {
 243         if (pos >= sLen) {
 244                 return;
 245         }
 246         if (len < 1 || pos + len >= sLen) {
 247                 s[pos] = '\0';
 248                 sLen = pos;
 249         } else {
 250                 for (lenpos_t i = pos; i < sLen - len + 1; i++) {
 251                         s[i] = s[i+len];
 252                 }
 253                 sLen -= len;
 254         }
 255 }
 256
 257 bool SString::startswith(const char *prefix) {
 258         lenpos_t lenPrefix = strlen(prefix);
 259         if (lenPrefix > sLen) {
 260                 return false;
 261         }
 262         return strncmp(s, prefix, lenPrefix) == 0;
 263 }
 264
 265 bool SString::endswith(const char *suffix) {
 266         lenpos_t lenSuffix = strlen(suffix);
 267         if (lenSuffix > sLen) {
 268                 return false;
 269         }
 270         return strncmp(s + sLen - lenSuffix, suffix, lenSuffix) == 0;
 271 }
 272
 273 int SString::search(const char *sFind, lenpos_t start) const {
 274         if (start < sLen) {
 275                 const char *sFound = strstr(s + start, sFind);
 276                 if (sFound) {
 277                         return sFound - s;
 278                 }
 279         }
 280         return -1;
 281 }
 282
 283 int SString::substitute(char chFind, char chReplace) {
 284         int c = 0;
 285         char *t = s;
 286         while (t) {
 287                 t = strchr(t, chFind);
 288                 if (t) {
 289                         *t = chReplace;
 290                         t++;
 291                         c++;
 292                 }
 293         }
 294         return c;
 295 }
 296
 297 int SString::substitute(const char *sFind, const char *sReplace) {
 298         int c = 0;
 299         lenpos_t lenFind = strlen(sFind);
 300         lenpos_t lenReplace = strlen(sReplace);
 301         int posFound = search(sFind);
 302         while (posFound >= 0) {
 303                 remove(posFound, lenFind);
 304                 insert(posFound, sReplace, lenReplace);
 305                 posFound = search(sFind, posFound + lenReplace);
 306                 c++;
 307         }
 308         return c;
 309 }
 310
 311 char *SContainer::StringAllocate(lenpos_t len) {
 312         if (len != measure_length) {
 313                 return new char[len + 1];
 314         } else {
 315                 return 0;
 316         }
 317 }
 318
 319 char *SContainer::StringAllocate(const char *s, lenpos_t len) {
 320         if (s == 0) {
 321                 return 0;
 322         }
 323         if (len == measure_length) {
 324                 len = strlen(s);
 325         }
 326         char *sNew = new char[len + 1];
 327         if (sNew) {
 328                 memcpy(sNew, s, len);
 329                 sNew[len] = '\0';
 330         }
 331         return sNew;
 332 }
 333
 334 // End SString functions
 335
 336 PropSet::PropSet() {
 337         superPS = 0;
 338         for (int root = 0; root < hashRoots; root++)
 339                 props[root] = 0;
 340 }
 341
 342 PropSet::~PropSet() {
 343         superPS = 0;
 344         Clear();
 345 }
 346
 347 void PropSet::Set(const char *key, const char *val, int lenKey, int lenVal) {
 348         if (!*key)      // Empty keys are not supported
 349                 return;
 350         if (lenKey == -1)
 351                 lenKey = static_cast<int>(strlen(key));
 352         if (lenVal == -1)
 353                 lenVal = static_cast<int>(strlen(val));
 354         unsigned int hash = HashString(key, lenKey);
 355         for (Property *p = props[hash % hashRoots]; p; p = p->next) {
 356                 if ((hash == p->hash) &&
 357                         ((strlen(p->key) == static_cast<unsigned int>(lenKey)) &&
 358                                 (0 == strncmp(p->key, key, lenKey)))) {
 359                         // Replace current value
 360                         delete [](p->val);
 361                         p->val = StringDup(val, lenVal);
 362                         return;
 363                 }
 364         }
 365         // Not found
 366         Property *pNew = new Property;
 367         if (pNew) {
 368                 pNew->hash = hash;
 369                 pNew->key = StringDup(key, lenKey);
 370                 pNew->val = StringDup(val, lenVal);
 371                 pNew->next = props[hash % hashRoots];
 372                 props[hash % hashRoots] = pNew;
 373         }
 374 }
 375
 376 void PropSet::Set(const char *keyVal) {
 377         while (IsASpace(*keyVal))
 378                 keyVal++;
 379         const char *endVal = keyVal;
 380         while (*endVal && (*endVal != '\n'))
 381                 endVal++;
 382         const char *eqAt = strchr(keyVal, '=');
 383         if (eqAt) {
 384                 Set(keyVal, eqAt + 1, eqAt-keyVal, endVal - eqAt - 1);
 385         } else if (*keyVal) {   // No '=' so assume '=1'
 386                 Set(keyVal, "1", endVal-keyVal, 1);
 387         }
 388 }
 389
 390 void PropSet::Unset(const char *key, int lenKey) {
 391         if (!*key)      // Empty keys are not supported
 392                 return;
 393         if (lenKey == -1)
 394                 lenKey = static_cast<int>(strlen(key));
 395         unsigned int hash = HashString(key, lenKey);
 396         Property *pPrev = NULL;
 397         for (Property *p = props[hash % hashRoots]; p; p = p->next) {
 398                 if ((hash == p->hash) &&
 399                         ((strlen(p->key) == static_cast<unsigned int>(lenKey)) &&
 400                                 (0 == strncmp(p->key, key, lenKey)))) {
 401                         if (pPrev)
 402                                 pPrev->next = p->next;
 403                         else
 404                                 props[hash % hashRoots] = p->next;
 405                         if (p == enumnext)
 406                                 enumnext = p->next; // Not that anyone should mix enum and Set / Unset.
 407                         delete [](p->key);
 408                         delete [](p->val);
 409                         delete p;
 410                         return;
 411                 } else {
 412                         pPrev = p;
 413                 }
 414         }
 415 }
 416
 417 void PropSet::SetMultiple(const char *s) {
 418         const char *eol = strchr(s, '\n');
 419         while (eol) {
 420                 Set(s);
 421                 s = eol + 1;
 422                 eol = strchr(s, '\n');
 423         }
 424         Set(s);
 425 }
 426
 427 SString PropSet::Get(const char *key) const {
 428         unsigned int hash = HashString(key, strlen(key));
 429         for (Property *p = props[hash % hashRoots]; p; p = p->next) {
 430                 if ((hash == p->hash) && (0 == strcmp(p->key, key))) {
 431                         return p->val;
 432                 }
 433         }
 434         if (superPS) {
 435                 // Failed here, so try in base property set
 436                 return superPS->Get(key);
 437         } else {
 438                 return "";
 439         }
 440 }
 441
 442 // There is some inconsistency between GetExpanded("foo") and Expand("$(foo)").
 443 // A solution is to keep a stack of variables that have been expanded, so that
 444 // recursive expansions can be skipped.  For now I'll just use the C++ stack
 445 // for that, through a recursive function and a simple chain of pointers.
 446
 447 struct VarChain {
 448         VarChain(const char*var_=NULL, const VarChain *link_=NULL): var(var_), link(link_) {}
 449
 450         bool contains(const char *testVar) const {
 451                 return (var && (0 == strcmp(var, testVar)))
 452                         || (link && link->contains(testVar));
 453         }
 454
 455         const char *var;
 456         const VarChain *link;
 457 };
 458
 459 static int ExpandAllInPlace(const PropSet &props, SString &withVars, int maxExpands, const VarChain &blankVars = VarChain()) {
 460         int varStart = withVars.search("$(");
 461         while ((varStart >= 0) && (maxExpands > 0)) {
 462                 int varEnd = withVars.search(")", varStart+2);
 463                 if (varEnd < 0) {
 464                         break;
 465                 }
 466
 467                 // For consistency, when we see '$(ab$(cde))', expand the inner variable first,
 468                 // regardless whether there is actually a degenerate variable named 'ab$(cde'.
 469                 int innerVarStart = withVars.search("$(", varStart+2);
 470                 while ((innerVarStart > varStart) && (innerVarStart < varEnd)) {
 471                         varStart = innerVarStart;
 472                         innerVarStart = withVars.search("$(", varStart+2);
 473                 }
 474
 475                 SString var(withVars.c_str(), varStart + 2, varEnd);
 476                 SString val = props.Get(var.c_str());
 477
 478                 if (blankVars.contains(var.c_str())) {
 479                         val.clear(); // treat blankVar as an empty string (e.g. to block self-reference)
 480                 }
 481
 482                 if (--maxExpands >= 0) {
 483                         maxExpands = ExpandAllInPlace(props, val, maxExpands, VarChain(var.c_str(), &blankVars));
 484                 }
 485
 486                 withVars.remove(varStart, varEnd-varStart+1);
 487                 withVars.insert(varStart, val.c_str(), val.length());
 488
 489                 varStart = withVars.search("$(");
 490         }
 491
 492         return maxExpands;
 493 }
 494
 495 SString PropSet::GetExpanded(const char *key) const {
 496         SString val = Get(key);
 497         ExpandAllInPlace(*this, val, 100, VarChain(key));
 498         return val;
 499 }
 500
 501 SString PropSet::Expand(const char *withVars, int maxExpands) const {
 502         SString val = withVars;
 503         ExpandAllInPlace(*this, val, maxExpands);
 504         return val;
 505 }
 506
 507 int PropSet::GetInt(const char *key, int defaultValue) const {
 508         SString val = GetExpanded(key);
 509         if (val.length())
 510                 return val.value();
 511         return defaultValue;
 512 }
 513
 514 bool isprefix(const char *target, const char *prefix) {
 515         while (*target && *prefix) {
 516                 if (*target != *prefix)
 517                         return false;
 518                 target++;
 519                 prefix++;
 520         }
 521         if (*prefix)
 522                 return false;
 523         else
 524                 return true;
 525 }
 526
 527 void PropSet::Clear() {
 528         for (int root = 0; root < hashRoots; root++) {
 529                 Property *p = props[root];
 530                 while (p) {
 531                         Property *pNext = p->next;
 532                         p->hash = 0;
 533                         delete []p->key;
 534                         p->key = 0;
 535                         delete []p->val;
 536                         p->val = 0;
 537                         delete p;
 538                         p = pNext;
 539                 }
 540                 props[root] = 0;
 541         }
 542 }
 543
 544 char *PropSet::ToString() const {
 545         size_t len=0;
 546         for (int r = 0; r < hashRoots; r++) {
 547                 for (Property *p = props[r]; p; p = p->next) {
 548                         len += strlen(p->key) + 1;
 549                         len += strlen(p->val) + 1;
 550                 }
 551         }
 552         if (len == 0)
 553                 len = 1;        // Return as empty string
 554         char *ret = new char [len];
 555         if (ret) {
 556                 char *w = ret;
 557                 for (int root = 0; root < hashRoots; root++) {
 558                         for (Property *p = props[root]; p; p = p->next) {
 559                                 strcpy(w, p->key);
 560                                 w += strlen(p->key);
 561                                 *w++ = '=';
 562                                 strcpy(w, p->val);
 563                                 w += strlen(p->val);
 564                                 *w++ = '\n';
 565                         }
 566                 }
 567                 ret[len-1] = '\0';
 568         }
 569         return ret;
 570 }
 571
 572 /**
 573  * Creates an array that points into each word in the string and puts \0 terminators
 574  * after each word.
 575  */
 576 static char **ArrayFromWordList(char *wordlist, int *len, bool onlyLineEnds = false) {
 577         int prev = '\n';
 578         int words = 0;
 579         // For rapid determination of whether a character is a separator, build
 580         // a look up table.
 581         bool wordSeparator[256];
 582         for (int i=0;i<256; i++) {
 583                 wordSeparator[i] = false;
 584         }
 585         wordSeparator['\r'] = true;
 586         wordSeparator['\n'] = true;
 587         if (!onlyLineEnds) {
 588                 wordSeparator[' '] = true;
 589                 wordSeparator['\t'] = true;
 590         }
 591         for (int j = 0; wordlist[j]; j++) {
 592                 int curr = static_cast<unsigned char>(wordlist[j]);
 593                 if (!wordSeparator[curr] && wordSeparator[prev])
 594                         words++;
 595                 prev = curr;
 596         }
 597         char **keywords = new char *[words + 1];
 598         if (keywords) {
 599                 words = 0;
 600                 prev = '\0';
 601                 size_t slen = strlen(wordlist);
 602                 for (size_t k = 0; k < slen; k++) {
 603                         if (!wordSeparator[static_cast<unsigned char>(wordlist[k])]) {
 604                                 if (!prev) {
 605                                         keywords[words] = &wordlist[k];
 606                                         words++;
 607                                 }
 608                         } else {
 609                                 wordlist[k] = '\0';
 610                         }
 611                         prev = wordlist[k];
 612                 }
 613                 keywords[words] = &wordlist[slen];
 614                 *len = words;
 615         } else {
 616                 *len = 0;
 617         }
 618         return keywords;
 619 }
 620
 621 void WordList::Clear() {
 622         if (words) {
 623                 delete []list;
 624                 delete []words;
 625         }
 626         words = 0;
 627         list = 0;
 628         len = 0;
 629         sorted = false;
 630 }
 631
 632 void WordList::Set(const char *s) {
 633         list = StringDup(s);
 634         sorted = false;
 635         words = ArrayFromWordList(list, &len, onlyLineEnds);
 636 }
 637
 638 extern "C" int cmpString(const void *a1, const void *a2) {
 639         // Can't work out the correct incantation to use modern casts here
 640         return strcmp(*(char**)(a1), *(char**)(a2));
 641 }
 642
 643 static void SortWordList(char **words, unsigned int len) {
 644         qsort(reinterpret_cast<void*>(words), len, sizeof(*words),
 645               cmpString);
 646 }
 647
 648 bool WordList::InList(const char *s) {
 649         if (0 == words)
 650                 return false;
 651         if (!sorted) {
 652                 sorted = true;
 653                 SortWordList(words, len);
 654                 for (unsigned int k = 0; k < (sizeof(starts) / sizeof(starts[0])); k++)
 655                         starts[k] = -1;
 656                 for (int l = len - 1; l >= 0; l--) {
 657                         unsigned char indexChar = words[l][0];
 658                         starts[indexChar] = l;
 659                 }
 660         }
 661         unsigned char firstChar = s[0];
 662         int j = starts[firstChar];
 663         if (j >= 0) {
 664                 while ((unsigned char)words[j][0] == firstChar) {
 665                         if (s[1] == words[j][1]) {
 666                                 const char *a = words[j] + 1;
 667                                 const char *b = s + 1;
 668                                 while (*a && *a == *b) {
 669                                         a++;
 670                                         b++;
 671                                 }
 672                                 if (!*a && !*b)
 673                                         return true;
 674                         }
 675                         j++;
 676                 }
 677         }
 678         j = starts['^'];
 679         if (j >= 0) {
 680                 while (words[j][0] == '^') {
 681                         const char *a = words[j] + 1;
 682                         const char *b = s;
 683                         while (*a && *a == *b) {
 684                                 a++;
 685                                 b++;
 686                         }
 687                         if (!*a)
 688                                 return true;
 689                         j++;
 690                 }
 691         }
 692         return false;
 693 }
 694
 695 /** similar to InList, but word s can be a substring of keyword.
 696  * eg. the keyword define is defined as def~ine. This means the word must start
 697  * with def to be a keyword, but also defi, defin and define are valid.
 698  * The marker is ~ in this case.
 699  */
 700 bool WordList::InListAbbreviated(const char *s, const char marker) {
 701         if (0 == words)
 702                 return false;
 703         if (!sorted) {
 704                 sorted = true;
 705                 SortWordList(words, len);
 706                 for (unsigned int k = 0; k < (sizeof(starts) / sizeof(starts[0])); k++)
 707                         starts[k] = -1;
 708                 for (int l = len - 1; l >= 0; l--) {
 709                         unsigned char indexChar = words[l][0];
 710                         starts[indexChar] = l;
 711                 }
 712         }
 713         unsigned char firstChar = s[0];
 714         int j = starts[firstChar];
 715         if (j >= 0) {
 716                 while (words[j][0] == firstChar) {
 717                         bool isSubword = false;
 718                         int start = 1;
 719                         if (words[j][1] == marker) {
 720                                 isSubword = true;
 721                                 start++;
 722                         }
 723                         if (s[1] == words[j][start]) {
 724                                 const char *a = words[j] + start;
 725                                 const char *b = s + 1;
 726                                 while (*a && *a == *b) {
 727                                         a++;
 728                                         if (*a == marker) {
 729                                                 isSubword = true;
 730                                                 a++;
 731                                         }
 732                                         b++;
 733                                 }
 734                                 if ((!*a || isSubword) && !*b)
 735                                         return true;
 736                         }
 737                         j++;
 738                 }
 739         }
 740         j = starts['^'];
 741         if (j >= 0) {
 742                 while (words[j][0] == '^') {
 743                         const char *a = words[j] + 1;
 744                         const char *b = s;
 745                         while (*a && *a == *b) {
 746                                 a++;
 747                                 b++;
 748                         }
 749                         if (!*a)
 750                                 return true;
 751                         j++;
 752                 }
 753         }
 754         return false;
 755 }