28 skipped lines |
29 | | 29 | | Property *props[hashRoots]; |
|
30 | | 30 | | Property *enumnext; |
|
|
| | 32 | | static bool caseSensitiveFilenames; |
32 | | 33 | | static unsigned int HashString(const char *s, size_t len) { |
|
33 | | 34 | | unsigned int ret = 0; |
|
|
23 skipped lines |
58 | | 59 | | char *ToString(); // Caller must delete[] the return value |
|
59 | | 60 | | bool GetFirst(char **key, char **val); |
|
60 | | 61 | | bool GetNext(char **key, char **val); |
|
| | 62 | | static void SetCaseSensitiveFilenames(bool caseSensitiveFilenames_) { |
| | 63 | | caseSensitiveFilenames = caseSensitiveFilenames_; |
| | 64 | | } |
|
|
63 | | // copy-value semantics not implemented | | 67 | | // copy-value semantics not implemented |
64 | | 68 | | PropSet(const PropSet ©); |
|
65 | | 69 | | void operator=(const PropSet &assign); |
|
|
9 skipped lines |
|
77 | | 81 | | bool onlyLineEnds; ///< Delimited by any white space or only line ends |
|
|
| | 83 | | bool sortedNoCase; |
|
80 | | 85 | | WordList(bool onlyLineEnds_ = false) : |
|
81 | | words(0), wordsNoCase(0), list(0), len(0), onlyLineEnds(onlyLineEnds_), sorted(false) {} | | 86 | | words(0), wordsNoCase(0), list(0), len(0), onlyLineEnds(onlyLineEnds_), |
| | 87 | | sorted(false), sortedNoCase(false) {} |
82 | | 88 | | ~WordList() { Clear(); } |
|
83 | | 89 | | operator bool() { return len ? true : false; } |
|
84 | | 90 | | char *operator[](int ind) { return words[ind]; } |
|
2 skipped lines |
87 | | 93 | | char *Allocate(int size); |
|
88 | | 94 | | void SetFromAllocated(); |
|
89 | | 95 | | bool InList(const char *s); |
|
| | 96 | | bool InListAbbreviated(const char *s, const char marker); |
90 | | 97 | | const char *GetNearestWord(const char *wordStart, int searchLen, |
|
91 | | 98 | | bool ignoreCase = false, SString wordCharacters="", int wordIndex = -1); |
|
92 | | 99 | | char *GetNearestWords(const char *wordStart, int searchLen, |
|
16 skipped lines |