diff options
| author | Tyge Løvset <[email protected]> | 2021-08-19 21:39:29 +0200 |
|---|---|---|
| committer | Tyge Løvset <[email protected]> | 2021-08-19 21:39:29 +0200 |
| commit | d80bf9bb4ef1b5a5a6d4edb550b93b93a75972f4 (patch) | |
| tree | af14e793931681ddfdcc3306ba4d94bc7ff3375c /docs | |
| parent | 168c30c1223ae39536ff0b1d27fc5c3885eb60f2 (diff) | |
| download | STC-modified-d80bf9bb4ef1b5a5a6d4edb550b93b93a75972f4.tar.gz STC-modified-d80bf9bb4ef1b5a5a6d4edb550b93b93a75972f4.zip | |
Maintenance update. Added stc32_rand() to crandom.h, doc fixes and cqueue.h updated to have its own size counter.
Diffstat (limited to 'docs')
| -rw-r--r-- | docs/cset_api.md | 2 | ||||
| -rw-r--r-- | docs/csset_api.md | 2 | ||||
| -rw-r--r-- | docs/cstr_api.md | 5 |
3 files changed, 6 insertions, 3 deletions
diff --git a/docs/cset_api.md b/docs/cset_api.md index 31ff2ac6..2c0f4611 100644 --- a/docs/cset_api.md +++ b/docs/cset_api.md @@ -1,4 +1,4 @@ -# STC [cset](../include/stc/cmap.h): Unordered Set
+# STC [cset](../include/stc/cset.h): Unordered Set
A **cset** is an associative container that contains a set of unique objects of type Key. Search, insertion, and removal have average constant-time complexity. See the c++ class
diff --git a/docs/csset_api.md b/docs/csset_api.md index 058ffd8e..38e9072e 100644 --- a/docs/csset_api.md +++ b/docs/csset_api.md @@ -1,4 +1,4 @@ -# STC [csset](../include/stc/csmap.h): Sorted Set
+# STC [csset](../include/stc/csset.h): Sorted Set
A **csset** is an associative container that contains a sorted set of unique objects of type *Key*. Sorting is done using the key comparison function *keyCompare*. Search, removal, and insertion operations have logarithmic complexity. **csset** is implemented as an AA-tree.
diff --git a/docs/cstr_api.md b/docs/cstr_api.md index 8c3c104f..adf57209 100644 --- a/docs/cstr_api.md +++ b/docs/cstr_api.md @@ -58,7 +58,6 @@ void cstr_replace_all(cstr* self, const char* find, const char* replace) void cstr_erase(cstr* self, size_t pos); void cstr_erase_n(cstr* self, size_t pos, size_t n); -int cstr_compare(const cstr *s1, const cstr *s2); bool cstr_equals(cstr s, const char* str); bool cstr_equals_s(cstr s, cstr s2); size_t cstr_find(cstr s, const char* needle); @@ -92,9 +91,13 @@ Note that all methods with arguments `(..., const char* str, size_t n)`, `n` mus ```c const char* cstr_toraw(const cstr* self); +int cstr_compare_ref(const cstr *s1, const cstr *s2); +bool cstr_equals_ref(const cstr *s1, const cstr *s2); + int c_rawstr_compare(const char** x, const char** y); bool c_rawstr_equals(const char** x, const char** y); uint64_t c_rawstr_hash(const char* const* x, size_t ignored); + int c_strncasecmp(const char* str1, const char* str2, size_t n); char* c_strnstrn(const char* str, const char* needle, size_t slen, size_t nlen); char* c_strncasestrn(const char* str, const char* needle, size_t slen, size_t nlen); |