|
typedef base_list_type::pointer | pointer |
|
typedef base_list_type::const_pointer | const_pointer |
|
typedef base_list_type::reference | reference |
|
typedef base_list_type::const_reference | const_reference |
|
typedef base_list_type::value_type | value_type |
|
typedef base_list_type::size_type | size_type |
|
typedef base_list_type::difference_type | difference_type |
|
typedef base_list_type::iterator | iterator |
|
typedef base_list_type::const_iterator | const_iterator |
|
typedef base_list_type::reverse_iterator | reverse_iterator |
|
typedef base_list_type::const_reverse_iterator | const_reverse_iterator |
|
| iplist_impl ()=default |
|
| iplist_impl (const iplist_impl &)=delete |
|
| iplist_impl (iplist_impl &&X) |
|
iplist_impl & | operator= (const iplist_impl &)=delete |
|
iplist_impl & | operator= (iplist_impl &&X) |
|
| ~iplist_impl () |
|
size_type | max_size () const |
|
void | swap (iplist_impl &RHS) |
|
iterator | insert (iterator where, pointer New) |
|
iterator | insert (iterator where, const_reference New) |
|
void | insert (iterator where, InIt first, InIt last) |
|
iterator | insertAfter (iterator where, pointer New) |
|
void | cloneFrom (const iplist_impl &L2, Cloner clone) |
| Clone another list.
|
|
pointer | remove (iterator &IT) |
|
pointer | remove (const iterator &IT) |
|
pointer | remove (pointer IT) |
|
pointer | remove (reference IT) |
|
iterator | erase (iterator where) |
|
iterator | erase (pointer IT) |
|
iterator | erase (reference IT) |
|
iterator | erase (iterator first, iterator last) |
|
void | clearAndLeakNodesUnsafely () |
| Remove all nodes from the list like clear(), but do not call removeNodeFromList() or deleteNode().
|
|
void | clear () |
|
void | push_front (pointer val) |
|
void | push_back (pointer val) |
|
void | pop_front () |
|
void | pop_back () |
|
void | splice (iterator where, iplist_impl &L2) |
|
void | splice (iterator where, iplist_impl &L2, iterator first) |
|
void | splice (iterator where, iplist_impl &L2, iterator first, iterator last) |
|
void | splice (iterator where, iplist_impl &L2, reference N) |
|
void | splice (iterator where, iplist_impl &L2, pointer N) |
|
void | merge (iplist_impl &Right, Compare comp) |
|
void | merge (iplist_impl &Right) |
|
pointer | getPrevNode (reference N) const |
| Get the previous node, or nullptr for the list head.
|
|
const_pointer | getPrevNode (const_reference N) const |
| Get the previous node, or nullptr for the list head.
|
|
pointer | getNextNode (reference N) const |
| Get the next node, or nullptr for the list tail.
|
|
const_pointer | getNextNode (const_reference N) const |
| Get the next node, or nullptr for the list tail.
|
|
| SymbolTableListTraits ()=default |
|
void | addNodeToList (T *V) |
|
void | removeNodeFromList (T *V) |
|
void | transferNodesFromList (SymbolTableListTraits &L2, iterator first, iterator last) |
|
void | setSymTabObject (TPtr *, TPtr) |
| setSymTabObject - This is called when (f.e.) the parent of a basic block changes.
|
|
static ValueSymbolTable * | toPtr (ValueSymbolTable *P) |
|
static ValueSymbolTable * | toPtr (ValueSymbolTable &R) |
|
static void | deleteNode (NodeTy *V) |
|
template<class
T, typename... Args>
class llvm::SymbolTableList< T, Args >
List that automatically updates parent links and symbol tables.
When nodes are inserted into and removed from this list, the associated symbol table will be automatically updated. Similarly, parent links get updated automatically.
Definition at line 124 of file SymbolTableListTraits.h.