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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
|
/* Copyright Abandoned 1996 TCX DataKonsult AB & Monty Program KB & Detron HB
This file is public domain and comes with NO WARRANTY of any kind */
/*
Functions to convert to lover_case and to upper_case in scandinavia.
case_sort converts a character string to a representaion that can
be compared by strcmp to find with is alfabetical bigger.
(lower- and uppercase letters is compared as the same)
*/
#include "mysys_priv.h"
#include <m_ctype.h>
/* string to uppercase */
void caseup_str(my_string str)
{
#ifdef USE_MB
register uint32 l;
register char *end=str+strlen(str);
while (*str)
{
if ((l=ismbchar(str,end))) str+=l;
else *str=toupper(*str),++str;
}
#else
while ((*str = toupper(*str)) != 0)
str++;
#endif
} /* caseup_str */
/* string to lowercase */
void casedn_str(my_string str)
{
#ifdef USE_MB
register uint32 l;
register char *end=str+strlen(str);
while (*str)
{
if ((l=ismbchar(str,end))) str+=l;
else *str=tolower(*str),++str;
}
#else
while ((*str= tolower(*str)) != 0)
str++;
#endif
} /* casedn_str */
/* to uppercase */
void caseup(my_string str, uint length)
{
#ifdef USE_MB
register uint32 l;
register char *end=str+length;
while (str<end)
{
if ((l=ismbchar(str,end))) str+=l;
else *str=toupper(*str),++str;
}
#else
for ( ; length>0 ; length--, str++)
*str= toupper(*str);
#endif
} /* caseup */
/* to lowercase */
void casedn(my_string str, uint length)
{
#ifdef USE_MB
register uint32 l;
register char *end=str+length;
while (str<end)
{
if ((l=ismbchar(str,end))) str+=l;
else *str=tolower(*str),++str;
}
#else
for ( ; length>0 ; length--, str++)
*str= tolower(*str);
#endif
} /* casedn */
/* to sort-string that can be compared to get text in order */
void case_sort(my_string str, uint length)
{
for ( ; length>0 ; length--, str++)
*str= (char) my_sort_order[(uchar) *str];
} /* case_sort */
/* find string in another with no case_sensivity */
/* ToDo: This function should be modified to support multibyte charset.
However it is not used untill 3.23.5.
Wei He (hewei@mail.ied.ac.cn)
*/
my_string strcasestr(const char *str, const char *search)
{
uchar *i,*j,*pos;
pos=(uchar*) str;
skipp:
while (*pos != '\0')
{
if (toupper((uchar) *pos++) == toupper((uchar) *search)) {
i=(uchar*) pos; j=(uchar*) search+1;
while (*j)
if (toupper(*i++) != toupper(*j++)) goto skipp;
return ((char*) pos-1);
}
}
return ((my_string) 0);
} /* strcstr */
/* compare strings without regarding to case */
int my_strcasecmp(const char *s, const char *t)
{
#ifdef USE_MB
register uint32 l;
register const char *end=s+strlen(s);
while (s<end)
{
if ((l=ismbchar(s,end)))
{
while (l--)
if (*s++ != *t++) return 1;
}
else if (ismbhead(*t)) return 1;
else if (toupper((uchar) *s++) != toupper((uchar) *t++)) return 1;
}
return *t;
#else
while (toupper((uchar) *s) == toupper((uchar) *t++))
if (!*s++) return 0;
return ((int) toupper((uchar) s[0]) - (int) toupper((uchar) t[-1]));
#endif
}
int my_casecmp(const char *s, const char *t, uint len)
{
#ifdef USE_MB
register uint32 l;
register const char *end=s+len;
while (s<end)
{
if ((l=ismbchar(s,end)))
{
while (l--)
if (*s++ != *t++) return 1;
}
else if (ismbhead(*t)) return 1;
else if (toupper((uchar) *s++) != toupper((uchar) *t++)) return 1;
}
return 0;
#else
while (len-- != 0 && toupper(*s++) == toupper(*t++)) ;
return (int) len+1;
#endif
}
int my_strsortcmp(const char *s, const char *t)
{
#ifdef USE_STRCOLL
return my_strcoll((uchar *)s, (uchar *)t);
#else
while (my_sort_order[(uchar) *s] == my_sort_order[(uchar) *t++])
if (!*s++) return 0;
return ((int) my_sort_order[(uchar) s[0]] - (int) my_sort_order[(uchar) t[-1]]);
#endif
}
int my_sortcmp(const char *s, const char *t, uint len)
{
#ifndef USE_STRCOLL
while (len--)
{
if (my_sort_order[(uchar) *s++] != my_sort_order[(uchar) *t++])
return ((int) my_sort_order[(uchar) s[-1]] -
(int) my_sort_order[(uchar) t[-1]]);
}
return 0;
#else
return my_strnncoll((uchar *)s, len, (uchar *)t, len);
#endif
}
|
