1410 lines
30 KiB
C++
1410 lines
30 KiB
C++
|
|
#define FSTRING_DECLS
|
|
#define FSTRING_BEGIN
|
|
#define DOC_EXPORT
|
|
|
|
FSTRING_BEGIN
|
|
// TOP
|
|
|
|
#if defined(FSTRING_IMPLEMENTATION) && defined(FSTRING_GUARD)
|
|
#undef FSTRING_IMPLEMENTATION
|
|
#endif
|
|
|
|
#include <stdint.h>
|
|
|
|
#ifndef FSTRING_LINK
|
|
# define FSTRING_LINK static
|
|
#endif
|
|
|
|
#ifndef FSTRING_INLINE
|
|
# define FSTRING_INLINE inline
|
|
#endif
|
|
|
|
#ifndef FSTRING_STRUCT
|
|
#define FSTRING_STRUCT
|
|
struct String{
|
|
char *str;
|
|
int32_t size;
|
|
int32_t memory_size;
|
|
};
|
|
|
|
struct Offset_String{
|
|
int32_t offset;
|
|
int32_t size;
|
|
};
|
|
#endif
|
|
|
|
#ifndef fstr_bool
|
|
# define fstr_bool int32_t
|
|
#endif
|
|
|
|
#ifndef literal
|
|
# define literal(s) (s), (sizeof(s)-1)
|
|
#endif
|
|
|
|
FSTRING_DECLS
|
|
|
|
//
|
|
// Character Helpers
|
|
//
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
char_not_slash(char c)/* DOC() */{
|
|
return (c != '\\' && c != '/');
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
char_is_slash(char c)/* DOC() */{
|
|
return (c == '\\' || c == '/');
|
|
}
|
|
|
|
FSTRING_INLINE char
|
|
char_to_upper(char c)/* DOC() */{
|
|
return (c >= 'a' && c <= 'z') ? c + (char)('A' - 'a') : c;
|
|
}
|
|
|
|
FSTRING_INLINE char
|
|
char_to_lower(char c)/* DOC() */{
|
|
return (c >= 'A' && c <= 'Z') ? c - (char)('A' - 'a') : c;
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
char_is_whitespace(char c)/* DOC() */{
|
|
return (c == ' ' || c == '\n' || c == '\r' || c == '\t');
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
char_is_alpha_numeric(char c)/* DOC() */{
|
|
return (c >= 'a' && c <= 'z' || c >= 'A' && c <= 'Z' || c >= '0' && c <= '9' || c == '_');
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
char_is_hex(char c)/* DOC() */{
|
|
return c >= '0' && c <= '9' || c >= 'A' && c <= 'F' || c >= 'a' && c <= 'f';
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
char_is_numeric(char c)/* DOC() */{
|
|
return (c >= '0' && c <= '9');
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
char_is_alpha(char c)/* DOC() */{
|
|
return (c >= 'a' && c <= 'z' || c >= 'A' && c <= 'Z' || c == '_');
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
char_is_alpha_true(char c)/* DOC() */{
|
|
return (c >= 'a' && c <= 'z' || c >= 'A' && c <= 'Z');
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
char_is_alpha_numeric_true(char c)/* DOC() */{
|
|
return (c >= 'a' && c <= 'z' || c >= 'A' && c <= 'Z' || c >= '0' && c <= '9');
|
|
}
|
|
|
|
|
|
//
|
|
// String Making Functions
|
|
//
|
|
|
|
FSTRING_INLINE String
|
|
string_zero()/* DOC() */{
|
|
String str={0};
|
|
return(str);
|
|
}
|
|
|
|
FSTRING_INLINE String
|
|
make_string(void *str, int32_t size, int32_t mem_size)/* DOC() */{
|
|
String result;
|
|
result.str = (char*)str;
|
|
result.size = size;
|
|
result.memory_size = mem_size;
|
|
return result;
|
|
}
|
|
|
|
FSTRING_INLINE String
|
|
make_string(void *str, int32_t size)/* DOC() */{
|
|
String result;
|
|
result.str = (char*)str;
|
|
result.size = size;
|
|
result.memory_size = size;
|
|
return result;
|
|
}
|
|
|
|
DOC_EXPORT /* DOC() */
|
|
#define make_lit_string(s) (make_string((char*)(s), sizeof(s)-1, sizeof(s)))
|
|
|
|
DOC_EXPORT /* DOC() */
|
|
#define make_fixed_width_string(s) (make_string((char*)(s), 0, sizeof(s)))
|
|
|
|
DOC_EXPORT /* DOC() */
|
|
#define expand_str(s) ((s).str), ((s).size)
|
|
|
|
FSTRING_LINK int32_t
|
|
str_size(char *str)/* DOC() */{
|
|
int32_t i = 0;
|
|
while (str[i]) ++i;
|
|
return i;
|
|
}
|
|
|
|
FSTRING_INLINE String
|
|
make_string_slowly(void *str)/* DOC() */{
|
|
String result;
|
|
result.str = (char*)str;
|
|
result.size = str_size((char*)str);
|
|
result.memory_size = result.size;
|
|
return result;
|
|
}
|
|
|
|
// TODO(allen): I don't love the substr rule, I chose
|
|
// substr(String, start) and substr(String, start, size)
|
|
// but I wish I had substr(String, end) and substr(String, start, end)
|
|
|
|
FSTRING_INLINE String
|
|
substr(String str, int32_t start)/* DOC() */{
|
|
String result;
|
|
result.str = str.str + start;
|
|
result.size = str.size - start;
|
|
result.memory_size = 0;
|
|
return(result);
|
|
}
|
|
|
|
FSTRING_INLINE String
|
|
substr(String str, int32_t start, int32_t size)/* DOC() */{
|
|
String result;
|
|
result.str = str.str + start;
|
|
result.size = size;
|
|
if (start + size > str.size){
|
|
result.size = str.size - start;
|
|
}
|
|
result.memory_size = 0;
|
|
return(result);
|
|
}
|
|
|
|
FSTRING_INLINE String
|
|
tailstr(String str)/* DOC() */{
|
|
String result;
|
|
result.str = str.str + str.size;
|
|
result.memory_size = str.memory_size - str.size;
|
|
result.size = 0;
|
|
return(result);
|
|
}
|
|
|
|
FSTRING_LINK String
|
|
skip_whitespace(String str)/* DOC() */{
|
|
String result = {0};
|
|
int i = 0;
|
|
for (; i < str.size && char_is_whitespace(str.str[i]); ++i);
|
|
result = substr(str, i, str.size - i);
|
|
return(result);
|
|
}
|
|
|
|
FSTRING_LINK String
|
|
chop_whitespace(String str)/* DOC() */{
|
|
String result = {0};
|
|
int i = str.size;
|
|
for (; i > 0 && char_is_whitespace(str.str[i-1]); --i);
|
|
result = substr(str, 0, i);
|
|
return(result);
|
|
}
|
|
|
|
FSTRING_LINK String
|
|
skip_chop_whitespace(String str)/* DOC() */{
|
|
str = skip_whitespace(str);
|
|
str = chop_whitespace(str);
|
|
return(str);
|
|
}
|
|
|
|
|
|
//
|
|
// String Comparison
|
|
//
|
|
|
|
FSTRING_LINK fstr_bool
|
|
match(char *a, char *b)/* DOC() */{
|
|
for (int32_t i = 0;; ++i){
|
|
if (a[i] != b[i]){
|
|
return 0;
|
|
}
|
|
if (a[i] == 0){
|
|
return 1;
|
|
}
|
|
}
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
match(String a, char *b)/* DOC() */{
|
|
int32_t i = 0;
|
|
for (; i < a.size; ++i){
|
|
if (a.str[i] != b[i]){
|
|
return 0;
|
|
}
|
|
}
|
|
if (b[i] != 0){
|
|
return 0;
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
match(char *a, String b)/* DOC() */{
|
|
return(match(b,a));
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
match(String a, String b)/* DOC() */{
|
|
if (a.size != b.size){
|
|
return 0;
|
|
}
|
|
for (int32_t i = 0; i < b.size; ++i){
|
|
if (a.str[i] != b.str[i]){
|
|
return 0;
|
|
}
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
match_part(char *a, char *b, int32_t *len)/* DOC() */{
|
|
int32_t i;
|
|
for (i = 0; b[i] != 0; ++i){
|
|
if (a[i] != b[i]){
|
|
return 0;
|
|
}
|
|
}
|
|
*len = i;
|
|
return 1;
|
|
}
|
|
|
|
|
|
FSTRING_LINK fstr_bool
|
|
match_part(String a, char *b, int32_t *len)/* DOC() */{
|
|
int32_t i;
|
|
for (i = 0; b[i] != 0; ++i){
|
|
if (a.str[i] != b[i] || i == a.size){
|
|
return 0;
|
|
}
|
|
}
|
|
*len = i;
|
|
return 1;
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
match_part(char *a, char *b)/* DOC() */{
|
|
int32_t x;
|
|
return match_part(a,b,&x);
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
match_part(String a, char *b)/* DOC() */{
|
|
int32_t x;
|
|
return match_part(a,b,&x);
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
match_part(char *a, String b)/* DOC() */{
|
|
for (int32_t i = 0; i != b.size; ++i){
|
|
if (a[i] != b.str[i]){
|
|
return 0;
|
|
}
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
match_part(String a, String b)/* DOC() */{
|
|
if (a.size < b.size){
|
|
return 0;
|
|
}
|
|
for (int32_t i = 0; i < b.size; ++i){
|
|
if (a.str[i] != b.str[i]){
|
|
return 0;
|
|
}
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
match_insensitive(char *a, char *b)/* DOC() */{
|
|
for (int32_t i = 0;; ++i){
|
|
if (char_to_upper(a[i]) !=
|
|
char_to_upper(b[i])){
|
|
return 0;
|
|
}
|
|
if (a[i] == 0){
|
|
return 1;
|
|
}
|
|
}
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
match_insensitive(String a, char *b)/* DOC() */{
|
|
int32_t i = 0;
|
|
for (; i < a.size; ++i){
|
|
if (char_to_upper(a.str[i]) !=
|
|
char_to_upper(b[i])){
|
|
return 0;
|
|
}
|
|
}
|
|
if (b[i] != 0){
|
|
return 0;
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
match_insensitive(char *a, String b)/* DOC() */{
|
|
return match_insensitive(b,a);
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
match_insensitive(String a, String b)/* DOC() */{
|
|
if (a.size != b.size){
|
|
return 0;
|
|
}
|
|
for (int32_t i = 0; i < b.size; ++i){
|
|
if (char_to_upper(a.str[i]) !=
|
|
char_to_upper(b.str[i])){
|
|
return 0;
|
|
}
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
match_part_insensitive(char *a, char *b, int32_t *len)/* DOC() */{
|
|
int32_t i;
|
|
for (i = 0; b[i] != 0; ++i){
|
|
if (char_to_upper(a[i]) != char_to_upper(b[i])){
|
|
return 0;
|
|
}
|
|
}
|
|
*len = i;
|
|
return 1;
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
match_part_insensitive(String a, char *b, int32_t *len)/* DOC() */{
|
|
int32_t i;
|
|
for (i = 0; b[i] != 0; ++i){
|
|
if (char_to_upper(a.str[i]) != char_to_upper(b[i]) ||
|
|
i == a.size){
|
|
return 0;
|
|
}
|
|
}
|
|
*len = i;
|
|
return 1;
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
match_part_insensitive(char *a, char *b)/* DOC() */{
|
|
int32_t x;
|
|
return match_part(a,b,&x);
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
match_part_insensitive(String a, char *b)/* DOC() */{
|
|
int32_t x;
|
|
return match_part(a,b,&x);
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
match_part_insensitive(char *a, String b)/* DOC() */{
|
|
for (int32_t i = 0; i != b.size; ++i){
|
|
if (char_to_upper(a[i]) != char_to_upper(b.str[i])){
|
|
return 0;
|
|
}
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
match_part_insensitive(String a, String b)/* DOC() */{
|
|
if (a.size < b.size){
|
|
return 0;
|
|
}
|
|
for (int32_t i = 0; i < b.size; ++i){
|
|
if (char_to_upper(a.str[i]) != char_to_upper(b.str[i])){
|
|
return 0;
|
|
}
|
|
}
|
|
return 1;
|
|
}
|
|
|
|
FSTRING_LINK int32_t
|
|
compare(char *a, char *b)/* DOC() */{
|
|
int32_t i = 0;
|
|
while (a[i] == b[i] && a[i] != 0){
|
|
++i;
|
|
}
|
|
return (a[i] > b[i]) - (a[i] < b[i]);
|
|
}
|
|
|
|
FSTRING_LINK int32_t
|
|
compare(String a, char *b)/* DOC() */{
|
|
int32_t i = 0;
|
|
while (i < a.size && a.str[i] == b[i]){
|
|
++i;
|
|
}
|
|
if (i < a.size){
|
|
return (a.str[i] > b[i]) - (a.str[i] < b[i]);
|
|
}
|
|
else{
|
|
if (b[i] == 0){
|
|
return 0;
|
|
}
|
|
else{
|
|
return -1;
|
|
}
|
|
}
|
|
}
|
|
|
|
FSTRING_INLINE int32_t
|
|
compare(char *a, String b)/* DOC() */{
|
|
return -compare(b,a);
|
|
}
|
|
|
|
FSTRING_LINK int32_t
|
|
compare(String a, String b)/* DOC() */{
|
|
int32_t i = 0;
|
|
while (i < a.size && i < b.size && a.str[i] == b.str[i]){
|
|
++i;
|
|
}
|
|
if (i < a.size && i < b.size){
|
|
return (a.str[i] > b.str[i]) - (a.str[i] < b.str[i]);
|
|
}
|
|
else{
|
|
return (a.size > b.size) - (a.size < b.size);
|
|
}
|
|
}
|
|
|
|
//
|
|
// Finding Characters and Substrings
|
|
//
|
|
|
|
FSTRING_LINK int32_t
|
|
find(char *str, int32_t start, char character)/* DOC() */{
|
|
int32_t i = start;
|
|
while (str[i] != character && str[i] != 0) ++i;
|
|
return i;
|
|
}
|
|
|
|
FSTRING_LINK int32_t
|
|
find(String str, int32_t start, char character)/* DOC() */{
|
|
int32_t i = start;
|
|
while (i < str.size && str.str[i] != character) ++i;
|
|
return i;
|
|
}
|
|
|
|
FSTRING_LINK int32_t
|
|
find(char *str, int32_t start, char *characters)/* DOC() */{
|
|
int32_t i = start, j;
|
|
while (str[i] != 0){
|
|
for (j = 0; characters[j]; ++j){
|
|
if (str[i] == characters[j]){
|
|
return i;
|
|
}
|
|
}
|
|
++i;
|
|
}
|
|
return i;
|
|
}
|
|
|
|
FSTRING_LINK int32_t
|
|
find(String str, int32_t start, char *characters)/* DOC() */{
|
|
int32_t i = start, j;
|
|
while (i < str.size){
|
|
for (j = 0; characters[j]; ++j){
|
|
if (str.str[i] == characters[j]){
|
|
return i;
|
|
}
|
|
}
|
|
++i;
|
|
}
|
|
return i;
|
|
}
|
|
|
|
FSTRING_LINK int32_t
|
|
find_substr(char *str, int32_t start, String seek)/* DOC() */{
|
|
int32_t i, j, k;
|
|
fstr_bool hit;
|
|
|
|
if (seek.size == 0){
|
|
return str_size(str);
|
|
}
|
|
for (i = start; str[i]; ++i){
|
|
if (str[i] == seek.str[0]){
|
|
hit = 1;
|
|
for (j = 1, k = i+1; j < seek.size; ++j, ++k){
|
|
if (str[k] != seek.str[j]){
|
|
hit = 0;
|
|
break;
|
|
}
|
|
}
|
|
if (hit){
|
|
return i;
|
|
}
|
|
}
|
|
}
|
|
return i;
|
|
}
|
|
|
|
FSTRING_LINK int32_t
|
|
find_substr(String str, int32_t start, String seek)/* DOC() */{
|
|
int32_t stop_at, i, j, k;
|
|
fstr_bool hit;
|
|
|
|
if (seek.size == 0){
|
|
return str.size;
|
|
}
|
|
stop_at = str.size - seek.size + 1;
|
|
for (i = start; i < stop_at; ++i){
|
|
if (str.str[i] == seek.str[0]){
|
|
hit = 1;
|
|
for (j = 1, k = i+1; j < seek.size; ++j, ++k){
|
|
if (str.str[k] != seek.str[j]){
|
|
hit = 0;
|
|
break;
|
|
}
|
|
}
|
|
if (hit){
|
|
return i;
|
|
}
|
|
}
|
|
}
|
|
return str.size;
|
|
}
|
|
|
|
FSTRING_LINK int32_t
|
|
rfind_substr(String str, int32_t start, String seek)/* DOC() */{
|
|
int32_t i, j, k;
|
|
fstr_bool hit;
|
|
|
|
if (seek.size == 0){
|
|
return -1;
|
|
}
|
|
if (start + seek.size > str.size){
|
|
start = str.size - seek.size;
|
|
}
|
|
for (i = start; i >= 0; --i){
|
|
if (str.str[i] == seek.str[0]){
|
|
hit = 1;
|
|
for (j = 1, k = i+1; j < seek.size; ++j, ++k){
|
|
if (str.str[k] != seek.str[j]){
|
|
hit = 0;
|
|
break;
|
|
}
|
|
}
|
|
if (hit){
|
|
return i;
|
|
}
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
FSTRING_LINK int32_t
|
|
find_substr_insensitive(char *str, int32_t start, String seek)/* DOC() */{
|
|
int32_t i, j, k;
|
|
fstr_bool hit;
|
|
char a_upper, b_upper;
|
|
|
|
if (seek.size == 0){
|
|
return str_size(str);
|
|
}
|
|
for (i = start; str[i]; ++i){
|
|
if (str[i] == seek.str[0]){
|
|
hit = 1;
|
|
for (j = 1, k = i+1; j < seek.size; ++j, ++k){
|
|
a_upper = char_to_upper(str[k]);
|
|
b_upper = char_to_upper(seek.str[j]);
|
|
if (a_upper != b_upper){
|
|
hit = 0;
|
|
break;
|
|
}
|
|
}
|
|
if (hit){
|
|
return i;
|
|
}
|
|
}
|
|
}
|
|
return i;
|
|
}
|
|
|
|
FSTRING_LINK int32_t
|
|
find_substr_insensitive(String str, int32_t start, String seek)/* DOC() */{
|
|
int32_t i, j, k;
|
|
int32_t stop_at;
|
|
fstr_bool hit;
|
|
char a_upper, b_upper;
|
|
|
|
if (seek.size == 0){
|
|
return str.size;
|
|
}
|
|
stop_at = str.size - seek.size + 1;
|
|
for (i = start; i < stop_at; ++i){
|
|
if (str.str[i] == seek.str[0]){
|
|
hit = 1;
|
|
for (j = 1, k = i+1; j < seek.size; ++j, ++k){
|
|
a_upper = char_to_upper(str.str[k]);
|
|
b_upper = char_to_upper(seek.str[j]);
|
|
if (a_upper != b_upper){
|
|
hit = 0;
|
|
break;
|
|
}
|
|
}
|
|
if (hit){
|
|
return i;
|
|
}
|
|
}
|
|
}
|
|
return str.size;
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
has_substr(char *s, String seek)/* DOC() */{
|
|
return (s[find_substr(s, 0, seek)] != 0);
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
has_substr(String s, String seek)/* DOC() */{
|
|
return (find_substr(s, 0, seek) < s.size);
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
has_substr_insensitive(char *s, String seek)/* DOC() */{
|
|
return (s[find_substr_insensitive(s, 0, seek)] != 0);
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
has_substr_insensitive(String s, String seek)/* DOC() */{
|
|
return (find_substr_insensitive(s, 0, seek) < s.size);
|
|
}
|
|
|
|
//
|
|
// String Copies and Appends
|
|
//
|
|
|
|
FSTRING_LINK int32_t
|
|
copy_fast_unsafe(char *dest, char *src)/* DOC() */{
|
|
char *start = dest;
|
|
while (*src != 0){
|
|
*dest = *src;
|
|
++dest;
|
|
++src;
|
|
}
|
|
return (int)(dest - start);
|
|
}
|
|
|
|
FSTRING_LINK void
|
|
copy_fast_unsafe(char *dest, String src)/* DOC() */{
|
|
int32_t i = 0;
|
|
while (i != src.size){
|
|
dest[i] = src.str[i];
|
|
++i;
|
|
}
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
copy_checked(String *dest, String src)/* DOC() */{
|
|
char *dest_str;
|
|
int32_t i;
|
|
if (dest->memory_size < src.size){
|
|
return 0;
|
|
}
|
|
dest_str = dest->str;
|
|
for (i = 0; i < src.size; ++i){
|
|
dest_str[i] = src.str[i];
|
|
}
|
|
dest->size = src.size;
|
|
return 1;
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
copy_partial(String *dest, char *src)/* DOC() */{
|
|
int32_t i = 0;
|
|
int32_t memory_size = dest->memory_size;
|
|
char *dest_str = dest->str;
|
|
while (src[i] != 0){
|
|
if (i >= memory_size){
|
|
return 0;
|
|
}
|
|
dest_str[i] = src[i];
|
|
++i;
|
|
}
|
|
dest->size = i;
|
|
return 1;
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
copy_partial(String *dest, String src)/* DOC() */{
|
|
fstr_bool result;
|
|
int32_t memory_size = dest->memory_size;
|
|
char *dest_str = dest->str;
|
|
if (memory_size < src.size){
|
|
result = 0;
|
|
for (int32_t i = 0; i < memory_size; ++i){
|
|
dest_str[i] = src.str[i];
|
|
}
|
|
dest->size = memory_size;
|
|
}
|
|
else{
|
|
result = 1;
|
|
for (int32_t i = 0; i < src.size; ++i){
|
|
dest_str[i] = src.str[i];
|
|
}
|
|
dest->size = src.size;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
FSTRING_INLINE int32_t
|
|
copy(char *dest, char *src)/* DOC() */{
|
|
return copy_fast_unsafe(dest, src);
|
|
}
|
|
|
|
FSTRING_INLINE void
|
|
copy(String *dest, String src)/* DOC() */{
|
|
copy_checked(dest, src);
|
|
}
|
|
|
|
FSTRING_INLINE void
|
|
copy(String *dest, char *src)/* DOC() */{
|
|
copy_partial(dest, src);
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
append_checked(String *dest, String src)/* DOC() */{
|
|
String end;
|
|
end = tailstr(*dest);
|
|
fstr_bool result = copy_checked(&end, src);
|
|
// NOTE(allen): This depends on end.size still being 0 if
|
|
// the check failed and no coppy occurred.
|
|
dest->size += end.size;
|
|
return result;
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
append_partial(String *dest, char *src)/* DOC() */{
|
|
String end = tailstr(*dest);
|
|
fstr_bool result = copy_partial(&end, src);
|
|
dest->size += end.size;
|
|
return result;
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
append_partial(String *dest, String src)/* DOC() */{
|
|
String end = tailstr(*dest);
|
|
fstr_bool result = copy_partial(&end, src);
|
|
dest->size += end.size;
|
|
return result;
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
append(String *dest, char c)/* DOC() */{
|
|
fstr_bool result = 0;
|
|
if (dest->size < dest->memory_size){
|
|
dest->str[dest->size++] = c;
|
|
result = 1;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
append(String *dest, String src)/* DOC() */{
|
|
return append_partial(dest, src);
|
|
}
|
|
|
|
FSTRING_INLINE fstr_bool
|
|
append(String *dest, char *src)/* DOC() */{
|
|
return append_partial(dest, src);
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool terminate_with_null(String *str)/* DOC() */{
|
|
fstr_bool result = 0;
|
|
if (str->size < str->memory_size){
|
|
str->str[str->size] = 0;
|
|
result = 1;
|
|
}
|
|
return(result);
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
append_padding(String *dest, char c, int32_t target_size)/* DOC() */{
|
|
fstr_bool result = 1;
|
|
int32_t offset = target_size - dest->size;
|
|
int32_t r;
|
|
if (offset > 0){
|
|
for (r = 0; r < offset; ++r){
|
|
if (append(dest, c) == 0){
|
|
result = 0;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
return(result);
|
|
}
|
|
|
|
|
|
//
|
|
// Other Edits
|
|
//
|
|
|
|
FSTRING_LINK void
|
|
replace_char(String *str, char replace, char with){
|
|
char *s = str->str;
|
|
int32_t i;
|
|
|
|
for (i = 0; i < str->size; ++i, ++s){
|
|
if (*s == replace) *s = with;
|
|
}
|
|
}
|
|
|
|
//
|
|
// String <-> Number Conversions
|
|
//
|
|
|
|
FSTRING_LINK int32_t
|
|
int_to_str_size(int32_t x)/* DOC() */{
|
|
int32_t size = 1;
|
|
if (x < 0){
|
|
size = 2;
|
|
}
|
|
x /= 10;
|
|
while (x != 0){
|
|
x /= 10;
|
|
++size;
|
|
}
|
|
return(size);
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
int_to_str(String *dest, int32_t x)/* DOC() */{
|
|
fstr_bool result = 1;
|
|
char *str = dest->str;
|
|
int32_t memory_size = dest->memory_size;
|
|
int32_t size, i, j;
|
|
fstr_bool negative;
|
|
|
|
if (x == 0){
|
|
str[0] = '0';
|
|
dest->size = 1;
|
|
}
|
|
else{
|
|
size = 0;
|
|
negative = 0;
|
|
if (x < 0){
|
|
negative = 1;
|
|
x = -x;
|
|
str[size++] = '-';
|
|
}
|
|
while (x != 0){
|
|
if (size == memory_size){
|
|
result = 0;
|
|
break;
|
|
}
|
|
i = x % 10;
|
|
x /= 10;
|
|
str[size++] = (char)('0' + i);
|
|
}
|
|
if (result){
|
|
// NOTE(allen): Start i = 0 if not negative, start i = 1 if is negative
|
|
// because - should not be flipped if it is negative :)
|
|
for (i = negative, j = size-1; i < j; ++i, --j){
|
|
char temp = str[i];
|
|
str[i] = str[j];
|
|
str[j] = temp;
|
|
}
|
|
dest->size = size;
|
|
}
|
|
else{
|
|
dest->size = 0;
|
|
}
|
|
}
|
|
return(result);
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
append_int_to_str(String *dest, int32_t x)/* DOC() */{
|
|
String last_part = tailstr(*dest);
|
|
fstr_bool result = int_to_str(&last_part, x);
|
|
if (result){
|
|
dest->size += last_part.size;
|
|
}
|
|
return(result);
|
|
}
|
|
|
|
FSTRING_LINK int32_t
|
|
u64_to_str_size(uint64_t x)/* DOC() */{
|
|
int32_t size;
|
|
if (x < 0){
|
|
size = 0;
|
|
}
|
|
else{
|
|
size = 1;
|
|
x /= 10;
|
|
while (x != 0){
|
|
x /= 10;
|
|
++size;
|
|
}
|
|
}
|
|
return(size);
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
u64_to_str(String *dest, uint64_t x)/* DOC() */{
|
|
fstr_bool result = 1;
|
|
char *str = dest->str;
|
|
int32_t memory_size = dest->memory_size;
|
|
int32_t size, i, j;
|
|
|
|
if (x == 0){
|
|
str[0] = '0';
|
|
dest->size = 1;
|
|
}
|
|
else{
|
|
size = 0;
|
|
while (x != 0){
|
|
if (size == memory_size){
|
|
result = 0;
|
|
break;
|
|
}
|
|
i = x % 10;
|
|
x /= 10;
|
|
str[size++] = (char)('0' + i);
|
|
}
|
|
if (result){
|
|
for (i = 0, j = size-1; i < j; ++i, --j){
|
|
char temp = str[i];
|
|
str[i] = str[j];
|
|
str[j] = temp;
|
|
}
|
|
dest->size = size;
|
|
}
|
|
else{
|
|
dest->size = 0;
|
|
}
|
|
}
|
|
return(result);
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
append_u64_to_str(String *dest, uint64_t x)/* DOC() */{
|
|
String last_part = tailstr(*dest);
|
|
fstr_bool result = u64_to_str(&last_part, x);
|
|
if (result){
|
|
dest->size += last_part.size;
|
|
}
|
|
return(result);
|
|
}
|
|
|
|
#ifndef FSTRING_GUARD
|
|
struct Float_To_Str_Variables{
|
|
fstr_bool negative;
|
|
int32_t int_part;
|
|
int32_t dec_part;
|
|
};
|
|
|
|
Float_To_Str_Variables
|
|
get_float_vars(float x){
|
|
Float_To_Str_Variables vars = {0};
|
|
|
|
if (x < 0){
|
|
vars.negative = true;
|
|
x = -x;
|
|
}
|
|
|
|
vars.int_part = (int32_t)(x);
|
|
vars.dec_part = (int32_t)((x - vars.int_part) * 1000);
|
|
|
|
return(vars);
|
|
}
|
|
#endif
|
|
|
|
FSTRING_LINK int32_t
|
|
float_to_str_size(float x)/* DOC() */{
|
|
Float_To_Str_Variables vars = get_float_vars(x);
|
|
int32_t size =
|
|
vars.negative + int_to_str_size(vars.int_part) + 1 + int_to_str_size(vars.dec_part);
|
|
return(size);
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
append_float_to_str(String *dest, float x)/* DOC() */{
|
|
fstr_bool result = 1;
|
|
Float_To_Str_Variables vars = get_float_vars(x);
|
|
|
|
if (vars.negative){
|
|
append(dest, '-');
|
|
}
|
|
|
|
append_int_to_str(dest, vars.int_part);
|
|
append(dest, '.');
|
|
append_int_to_str(dest, vars.dec_part);
|
|
|
|
return(result);
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
float_to_str(String *dest, float x)/* DOC() */{
|
|
fstr_bool result = 1;
|
|
dest->size = 0;
|
|
append_float_to_str(dest, x);
|
|
return(result);
|
|
}
|
|
|
|
FSTRING_LINK int32_t
|
|
str_to_int(char *str)/* DOC() */{
|
|
int32_t x = 0;
|
|
for (; *str; ++str){
|
|
if (*str >= '0' || *str <= '9'){
|
|
x *= 10;
|
|
x += *str - '0';
|
|
}
|
|
else{
|
|
x = 0;
|
|
break;
|
|
}
|
|
}
|
|
return(x);
|
|
}
|
|
|
|
FSTRING_LINK int32_t
|
|
str_to_int(String str)/* DOC() */{
|
|
int32_t x, i;
|
|
if (str.size == 0){
|
|
x = 0;
|
|
}
|
|
else{
|
|
x = str.str[0] - '0';
|
|
for (i = 1; i < str.size; ++i){
|
|
x *= 10;
|
|
x += str.str[i] - '0';
|
|
}
|
|
}
|
|
return(x);
|
|
}
|
|
|
|
FSTRING_LINK int32_t
|
|
hexchar_to_int(char c)/* DOC() */{
|
|
int32_t x;
|
|
if (c >= '0' && c <= '9'){
|
|
x = c-'0';
|
|
}
|
|
else if (c > 'F'){
|
|
x = c+(10-'a');
|
|
}
|
|
else{
|
|
x = c+(10-'A');
|
|
}
|
|
return(x);
|
|
}
|
|
|
|
FSTRING_LINK char
|
|
int_to_hexchar(int32_t x)/* DOC() */{
|
|
return (x<10)?((char)x+'0'):((char)x+'a'-10);
|
|
}
|
|
|
|
FSTRING_LINK uint32_t
|
|
hexstr_to_int(String str)/* DOC() */{
|
|
uint32_t x;
|
|
int32_t i;
|
|
if (str.size == 0){
|
|
x = 0;
|
|
}
|
|
else{
|
|
x = hexchar_to_int(str.str[0]);
|
|
for (i = 1; i < str.size; ++i){
|
|
x *= 0x10;
|
|
x += hexchar_to_int(str.str[i]);
|
|
}
|
|
}
|
|
return(x);
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
color_to_hexstr(String *s, uint32_t color)/* DOC() */{
|
|
fstr_bool result = 0;
|
|
int32_t i;
|
|
|
|
if (s->memory_size == 7 || s->memory_size == 8){
|
|
result = 1;
|
|
s->size = 6;
|
|
s->str[6] = 0;
|
|
color = color & 0x00FFFFFF;
|
|
for (i = 5; i >= 0; --i){
|
|
s->str[i] = int_to_hexchar(color & 0xF);
|
|
color >>= 4;
|
|
}
|
|
}
|
|
else if (s->memory_size > 8){
|
|
result = 1;
|
|
s->size = 8;
|
|
s->str[8] = 0;
|
|
for (i = 7; i >= 0; --i){
|
|
s->str[i] = int_to_hexchar(color & 0xF);
|
|
color >>= 4;
|
|
}
|
|
}
|
|
return(result);
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
hexstr_to_color(String s, uint32_t *out)/* DOC() */{
|
|
fstr_bool result = 0;
|
|
uint32_t color = 0;
|
|
if (s.size == 6){
|
|
result = 1;
|
|
color = (unsigned int)hexstr_to_int(s);
|
|
color |= (0xFF << 24);
|
|
*out = color;
|
|
}
|
|
else if (s.size == 8){
|
|
result = 1;
|
|
color = (unsigned int)hexstr_to_int(s);
|
|
*out = color;
|
|
}
|
|
return(result);
|
|
}
|
|
|
|
//
|
|
// Directory String Management
|
|
//
|
|
|
|
FSTRING_LINK int32_t
|
|
reverse_seek_slash(String str, int32_t pos)/* DOC() */{
|
|
int32_t i = str.size - 1 - pos;
|
|
while (i >= 0 && char_not_slash(str.str[i])){
|
|
--i;
|
|
}
|
|
return i;
|
|
}
|
|
|
|
FSTRING_INLINE int32_t
|
|
reverse_seek_slash(String str)/* DOC() */{
|
|
return(reverse_seek_slash(str, 0));
|
|
}
|
|
|
|
FSTRING_INLINE String
|
|
front_of_directory(String dir)/* DOC() */{
|
|
return substr(dir, reverse_seek_slash(dir) + 1);
|
|
}
|
|
|
|
FSTRING_INLINE String
|
|
path_of_directory(String dir)/* DOC() */{
|
|
return substr(dir, 0, reverse_seek_slash(dir) + 1);
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
set_last_folder(String *dir, char *folder_name, char slash)/* DOC() */{
|
|
char str[2];
|
|
fstr_bool result = 0;
|
|
int32_t size = reverse_seek_slash(*dir) + 1;
|
|
dir->size = size;
|
|
str[0] = slash;
|
|
str[1] = 0;
|
|
if (append(dir, folder_name)){
|
|
if (append(dir, str)){
|
|
result = 1;
|
|
}
|
|
}
|
|
if (!result){
|
|
dir->size = size;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
set_last_folder(String *dir, String folder_name, char slash)/* DOC() */{
|
|
char str[2];
|
|
fstr_bool result = 0;
|
|
int32_t size = reverse_seek_slash(*dir) + 1;
|
|
dir->size = size;
|
|
str[0] = slash;
|
|
str[1] = 0;
|
|
if (append(dir, folder_name)){
|
|
if (append(dir, str)){
|
|
result = 1;
|
|
}
|
|
}
|
|
if (!result){
|
|
dir->size = size;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
FSTRING_LINK String
|
|
file_extension(String str)/* DOC() */{
|
|
int32_t i;
|
|
for (i = str.size - 1; i >= 0; --i){
|
|
if (str.str[i] == '.') break;
|
|
}
|
|
++i;
|
|
return make_string(str.str+i, str.size-i);
|
|
}
|
|
|
|
FSTRING_LINK fstr_bool
|
|
remove_last_folder(String *str)/* DOC() */{
|
|
fstr_bool result = 0;
|
|
int32_t end = reverse_seek_slash(*str, 1);
|
|
if (end >= 0){
|
|
result = 1;
|
|
str->size = end + 1;
|
|
}
|
|
return(result);
|
|
}
|
|
|
|
// TODO(allen): Add hash-table extension to string sets.
|
|
FSTRING_LINK fstr_bool
|
|
string_set_match(String *str_set, int32_t count, String str, int32_t *match_index)/* DOC() */{
|
|
fstr_bool result = false;
|
|
int32_t i = 0;
|
|
for (; i < count; ++i, ++str_set){
|
|
if (match(*str_set, str)){
|
|
*match_index = i;
|
|
result = true;
|
|
break;
|
|
}
|
|
}
|
|
return(result);
|
|
}
|
|
|
|
#ifndef FSTRING_EXPERIMENTAL
|
|
#define FSTRING_EXPERIMENTAL
|
|
|
|
// NOTE(allen): experimental section, things below here are
|
|
// not promoted to public API level yet.
|
|
|
|
#ifndef ArrayCount
|
|
# define ArrayCount(a) ((sizeof(a))/sizeof(*a))
|
|
#endif
|
|
|
|
struct Absolutes{
|
|
String a[8];
|
|
int32_t count;
|
|
};
|
|
|
|
static void
|
|
get_absolutes(String name, Absolutes *absolutes, fstr_bool implicit_first, fstr_bool implicit_last){
|
|
int32_t count = 0;
|
|
int32_t max = ArrayCount(absolutes->a) - 1;
|
|
if (implicit_last) --max;
|
|
|
|
String str;
|
|
str.str = name.str;
|
|
str.size = 0;
|
|
str.memory_size = 0;
|
|
fstr_bool prev_was_wild = 0;
|
|
|
|
if (implicit_first){
|
|
absolutes->a[count++] = str;
|
|
prev_was_wild = 1;
|
|
}
|
|
|
|
int32_t i;
|
|
for (i = 0; i < name.size; ++i){
|
|
if (name.str[i] == '*' && count < max){
|
|
if (!prev_was_wild){
|
|
str.memory_size = str.size;
|
|
absolutes->a[count++] = str;
|
|
str.size = 0;
|
|
}
|
|
str.str = name.str + i + 1;
|
|
prev_was_wild = 1;
|
|
}
|
|
else{
|
|
++str.size;
|
|
prev_was_wild = 0;
|
|
}
|
|
}
|
|
|
|
str.memory_size = str.size;
|
|
absolutes->a[count++] = str;
|
|
|
|
if (implicit_last){
|
|
str.size = 0;
|
|
str.memory_size = 0;
|
|
absolutes->a[count++] = str;
|
|
}
|
|
|
|
absolutes->count = count;
|
|
}
|
|
|
|
static fstr_bool
|
|
wildcard_match(Absolutes *absolutes, char *x, int32_t case_sensitive){
|
|
fstr_bool r = 1;
|
|
String *a = absolutes->a;
|
|
|
|
fstr_bool (*match_func)(char*, String);
|
|
fstr_bool (*match_part_func)(char*, String);
|
|
|
|
if (case_sensitive){
|
|
match_func = match;
|
|
match_part_func = match_part;
|
|
}
|
|
else{
|
|
match_func = match_insensitive;
|
|
match_part_func = match_part_insensitive;
|
|
}
|
|
|
|
if (absolutes->count == 1){
|
|
r = match_func(x, *a);
|
|
}
|
|
else{
|
|
if (!match_part_func(x, *a)){
|
|
r = 0;
|
|
}
|
|
else{
|
|
String *max = a + absolutes->count - 1;
|
|
x += a->size;
|
|
++a;
|
|
while (a < max){
|
|
if (*x == 0){
|
|
r = 0;
|
|
break;
|
|
}
|
|
if (match_part_func(x, *a)){
|
|
x += a->size;
|
|
++a;
|
|
}
|
|
else{
|
|
++x;
|
|
}
|
|
}
|
|
if (r && a->size > 0){
|
|
r = 0;
|
|
while (*x != 0){
|
|
if (match_part_func(x, *a) && *(x + a->size) == 0){
|
|
r = 1;
|
|
break;
|
|
}
|
|
else{
|
|
++x;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return r;
|
|
}
|
|
|
|
static fstr_bool
|
|
wildcard_match(Absolutes *absolutes, String x, int32_t case_sensitive){
|
|
terminate_with_null(&x);
|
|
return wildcard_match(absolutes, x.str, case_sensitive);
|
|
}
|
|
|
|
#endif
|
|
|
|
#ifdef FSTRING_IMPLEMENTATION
|
|
#undef FSTRING_IMPLEMENTATION
|
|
#endif
|
|
|
|
#ifndef FSTRING_GUARD
|
|
#define FSTRING_GUARD
|
|
#endif
|
|
|
|
// BOTTOM
|
|
|