/
ace_str.c
215 lines (159 loc) · 3.14 KB
/
ace_str.c
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
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
#include <ctype.h>
#include "ace_str.h"
int isnonzero(const char c)
{
return ((c >= '1') && (c <= '9'));
}
int isrank(const char c)
{
return (isnonzero(c) && (c != '9'));
}
int isfile(const char c)
{
return ((c >= 'a') && (c <= 'h'));
}
int iszero(const char c)
{
return (c == '0');
}
int iswhite(const char c)
{
return ((c == 'P') || (c == 'N') || (c == 'B') ||
(c == 'R') || (c == 'Q') || (c == 'K'));
}
int isblack(const char c)
{
return ((c == 'p') || (c == 'n') || (c == 'b') ||
(c == 'r') || (c == 'q') || (c == 'k'));
}
int ismaterial(const char c)
{
return ((c == 'b') || (c == 'n') || (c == 'Q') || (c == 'r') ||
(c == 'B') || (c == 'N') || (c == 'q') || (c == 'R'));
}
void str_trim_ex(char** sz, const char *pattern)
{
str_ltrim_ex(sz, pattern);
str_rtrim_ex(*sz, pattern);
}
void str_ltrim_ex(char** sz, const char* pattern)
{
assert(sz);
assert(*sz);
char* s = *sz;
while (*s) {
if (str_contains(pattern, *s)) {
s++;
(*sz)++;
}
else { break; }
}
}
void str_rtrim_ex(char* sz, const char* pattern)
{
char* s = sz;
char* last = NULL;
assert(sz);
while (*s) {
if (!str_contains(pattern, *s)) {
/* keep track of the last non-trimmable character */
last = s;
}
s++;
}
if (last) {
/* move the null character */
last++;
*last = 0;
} else {
/* string was all trimmable */
*sz = 0;
}
}
int str_icompare(const char* a, const char *b)
{
int r = 0;
assert(a);
assert(b);
while (1) {
r = tolower(*a) - tolower(*b);
if ((r) || (*a == 0)) return r;
a++;
b++;
}
return r;
}
int str_begin(const char* prefix, const char *sz)
{
while (*prefix) {
if (*sz == 0) return 0;
if (*sz != *prefix) return 0;
prefix++;
sz++;
}
return 1;
}
int str_ibegin(const char* prefix, const char *sz)
{
while (*prefix) {
if (*sz == 0) return 0;
if (tolower(*sz) != tolower(*prefix)) return 0;
prefix++;
sz++;
}
return 1;
}
piece_t piece_from_char(const char c)
{
piece_t p = INVALID_PIECE;
set_piece_color(p, WHITE);
/* is c a valid character */
switch (c) {
case 'p': set_piece_color(p, BLACK);
case 'P': set_piece_type(p, PAWN); break;
case 'n': set_piece_color(p, BLACK);
case 'N': set_piece_type(p, KNIGHT); break;
case 'b': set_piece_color(p, BLACK);
case 'B': set_piece_type(p, BISHOP); break;
case 'r': set_piece_color(p, BLACK);
case 'R': set_piece_type(p, ROOK); break;
case 'q': set_piece_color(p, BLACK);
case 'Q': set_piece_type(p, QUEEN); break;
case 'k': set_piece_color(p, BLACK);
case 'K': set_piece_type(p, KING); break;
default: break;
}
return p;
}
board_file_t file_from_char(const char c)
{
board_file_t f = FA;
if (isfile(c)) {
f = (board_file_t)(c - 'a');
}
return f;
}
board_rank_t rank_from_char(const char c)
{
board_rank_t r = R1;
if (isrank(c)) {
r = (board_rank_t)(c - '1');
}
return r;
}
char char_from_piece(piece_t p)
{
static const char sPIECES[6] = { 'P', 'N', 'B', 'R', 'Q', 'K' };
if (piece_color(p) == BLACK) {
return tolower(sPIECES[piece_type(p)]);
}
return sPIECES[piece_type(p)];
}
char char_from_file(board_file_t f)
{
return ('a' + f);
}
char char_from_rank(board_rank_t r)
{
return ('1' + r);
}