diff options
Diffstat (limited to 'docs/cdeq_api.md')
| -rw-r--r-- | docs/cdeq_api.md | 19 |
1 files changed, 10 insertions, 9 deletions
diff --git a/docs/cdeq_api.md b/docs/cdeq_api.md index de385d8b..486a5758 100644 --- a/docs/cdeq_api.md +++ b/docs/cdeq_api.md @@ -17,7 +17,7 @@ See the c++ class [std::deque](https://en.cppreference.com/w/cpp/container/deque #define i_valdel // destroy value func - defaults to empty destruct #include <stc/cdeq.h> ``` -`X` should be replaced by the value of ***i_tag*** in all of the following documentation. +`X` should be replaced by the value of `i_tag` in all of the following documentation. ## Methods @@ -27,6 +27,7 @@ cdeq_X cdeq_X_with_capacity(size_t size); cdeq_X cdeq_X_clone(cdeq_X deq); void cdeq_X_clear(cdeq_X* self); +void cdeq_X_copy(cdeq_X* self, cdeq_X other); void cdeq_X_shrink_to_fit(cdeq_X* self); void cdeq_X_reserve(cdeq_X* self, size_t cap); void cdeq_X_swap(cdeq_X* a, cdeq_X* b); @@ -42,20 +43,20 @@ cdeq_X_value_t* cdeq_X_front(const cdeq_X* self); cdeq_X_value_t* cdeq_X_back(const cdeq_X* self); void cdeq_X_push_front(cdeq_X* self, Value value); -void cdeq_X_emplace_front(cdeq_X* self, RawValue raw); +void cdeq_X_emplace_front(cdeq_X* self, i_valraw raw); void cdeq_X_pop_front(cdeq_X* self); void cdeq_X_push_back(cdeq_X* self, Value value); -void cdeq_X_emplace_back(cdeq_X* self, RawValue raw); +void cdeq_X_emplace_back(cdeq_X* self, i_valraw raw); void cdeq_X_pop_back(cdeq_X* self); cdeq_X_iter_t cdeq_X_insert(cdeq_X* self, size_t idx, Value value); // move value cdeq_X_iter_t cdeq_X_insert_n(cdeq_X* self, size_t idx, const Value[] arr, size_t n); // move arr values cdeq_X_iter_t cdeq_X_insert_at(cdeq_X* self, cdeq_X_iter_t it, Value value); // move value -cdeq_X_iter_t cdeq_X_emplace(cdeq_X* self, size_t idx, RawValue raw); -cdeq_X_iter_t cdeq_X_emplace_n(cdeq_X* self, size_t idx, const RawValue[] arr, size_t n); -cdeq_X_iter_t cdeq_X_emplace_at(cdeq_X* self, cdeq_X_iter_t it, RawValue raw); +cdeq_X_iter_t cdeq_X_emplace(cdeq_X* self, size_t idx, i_valraw raw); +cdeq_X_iter_t cdeq_X_emplace_n(cdeq_X* self, size_t idx, const i_valraw[] arr, size_t n); +cdeq_X_iter_t cdeq_X_emplace_at(cdeq_X* self, cdeq_X_iter_t it, i_valraw raw); cdeq_X_iter_t cdeq_X_emplace_range(cdeq_X* self, cdeq_X_iter_t it, cdeq_X_iter_t it1, cdeq_X_iter_t it2); // will clone cdeq_X_iter_t cdeq_X_emplace_range_p(cdeq_X* self, Value* pos, @@ -66,9 +67,9 @@ cdeq_X_iter_t cdeq_X_erase_n(cdeq_X* self, size_t idx, size_t n); cdeq_X_iter_t cdeq_X_erase_at(cdeq_X* self, cdeq_X_iter_t it); cdeq_X_iter_t cdeq_X_erase_range(cdeq_X* self, cdeq_X_iter_t it1, cdeq_X_iter_t it2); -cdeq_X_iter_t cdeq_X_find(const cdeq_X* self, RawValue raw); -cdeq_X_iter_t cdeq_X_find_in(cdeq_X_iter_t i1, cdeq_X_iter_t i2, RawValue raw); -cdeq_X_value_t* cdeq_X_get(const cdeq_X* self, RawValue raw); // returns NULL if not found +cdeq_X_iter_t cdeq_X_find(const cdeq_X* self, i_valraw raw); +cdeq_X_iter_t cdeq_X_find_in(cdeq_X_iter_t i1, cdeq_X_iter_t i2, i_valraw raw); +cdeq_X_value_t* cdeq_X_get(const cdeq_X* self, i_valraw raw); // returns NULL if not found void cdeq_X_sort(cdeq_X* self); void cdeq_X_sort_range(cdeq_X_iter_t i1, cdeq_X_iter_t i2, |