|
| | ~graph_chains_t () |
| int hexapi | for_all_chains (chain_visitor_t &cv, int gca_flags) |
| | Visit all chains.
|
| bool | is_locked () const |
| | Are the chains locked?
|
| void | acquire () |
| | Lock the chains.
|
| void hexapi | release () |
| | Unlock the chains.
|
| void | swap (graph_chains_t &r) |
| | qvector (void) |
| | Constructor.
|
| | qvector (const qvector< block_chains_t > &x) |
| | Constructor - creates a new qvector identical to 'x'.
|
| | qvector (qvector< block_chains_t > &&x) noexcept |
| | Move constructor.
|
| | ~qvector (void) |
| | Destructor.
|
| | DEFINE_MEMORY_ALLOCATION_FUNCS () void push_back(const block_chains_t &x) |
| | Append a new element to the end the qvector.
|
| void | push_back (block_chains_t &&x) |
| | Append a new element to the end the qvector with a move semantics.
|
| void | emplace_back (Args &&... args) |
| | Construct and append a new element to the end the qvector with a forwarding semantics.
|
| block_chains_t & | push_back (void) |
| | Append a new empty element to the end of the qvector.
|
| void | pop_back (void) |
| | Remove the last element in the qvector.
|
| size_t | size (void) const |
| | Get the number of elements in the qvector.
|
| bool | empty (void) const |
| | Does the qvector have 0 elements?
|
| const block_chains_t & | operator[] (size_t _idx) const |
| | Allows use of typical c-style array indexing for qvectors.
|
| block_chains_t & | operator[] (size_t _idx) |
| | Allows use of typical c-style array indexing for qvectors.
|
| const block_chains_t & | at (size_t _idx) const |
| | Get element at index '_idx'.
|
| block_chains_t & | at (size_t _idx) |
| | Get element at index '_idx'.
|
| const block_chains_t & | front (void) const |
| | Get the first element in the qvector.
|
| block_chains_t & | front (void) |
| | Get the first element in the qvector.
|
| const block_chains_t & | back (void) const |
| | Get the last element in the qvector.
|
| block_chains_t & | back (void) |
| | Get the last element in the qvector.
|
| void | qclear (void) |
| | Destroy all elements but do not free memory.
|
| void | clear (void) |
| | Destroy all elements and free memory.
|
| qvector< block_chains_t > & | operator= (const qvector< block_chains_t > &x) |
| | Allow assignment of one qvector to another using '='.
|
| qvector< block_chains_t > & | operator= (qvector< block_chains_t > &&x) noexcept |
| | Move assignment operator.
|
| void | resize (size_t _newsize, const block_chains_t &x) |
| | Resize to the given size.
|
| void | resize (size_t _newsize) |
| | Same as resize(size_t, const T &), but extra space is filled with empty elements.
|
| void | resize_noinit (size_t _newsize) |
| void | grow (const block_chains_t &x=block_chains_t()) |
| | Add an element to the end of the qvector, which will be a new T() if x is not given.
|
| size_t | capacity (void) const |
| | Get the number of elements that this qvector can contain - not the same as the number of elements currently in the qvector (size())
|
| void | reserve (size_t cnt) |
| | Increase the capacity of the qvector.
|
| void | truncate (void) |
| | Shrink the capacity down to the current number of elements.
|
| void | swap (qvector< block_chains_t > &r) noexcept |
| | Replace all attributes of this qvector with that of 'r', and vice versa.
|
| block_chains_t * | extract (void) |
| | Empty the qvector and return a pointer to it's contents.
|
| void | inject (block_chains_t *s, size_t len) |
| | Populate the qvector with dynamic memory.
|
| bool | operator== (const qvector< block_chains_t > &r) const |
| | Allow ability to test the equality of two qvectors using '=='.
|
| bool | operator!= (const qvector< block_chains_t > &r) const |
| | Allow ability to test equality of two qvectors using '!='.
|
| iterator | begin (void) |
| | Get an iterator that points to the first element in the qvector.
|
| iterator | end (void) |
| | Get an iterator that points to the end of the qvector (NOT the last element)
|
| const_iterator | begin (void) const |
| | Get a const iterator that points to the first element in the qvector.
|
| const_iterator | end (void) const |
| | Get a const iterator that points to the end of the qvector (NOT the last element)
|
| iterator | insert (iterator it, const block_chains_t &x) |
| | Insert an element into the qvector at a specified position.
|
| iterator | insert (iterator it, block_chains_t &&x) |
| | Insert an element into the qvector with a move semantics.
|
| iterator | insert (iterator it, it2 first, it2 last) |
| | Insert a several elements to the qvector at a specified position.
|
| iterator | erase (iterator it) |
| | Remove an element from the qvector.
|
| iterator | erase (iterator first, iterator last) |
| | Remove a subset of the qvector.
|
| iterator | find (const block_chains_t &x) |
| | Find an element in the qvector.
|
| const_iterator | find (const block_chains_t &x) const |
| | Find an element in the qvector.
|
| ssize_t | index (const block_chains_t &x) const |
| | Find index of the specified value or return -1.
|
| void | add (const block_chains_t &x) |
| | Add an element to the end of the qvector.
|
| void | add (block_chains_t &&x) |
| bool | has (const block_chains_t &x) const |
| | Does the qvector contain x?
|
| bool | add_unique (const block_chains_t &x) |
| | Add an element to the end of the qvector - only if it isn't already present.
|
| bool | del (const block_chains_t &x) |
| | Find an element and remove it.
|
| const char * | dstr (void) const |
