Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched defs:insert (Results 476 - 500 of 1909) sorted by null

<<11121314151617181920>>

/prebuilts/clang/host/darwin-x86/clang-4479392/include/clang/Rewrite/Core/
RewriteRope.h	55 /// For example, we could have a 1M RopePiece and want to insert something 153 void insert(unsigned Offset, const RopePiece &R); 193 Chunks.insert(0, MakeRopeString(Start, End)); 196 void insert(unsigned Offset, const char *Start, const char *End) { function in class:clang::RewriteRope 197 assert(Offset <= size() && "Invalid position to insert!"); 199 Chunks.insert(Offset, MakeRopeString(Start, End));
/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/
AllocatorList.h	189 return iterator(List.insert(I.wrapped(), *create(std::forward<Ts>(Vs)...))); 192 iterator insert(iterator I, T &&V) { function in class:llvm::AllocatorList 193 return iterator(List.insert(I.wrapped(), *create(std::move(V)))); 195 iterator insert(iterator I, const T &V) { function in class:llvm::AllocatorList 196 return iterator(List.insert(I.wrapped(), *create(V))); 200 void insert(iterator I, Iterator First, Iterator Last) { function in class:llvm::AllocatorList 202 List.insert(I.wrapped(), *create(*First)); 217 void push_back(T &&V) { insert(end(), std::move(V)); } 218 void push_front(T &&V) { insert(begin(), std::move(V)); } 219 void push_back(const T &V) { insert(end(), V);     [all...]
DenseSet.h	71 insert(Elems.begin(), Elems.end()); 187 std::pair<iterator, bool> insert(const ValueT &V) { function in class:llvm::detail::DenseSetImpl 192 std::pair<iterator, bool> insert(ValueT &&V) { function in class:llvm::detail::DenseSetImpl 197 /// Alternative version of insert that uses a different (and possibly less 211 void insert(InputIt I, InputIt E) { function in class:llvm::detail::DenseSetImpl 213 insert(*I);
DepthFirstIterator.h	74 std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); } function in struct:llvm::df_iterator_default_set 76 void insert(IterT Begin, IterT End) { BaseSet::insert(Begin,End); } function in struct:llvm::df_iterator_default_set 103 this->Visited.insert(Node); 111 if (this->Visited.insert(Node).second) 134 if (this->Visited.insert(Next).second) {
MapVector.h	90 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); 107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { function in class:llvm::MapVector 109 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); 119 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) { function in class:llvm::MapVector 122 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
TinyPtrVector.h	302 iterator insert(iterator I, const EltTy &Elt) { function in namespace:llvm 309 assert(!Val.isNull() && "Null value with non-end insert iterator."); 317 return Val.template get<VecTy*>()->insert(I, Elt); 321 iterator insert(iterator I, ItTy From, ItTy To) { function in namespace:llvm 340 return Val.template get<VecTy*>()->insert(begin() + Offset, From, To);
simple_ilist.h	36 /// insert(). These all take values by reference (not by pointer), except for 37 /// the range version of \a insert(). 144 /// Insert a node at the front; never copies. 145 void push_front(reference Node) { insert(begin(), Node); } 147 /// Insert a node at the back; never copies. 148 void push_back(reference Node) { insert(end(), Node); } 159 /// Insert a node by reference; never copies. 160 iterator insert(iterator I, reference Node) { function in class:llvm::simple_ilist 165 /// Insert a range of nodes; never copies. 167 void insert(iterator I, Iterator First, Iterator Last) function in class:llvm::simple_ilist     [all...]
/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Support/
GenericDomTreeConstruction.h	35 // converting the one argument insert calls. 42 std::pair<iterator, bool> insert(NodeRef N) { function in struct:llvm::df_iterator_dom_storage 43 return Storage.insert({N, InfoType()}); 120 if (Visited.insert(VAncestor).second && VInfo.Parent >= LastLinked) {
/prebuilts/clang/host/darwin-x86/clang-4579689/include/clang/Rewrite/Core/
RewriteRope.h	55 /// For example, we could have a 1M RopePiece and want to insert something 153 void insert(unsigned Offset, const RopePiece &R); 193 Chunks.insert(0, MakeRopeString(Start, End)); 196 void insert(unsigned Offset, const char *Start, const char *End) { function in class:clang::RewriteRope 197 assert(Offset <= size() && "Invalid position to insert!"); 199 Chunks.insert(Offset, MakeRopeString(Start, End));
/prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/
AllocatorList.h	189 return iterator(List.insert(I.wrapped(), *create(std::forward<Ts>(Vs)...))); 192 iterator insert(iterator I, T &&V) { function in class:llvm::AllocatorList 193 return iterator(List.insert(I.wrapped(), *create(std::move(V)))); 195 iterator insert(iterator I, const T &V) { function in class:llvm::AllocatorList 196 return iterator(List.insert(I.wrapped(), *create(V))); 200 void insert(iterator I, Iterator First, Iterator Last) { function in class:llvm::AllocatorList 202 List.insert(I.wrapped(), *create(*First)); 217 void push_back(T &&V) { insert(end(), std::move(V)); } 218 void push_front(T &&V) { insert(begin(), std::move(V)); } 219 void push_back(const T &V) { insert(end(), V);     [all...]
DenseSet.h	71 insert(Elems.begin(), Elems.end()); 187 std::pair<iterator, bool> insert(const ValueT &V) { function in class:llvm::detail::DenseSetImpl 192 std::pair<iterator, bool> insert(ValueT &&V) { function in class:llvm::detail::DenseSetImpl 197 /// Alternative version of insert that uses a different (and possibly less 211 void insert(InputIt I, InputIt E) { function in class:llvm::detail::DenseSetImpl 213 insert(*I);
DepthFirstIterator.h	74 std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); } function in struct:llvm::df_iterator_default_set 76 void insert(IterT Begin, IterT End) { BaseSet::insert(Begin,End); } function in struct:llvm::df_iterator_default_set 103 this->Visited.insert(Node); 111 if (this->Visited.insert(Node).second) 134 if (this->Visited.insert(Next).second) {
MapVector.h	90 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); 107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { function in class:llvm::MapVector 109 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); 119 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) { function in class:llvm::MapVector 122 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
TinyPtrVector.h	302 iterator insert(iterator I, const EltTy &Elt) { function in namespace:llvm 309 assert(!Val.isNull() && "Null value with non-end insert iterator."); 317 return Val.template get<VecTy*>()->insert(I, Elt); 321 iterator insert(iterator I, ItTy From, ItTy To) { function in namespace:llvm 340 return Val.template get<VecTy*>()->insert(begin() + Offset, From, To);
simple_ilist.h	36 /// insert(). These all take values by reference (not by pointer), except for 37 /// the range version of \a insert(). 144 /// Insert a node at the front; never copies. 145 void push_front(reference Node) { insert(begin(), Node); } 147 /// Insert a node at the back; never copies. 148 void push_back(reference Node) { insert(end(), Node); } 159 /// Insert a node by reference; never copies. 160 iterator insert(iterator I, reference Node) { function in class:llvm::simple_ilist 165 /// Insert a range of nodes; never copies. 167 void insert(iterator I, Iterator First, Iterator Last) function in class:llvm::simple_ilist     [all...]
/prebuilts/clang/host/darwin-x86/clang-4630689/include/clang/Rewrite/Core/
RewriteRope.h	55 /// For example, we could have a 1M RopePiece and want to insert something 153 void insert(unsigned Offset, const RopePiece &R); 193 Chunks.insert(0, MakeRopeString(Start, End)); 196 void insert(unsigned Offset, const char *Start, const char *End) { function in class:clang::RewriteRope 197 assert(Offset <= size() && "Invalid position to insert!"); 199 Chunks.insert(Offset, MakeRopeString(Start, End));
/prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/
AllocatorList.h	189 return iterator(List.insert(I.wrapped(), *create(std::forward<Ts>(Vs)...))); 192 iterator insert(iterator I, T &&V) { function in class:llvm::AllocatorList 193 return iterator(List.insert(I.wrapped(), *create(std::move(V)))); 195 iterator insert(iterator I, const T &V) { function in class:llvm::AllocatorList 196 return iterator(List.insert(I.wrapped(), *create(V))); 200 void insert(iterator I, Iterator First, Iterator Last) { function in class:llvm::AllocatorList 202 List.insert(I.wrapped(), *create(*First)); 217 void push_back(T &&V) { insert(end(), std::move(V)); } 218 void push_front(T &&V) { insert(begin(), std::move(V)); } 219 void push_back(const T &V) { insert(end(), V);     [all...]
DenseSet.h	71 insert(Elems.begin(), Elems.end()); 187 std::pair<iterator, bool> insert(const ValueT &V) { function in class:llvm::detail::DenseSetImpl 192 std::pair<iterator, bool> insert(ValueT &&V) { function in class:llvm::detail::DenseSetImpl 197 /// Alternative version of insert that uses a different (and possibly less 211 void insert(InputIt I, InputIt E) { function in class:llvm::detail::DenseSetImpl 213 insert(*I);
DepthFirstIterator.h	74 std::pair<iterator,bool> insert(NodeRef N) { return BaseSet::insert(N); } function in struct:llvm::df_iterator_default_set 76 void insert(IterT Begin, IterT End) { BaseSet::insert(Begin,End); } function in struct:llvm::df_iterator_default_set 103 this->Visited.insert(Node); 111 if (this->Visited.insert(Node).second) 134 if (this->Visited.insert(Next).second) {
MapVector.h	90 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); 107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { function in class:llvm::MapVector 109 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair); 119 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) { function in class:llvm::MapVector 122 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
TinyPtrVector.h	302 iterator insert(iterator I, const EltTy &Elt) { function in namespace:llvm 309 assert(!Val.isNull() && "Null value with non-end insert iterator."); 317 return Val.template get<VecTy*>()->insert(I, Elt); 321 iterator insert(iterator I, ItTy From, ItTy To) { function in namespace:llvm 340 return Val.template get<VecTy*>()->insert(begin() + Offset, From, To);
simple_ilist.h	36 /// insert(). These all take values by reference (not by pointer), except for 37 /// the range version of \a insert(). 144 /// Insert a node at the front; never copies. 145 void push_front(reference Node) { insert(begin(), Node); } 147 /// Insert a node at the back; never copies. 148 void push_back(reference Node) { insert(end(), Node); } 159 /// Insert a node by reference; never copies. 160 iterator insert(iterator I, reference Node) { function in class:llvm::simple_ilist 165 /// Insert a range of nodes; never copies. 167 void insert(iterator I, Iterator First, Iterator Last) function in class:llvm::simple_ilist     [all...]
/prebuilts/clang/host/darwin-x86/clang-4639204/include/clang/Rewrite/Core/
RewriteRope.h	55 /// For example, we could have a 1M RopePiece and want to insert something 153 void insert(unsigned Offset, const RopePiece &R); 193 Chunks.insert(0, MakeRopeString(Start, End)); 196 void insert(unsigned Offset, const char *Start, const char *End) { function in class:clang::RewriteRope 197 assert(Offset <= size() && "Invalid position to insert!"); 199 Chunks.insert(Offset, MakeRopeString(Start, End));
/prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/
AllocatorList.h	189 return iterator(List.insert(I.wrapped(), *create(std::forward<Ts>(Vs)...))); 192 iterator insert(iterator I, T &&V) { function in class:llvm::AllocatorList 193 return iterator(List.insert(I.wrapped(), *create(std::move(V)))); 195 iterator insert(iterator I, const T &V) { function in class:llvm::AllocatorList 196 return iterator(List.insert(I.wrapped(), *create(V))); 200 void insert(iterator I, Iterator First, Iterator Last) { function in class:llvm::AllocatorList 202 List.insert(I.wrapped(), *create(*First)); 217 void push_back(T &&V) { insert(end(), std::move(V)); } 218 void push_front(T &&V) { insert(begin(), std::move(V)); } 219 void push_back(const T &V) { insert(end(), V);     [all...]
DenseSet.h	71 insert(Elems.begin(), Elems.end()); 187 std::pair<iterator, bool> insert(const ValueT &V) { function in class:llvm::detail::DenseSetImpl 192 std::pair<iterator, bool> insert(ValueT &&V) { function in class:llvm::detail::DenseSetImpl 197 /// Alternative version of insert that uses a different (and possibly less 211 void insert(InputIt I, InputIt E) { function in class:llvm::detail::DenseSetImpl 213 insert(*I);

Completed in 665 milliseconds

<<11121314151617181920>>