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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
|
/*
* Copyright 2006 The Android Open Source Project
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "SkTSearch.h"
#include <ctype.h>
static inline const char* index_into_base(const char*const* base, int index,
size_t elemSize)
{
return *(const char*const*)((const char*)base + index * elemSize);
}
int SkStrSearch(const char*const* base, int count, const char target[],
size_t target_len, size_t elemSize)
{
if (count <= 0)
return ~0;
SkASSERT(base != NULL);
int lo = 0;
int hi = count - 1;
while (lo < hi)
{
int mid = (hi + lo) >> 1;
const char* elem = index_into_base(base, mid, elemSize);
int cmp = strncmp(elem, target, target_len);
if (cmp < 0)
lo = mid + 1;
else if (cmp > 0 || strlen(elem) > target_len)
hi = mid;
else
return mid;
}
const char* elem = index_into_base(base, hi, elemSize);
int cmp = strncmp(elem, target, target_len);
if (cmp || strlen(elem) > target_len)
{
if (cmp < 0)
hi += 1;
hi = ~hi;
}
return hi;
}
int SkStrSearch(const char*const* base, int count, const char target[],
size_t elemSize)
{
return SkStrSearch(base, count, target, strlen(target), elemSize);
}
int SkStrLCSearch(const char*const* base, int count, const char target[],
size_t len, size_t elemSize)
{
SkASSERT(target);
SkAutoAsciiToLC tolc(target, len);
return SkStrSearch(base, count, tolc.lc(), len, elemSize);
}
int SkStrLCSearch(const char*const* base, int count, const char target[],
size_t elemSize)
{
return SkStrLCSearch(base, count, target, strlen(target), elemSize);
}
//////////////////////////////////////////////////////////////////////////////
SkAutoAsciiToLC::SkAutoAsciiToLC(const char str[], size_t len)
{
// see if we need to compute the length
if ((long)len < 0) {
len = strlen(str);
}
fLength = len;
// assign lc to our preallocated storage if len is small enough, or allocate
// it on the heap
char* lc;
if (len <= STORAGE) {
lc = fStorage;
} else {
lc = (char*)sk_malloc_throw(len + 1);
}
fLC = lc;
// convert any asii to lower-case. we let non-ascii (utf8) chars pass
// through unchanged
for (int i = (int)(len - 1); i >= 0; --i) {
int c = str[i];
if ((c & 0x80) == 0) { // is just ascii
c = tolower(c);
}
lc[i] = c;
}
lc[len] = 0;
}
SkAutoAsciiToLC::~SkAutoAsciiToLC()
{
if (fLC != fStorage) {
sk_free(fLC);
}
}
|
