diff options
| author | nyamatongwe <unknown> | 2013-05-08 18:50:12 +1000 |
|---|---|---|
| committer | nyamatongwe <unknown> | 2013-05-08 18:50:12 +1000 |
| commit | 2ab494b49811d760154a2640416a2cab5708b8c0 (patch) | |
| tree | 37d9d45da8efd75ae1e688dc217568fe06f1b670 /lexers | |
| parent | fb9f49fcaf224a3df72a85ffd37072f0cd282769 (diff) | |
| download | scintilla-mirror-2ab494b49811d760154a2640416a2cab5708b8c0.tar.gz | |
Hide implementation of WordList.
Diffstat (limited to 'lexers')
| -rw-r--r-- | lexers/LexCPP.cxx | 6 | ||||
| -rw-r--r-- | lexers/LexModula.cxx | 12 |
2 files changed, 9 insertions, 9 deletions
diff --git a/lexers/LexCPP.cxx b/lexers/LexCPP.cxx index 0e14eebdb..9b56641e6 100644 --- a/lexers/LexCPP.cxx +++ b/lexers/LexCPP.cxx @@ -455,9 +455,9 @@ int SCI_METHOD LexerCPP::WordListSet(int n, const char *wl) { if (n == 4) { // Rebuild preprocessorDefinitions preprocessorDefinitionsStart.clear(); - for (int nDefinition = 0; nDefinition < ppDefinitions.len; nDefinition++) { - char *cpDefinition = ppDefinitions.words[nDefinition]; - char *cpEquals = strchr(cpDefinition, '='); + for (int nDefinition = 0; nDefinition < ppDefinitions.Length(); nDefinition++) { + const char *cpDefinition = ppDefinitions.WordAt(nDefinition); + const char *cpEquals = strchr(cpDefinition, '='); if (cpEquals) { std::string name(cpDefinition, cpEquals - cpDefinition); std::string val(cpEquals+1); diff --git a/lexers/LexModula.cxx b/lexers/LexModula.cxx index cc5847fd6..ed615609c 100644 --- a/lexers/LexModula.cxx +++ b/lexers/LexModula.cxx @@ -63,16 +63,16 @@ static inline unsigned IsOperator( StyleContext & sc, WordList & op ) { s[0] = sc.ch; s[1] = sc.chNext; s[2] = 0; - for( i = 0; i < op.len; i++ ) { - if( ( strlen( op.words[i] ) == 2 ) && - ( s[0] == op.words[i][0] && s[1] == op.words[i][1] ) ) { + for( i = 0; i < op.Length(); i++ ) { + if( ( strlen( op.WordAt(i) ) == 2 ) && + ( s[0] == op.WordAt(i)[0] && s[1] == op.WordAt(i)[1] ) ) { return 2; } } s[1] = 0; - for( i = 0; i < op.len; i++ ) { - if( ( strlen( op.words[i] ) == 1 ) && - ( s[0] == op.words[i][0] ) ) { + for( i = 0; i < op.Length(); i++ ) { + if( ( strlen( op.WordAt(i) ) == 1 ) && + ( s[0] == op.WordAt(i)[0] ) ) { return 1; } } |
