|
using | Ptr = std::unique_ptr< ConceptDef > |
|
using | Vec = std::vector< Ptr > |
|
using | iterator = typename Vec::iterator |
|
using | const_iterator = typename Vec::const_iterator |
|
using | reverse_iterator = typename Vec::reverse_iterator |
|
using | const_reverse_iterator = typename Vec::const_reverse_iterator |
|
const ConceptDef * | find (const std::string &key) const |
| Find an object given the key. More...
|
|
const ConceptDef * | find (const QCString &key) const |
| Find an object given the key. More...
|
|
const ConceptDef * | find (const char *key) const |
| Find an object given the key. More...
|
|
ConceptDef * | find (const char *key) |
| A non-const wrapper for find() const.
|
|
ConceptDef * | find (const QCString &key) |
| A non-const wrapper for find() const.
|
|
ConceptDef * | find (const std::string &key) |
| A non-const wrapper for find() const.
|
|
ConceptDef * | add (const char *k, Args &&... args) |
| Adds a new object to the ordered vector if it was not added already. More...
|
|
ConceptDef * | add (const QCString &k, Args &&... args) |
|
ConceptDef * | add (const char *k, Ptr &&ptr) |
| Adds an existing object to the ordered vector (unless another object was already added under the same key). More...
|
|
ConceptDef * | add (const QCString &k, Ptr &&ptr) |
|
ConceptDef * | prepend (const char *k, Args &&... args) |
| Prepends a new object to the ordered vector if it was not added already. More...
|
|
ConceptDef * | prepend (const QCString &key, Args &&... args) |
|
bool | del (const QCString &key) |
| Removes an object from the container and deletes it. More...
|
|
Ptr & | operator[] (size_t pos) |
|
const Ptr & | operator[] (size_t pos) const |
|
iterator | begin () |
|
const_iterator | begin () const |
|
iterator | end () |
|
const_iterator | end () const |
|
reverse_iterator | rbegin () |
|
const_reverse_iterator | rbegin () const |
|
reverse_iterator | rend () |
|
const_reverse_iterator | rend () const |
|
bool | empty () const |
|
size_t | size () const |
|
void | clear () |
|