aboutsummaryrefslogtreecommitdiffhomepage
path: root/lexlib/WordList.cxx
diff options
context:
space:
mode:
authorNeil <nyamatongwe@gmail.com>2018-04-22 08:35:01 +1000
committerNeil <nyamatongwe@gmail.com>2018-04-22 08:35:01 +1000
commit8f9a43df028d13c1bc6654aa6dcf66dd542843d2 (patch)
tree677c3aae65caee744f4ce00478f40dcfec7147bc /lexlib/WordList.cxx
parentafcd6f1fa748f2ade19010b3307c341b382818de (diff)
downloadscintilla-mirror-8f9a43df028d13c1bc6654aa6dcf66dd542843d2.tar.gz
Backport: Remove casts between char and unsigned char where possible.
Backport of changeset 6731:8e06234817c0.
Diffstat (limited to 'lexlib/WordList.cxx')
-rw-r--r--lexlib/WordList.cxx8
1 files changed, 4 insertions, 4 deletions
diff --git a/lexlib/WordList.cxx b/lexlib/WordList.cxx
index 425bcc01a..954689ef7 100644
--- a/lexlib/WordList.cxx
+++ b/lexlib/WordList.cxx
@@ -113,7 +113,7 @@ static int cmpWords(const void *a, const void *b) {
}
static void SortWordList(char **words, unsigned int len) {
- qsort(static_cast<void *>(words), len, sizeof(*words), cmpWords);
+ qsort(words, len, sizeof(*words), cmpWords);
}
#endif
@@ -147,7 +147,7 @@ bool WordList::InList(const char *s) const {
const unsigned char firstChar = s[0];
int j = starts[firstChar];
if (j >= 0) {
- while (static_cast<unsigned char>(words[j][0]) == firstChar) {
+ while (words[j][0] == firstChar) {
if (s[1] == words[j][1]) {
const char *a = words[j] + 1;
const char *b = s + 1;
@@ -189,7 +189,7 @@ bool WordList::InListAbbreviated(const char *s, const char marker) const {
const unsigned char firstChar = s[0];
int j = starts[firstChar];
if (j >= 0) {
- while (static_cast<unsigned char>(words[j][0]) == firstChar) {
+ while (words[j][0] == firstChar) {
bool isSubword = false;
int start = 1;
if (words[j][1] == marker) {
@@ -243,7 +243,7 @@ bool WordList::InListAbridged(const char *s, const char marker) const {
const unsigned char firstChar = s[0];
int j = starts[firstChar];
if (j >= 0) {
- while (static_cast<unsigned char>(words[j][0]) == firstChar) {
+ while (words[j][0] == firstChar) {
const char *a = words[j];
const char *b = s;
while (*a && *a == *b) {