From fd4b89e797c1efc73304fa4da073fb31f55527f1 Mon Sep 17 00:00:00 2001 From: Robin Haberkorn Date: Sat, 23 Feb 2013 19:15:17 +0100 Subject: fixed symbol lists: sort order must correspond with search order (determined by comparision function) * lists were sorted lexicographically (like strcmp()), but searched caseless (like strcasecmp()) * lists are now sorted with strcasecmp()-like comparision * caselessness is thus a property of the SymbolList * use new language features in symbols-extract.tes --- src/symbols.cpp | 5 +---- 1 file changed, 1 insertion(+), 4 deletions(-) (limited to 'src/symbols.cpp') diff --git a/src/symbols.cpp b/src/symbols.cpp index 5b0de92..60abf57 100644 --- a/src/symbols.cpp +++ b/src/symbols.cpp @@ -39,17 +39,14 @@ namespace Symbols { * binary search. */ gint -SymbolList::lookup(const gchar *name, const gchar *prefix, bool case_sensitive) +SymbolList::lookup(const gchar *name, const gchar *prefix) { - int (*cmp_fnc)(const char *, const char *, size_t); gint prefix_skip = strlen(prefix); gint name_len = strlen(name); gint left = 0; gint right = size - 1; - cmp_fnc = case_sensitive ? strncmp : g_ascii_strncasecmp; - if (!cmp_fnc(name, prefix, prefix_skip)) prefix_skip = 0; -- cgit v1.2.3