26 n= (n + 3) & (0xfffffffc);
101 for (
int i= 0; i < n; i++)
108 for (i= 0; i < n; i++)
115 for (i= 0; i < n; i++)
127 for (i= 0; i < n; i++) {
128 if (s[i] !=
S[i])
return false;
129 if (s[i] ==
'\0')
return false;
131 return (s[i] ==
'\0');
138 for (i= 0; i < n; i++) {
139 if (s[i] !=
S[i])
return true;
140 if (s[i] ==
'\0')
return true;
142 return (s[i] !=
'\0');
172 for (i= 0; i < n; i++)
179 int old_a_N= a->expand_or_shrink_by (1);
188 for (
int i= 0; i <
b_N; i++)
197 for (i= 0; i <
n1; i++)
199 for (i= 0; i <
n2; i++)
228 h= (h << 9) + (h >> 23);
240 return (s ==
"true" || s ==
"#t");
245 int i= 0, n=
N (s),
val= 0;
246 if (n == 0)
return 0;
247 if (s[0] ==
'+') i++;
248 if (s[0] ==
'-') i++;
250 if (s[i] <
'0')
break;
251 if (s[i] >
'9')
break;
253 val+= (int) (s[i] -
'0');
256 if (s[0] ==
'-')
val= -
val;
264 if (n == 0)
return 0;
265 if (s[0] ==
'+') i++;
266 if (s[0] ==
'-') i++;
268 if (s[i] <
'0')
break;
269 if (s[i] >
'9')
break;
271 val+= (int) (s[i] -
'0');
274 if (s[0] ==
'-')
val= -
val;
284 for (i= 0; i < n; i++)
297 for (i= 0; i < n; i++)
306 else return string (
"false");
360 return (s ==
"true") || (s ==
"false");
366 if (n == 0)
return false;
367 if (s[i] ==
'+') i++;
368 if (s[i] ==
'-') i++;
369 if (i == n)
return false;
371 if ((s[i] <
'0') || (s[i] >
'9'))
return false;
378 if (n == 0)
return false;
379 if (s[i] ==
'+') i++;
380 if (s[i] ==
'-') i++;
381 if (i == n)
return false;
383 if ((s[i] <
'0') || (s[i] >
'9'))
break;
384 if (i == n)
return true;
387 if (i == n)
return false;
389 if ((s[i] <
'0') || (s[i] >
'9'))
break;
391 if (i == n)
return true;
392 if (s[i++] !=
'e')
return false;
393 if (s[i] ==
'+') i++;
394 if (s[i] ==
'-') i++;
395 if (i == n)
return false;
397 if ((s[i] <
'0') || (s[i] >
'9'))
return false;
410 return (n >= 2) && (s[0] ==
'\"') && (s[n - 1] ==
'\"');
416 if (n == 0)
return false;
417 for (i= 0; i < n; i++) {
418 if ((i > 0) && (s[i] >=
'0') && (s[i] <=
'9'))
continue;
419 if ((s[i] >=
'a') && (s[i] <=
'z'))
continue;
420 if ((s[i] >=
'A') && (s[i] <=
'Z'))
continue;
421 if (s[i] ==
'_')
continue;
int N(array< T > a)
Get the length of the array.
int round_length(int n, size_t s)
#define STACK_NEW_ARRAY(name, T, size)
#define STACK_DELETE_ARRAY(name)
The list class represents a linked list.
void reserve(int n)
reserve memory space to contain at least n word in the whole string. Do not affect length of string,...
int expand_or_shrink_by(int delta)
expand (or shrink) string by delta, but do not release memory when string is shrinked.
void resize(int n)
expand (or shrink) string to given length n, and try to release memory when string is shrinked.
bool operator!=(const char *s)
bool operator==(const char *s)
string operator()(int start, int end)
void tm_delete_array(C *Ptr)
SI min(SI i, SI j)
Returns the minimum of two signed integers.
SI max(SI i, SI j)
Returns the maximum of two signed integers.
bool operator<(string s1, string s2)
bool operator<=(string s1, string s2)
static int round_length(int n)
string as_string_bool(bool f)
char * as_charp(string s)
string as_string(int16_t i)
long int as_long_int(string s)
double as_double(string s)
string operator*(string a, string b)
string & operator<<(string &a, char x)
url delta(url base, url u)