blob: c129c4b86e1ba85230ae47de3d4ce22653357131 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
|
/*
* Copyright (C) 2012-2015 Robin Haberkorn
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include <string.h>
#include <glib.h>
#include "sciteco.h"
#include "symbols.h"
namespace SciTECO {
/*
* Since symbol lists are presorted constant arrays we can do a simple
* binary search.
*/
gint
SymbolList::lookup(const gchar *name, const gchar *prefix)
{
gint prefix_skip = strlen(prefix);
gint name_len = strlen(name);
gint left = 0;
gint right = size - 1;
if (!cmp_fnc(name, prefix, prefix_skip))
prefix_skip = 0;
while (left <= right) {
gint cur = left + (right-left)/2;
gint cmp = cmp_fnc(entries[cur].name + prefix_skip,
name, name_len + 1);
if (!cmp)
return entries[cur].value;
if (cmp > 0)
right = cur-1;
else /* cmp < 0 */
left = cur+1;
}
return -1;
}
GList *
SymbolList::get_glist(void)
{
if (!list) {
for (gint i = size; i; i--)
list = g_list_prepend(list, (gchar *)entries[i-1].name);
}
return list;
}
} /* namespace SciTECO */
|
