AustrianToast/strops
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

new untested code

Browse Source
This commit is contained in:
AustrianToast
2025-05-28 19:32:15 +02:00
parent fec9f2633d
commit 77ccd59ce3
3 changed files with 49 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

40
strops.c
View File

@ -67,7 +67,7 @@ ull_t strops_first_pos_of_char(const char* string, char char_to_search) {
}
ull_t strops_first_pos_of_string(const char* string, const char* string_to_search) {
char contains_string;
bool_t contains_string;
ull_t sts_length = strops_length(string_to_search);
ull_t l = strops_length(string) - sts_length + 1;
ull_t i, j;
@ -86,7 +86,7 @@ ull_t strops_first_pos_of_string(const char* string, const char* string_to_searc
return i;
}
char strops_contains_char(const char* string, char char_to_search) {
bool_t strops_contains_char(const char* string, char char_to_search) {
ull_t i;
for (i = 0; i < strops_length(string) + 1; i++) {
if (string[i] == char_to_search) {
@ -96,8 +96,8 @@ char strops_contains_char(const char* string, char char_to_search) {
return 0;
}
char strops_contains_string(const char* string, const char* string_to_search) {
char contains_string = 0;
bool_t strops_contains_string(const char* string, const char* string_to_search) {
bool_t contains_string = 0;
ull_t sts_length = strops_length(string_to_search);
ull_t l = strops_length(string) - sts_length + 1;
ull_t i, j;
@ -116,6 +116,34 @@ char strops_contains_string(const char* string, const char* string_to_search) {
return contains_string;
}
bool_t strops_equals(const char* string1, const char* string2) {
if (strops_length(string1) != strops_length(string2)) {
return 0;
}
bool_t equal = 1;
ull_t i;
for (i = 0; i < strops_length(string1); i++) {
if (string1[i] != string2[i]) {
equal = 0;
break;
}
}
return equal;
}
bool_t strops_starts_with(const char* string1, const char* string2) {
assert(strops_length(string1) >= strops_length(string2) && "string2 cannot be longer than string1");
bool_t starts_with = 1;
ull_t i;
for (i = 0; i < strops_length(string2); i++) {
if (string1[i] != string2[i]) {
starts_with = 0;
break;
}
}
return starts_with;
}
char* strops_to_lowercase(const char* string) {
char* result = strops_copy(string);
ull_t i;
@ -138,7 +166,7 @@ char* strops_to_uppercase(const char* string) {
return result;
}
int strops_is_lowercase(const char* string) {
bool_t strops_is_lowercase(const char* string) {
ull_t i;
for (i = 0; i < strops_length(string); i++) {
if (!(string[i] >= 'a' && string[i] <= 'z')) {
@ -148,7 +176,7 @@ int strops_is_lowercase(const char* string) {
return 1;
}
int strops_is_uppercase(const char* string) {
bool_t strops_is_uppercase(const char* string) {
ull_t i;
for (i = 0; i < strops_length(string); i++) {
if (!(string[i] >= 'A' && string[i] <= 'Z')) {