diff options
| author | nyamatongwe <devnull@localhost> | 2002-01-15 07:35:34 +0000 |
|---|---|---|
| committer | nyamatongwe <devnull@localhost> | 2002-01-15 07:35:34 +0000 |
| commit | 2d0ba77d21ef2c645bcad67fa61dec4e80b54f25 (patch) | |
| tree | 8c2d07245a1252a89ae24c298f0059ab99194aa9 /src | |
| parent | ed7ff8459b0ea15c20460b4c051625424b88b7b6 (diff) | |
| download | scintilla-mirror-2d0ba77d21ef2c645bcad67fa61dec4e80b54f25.tar.gz | |
GetNearestWord changed to use a passed in set of valid word characters
rather than a hardcoded list.
Diffstat (limited to 'src')
| -rw-r--r-- | src/PropSet.cxx | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/PropSet.cxx b/src/PropSet.cxx index 73ac52343..0ddbb59c2 100644 --- a/src/PropSet.cxx +++ b/src/PropSet.cxx @@ -567,7 +567,7 @@ bool WordList::InList(const char *s) { * The length of the word to compare is passed too. * Letter case can be ignored or preserved (default). */ -const char *WordList::GetNearestWord(const char *wordStart, int searchLen /*= -1*/, bool ignoreCase /*= false*/) { +const char *WordList::GetNearestWord(const char *wordStart, int searchLen /*= -1*/, bool ignoreCase /*= false*/, SString wordCharacters /*='/0' */) { int start = 0; // lower bound of the api array block to search int end = len - 1; // upper bound of the api array block to search int pivot; // index of api array element just being compared @@ -585,8 +585,8 @@ const char *WordList::GetNearestWord(const char *wordStart, int searchLen /*= -1 pivot = (start + end) >> 1; word = wordsNoCase[pivot]; cond = CompareNCaseInsensitive(wordStart, word, searchLen); - if (!cond && nonFuncChar(word[searchLen])) // maybe there should be a "non-word character" test here? - return word; // result must not be freed with free() + if (!cond && (!wordCharacters.contains(word[searchLen]))) + return word; // result must not be freed with free() else if (cond > 0) start = pivot + 1; else if (cond <= 0) @@ -597,7 +597,7 @@ const char *WordList::GetNearestWord(const char *wordStart, int searchLen /*= -1 pivot = (start + end) >> 1; word = words[pivot]; cond = strncmp(wordStart, word, searchLen); - if (!cond && nonFuncChar(word[searchLen])) // maybe there should be a "non-word character" test here? + if (!cond && (!wordCharacters.contains(word[searchLen]))) return word; // result must not be freed with free() else if (cond > 0) start = pivot + 1; |