| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| 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/linux-x86/clang-4691093/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/linux-x86/clang-4691093/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/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/profile/ |
| set.h | 124 this->insert(__l);
208 insert(const value_type& __x) function in class:__profile::set
211 std::pair<_Base_iterator, bool> __res = _Base::insert(__x);
218 insert(value_type&& __x) function in class:__profile::set
222 = _Base::insert(std::move(__x));
229 insert(const_iterator __position, const value_type& __x) function in class:__profile::set
230 { return iterator(_Base::insert(__position, __x)); }
234 insert(const_iterator __position, value_type&& __x) function in class:__profile::set
235 { return iterator(_Base::insert(__position, std::move(__x))); }
245 insert(_InputIterator __first, _InputIterator __last function in class:__profile::set
250 insert(initializer_list<value_type> __l) function in class:__profile::set
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/profile/ |
| set.h | 124 this->insert(__l);
208 insert(const value_type& __x) function in class:__profile::set
211 std::pair<_Base_iterator, bool> __res = _Base::insert(__x);
218 insert(value_type&& __x) function in class:__profile::set
222 = _Base::insert(std::move(__x));
229 insert(const_iterator __position, const value_type& __x) function in class:__profile::set
230 { return iterator(_Base::insert(__position, __x)); }
234 insert(const_iterator __position, value_type&& __x) function in class:__profile::set
235 { return iterator(_Base::insert(__position, std::move(__x))); }
245 insert(_InputIterator __first, _InputIterator __last function in class:__profile::set
250 insert(initializer_list<value_type> __l) function in class:__profile::set
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| UserList.py | 77 def insert(self, i, item): self.data.insert(i, item) member in class:UserList
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/idlelib/ |
| UndoDelegator.py | 80 def insert(self, index, chars, tags=None): member in class:UndoDelegator
197 if name != "insert" and name != "current":
208 # Undoable insert command
217 # Insert before the final newline
219 text.insert(self.index1, self.chars, self.tags)
225 text.mark_set('insert', self.index1)
226 text.insert(self.index1, self.chars, self.tags)
228 text.see('insert')
232 text.mark_set('insert', self.index1)
235 text.see('insert')
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| test_bisect.py | 44 def insert(self, idx, item): member in class:Range
253 def insert(self, index, item): member in class:TestInsort.test_listDerived.List
254 self.data.insert(index, item)
|
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| UserList.py | 77 def insert(self, i, item): self.data.insert(i, item) member in class:UserList
|
| /prebuilts/gdb/linux-x86/lib/python2.7/idlelib/ |
| UndoDelegator.py | 80 def insert(self, index, chars, tags=None): member in class:UndoDelegator
197 if name != "insert" and name != "current":
208 # Undoable insert command
217 # Insert before the final newline
219 text.insert(self.index1, self.chars, self.tags)
225 text.mark_set('insert', self.index1)
226 text.insert(self.index1, self.chars, self.tags)
228 text.see('insert')
232 text.mark_set('insert', self.index1)
235 text.see('insert')
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| test_bisect.py | 44 def insert(self, idx, item): member in class:Range
253 def insert(self, index, item): member in class:TestInsort.test_listDerived.List
254 self.data.insert(index, item)
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| redblack32.go | 114 // Insert adds key to the tree and associates key with data.
116 // Insert returns the previous data associated with key,
118 // Insert panics if data is nil.
119 func (t *RBTint32) Insert(key int32, data interface{}) interface{} {
121 panic("Cannot insert nil data into tree")
129 newroot, n = n.insert(key, t)
282 func (t *node32) insert(x int32, w *RBTint32) (newroot, newnode *node32) { func
298 new_l, newnode = t.left.insert(x, w)
323 new_r, newnode = t.right.insert(x, w)
|
| /prebuilts/go/darwin-x86/src/regexp/ |
| onepass.go | 123 func (q *queueOnePass) insert(u uint32) { func
320 visitQueue.insert(pc)
372 instQueue.insert(inst.Out)
400 instQueue.insert(inst.Out)
424 instQueue.insert(inst.Out)
432 instQueue.insert(inst.Out)
443 instQueue.insert(uint32(p.Start))
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| redblack32.go | 114 // Insert adds key to the tree and associates key with data.
116 // Insert returns the previous data associated with key,
118 // Insert panics if data is nil.
119 func (t *RBTint32) Insert(key int32, data interface{}) interface{} {
121 panic("Cannot insert nil data into tree")
129 newroot, n = n.insert(key, t)
282 func (t *node32) insert(x int32, w *RBTint32) (newroot, newnode *node32) { func
298 new_l, newnode = t.left.insert(x, w)
323 new_r, newnode = t.right.insert(x, w)
|
| /prebuilts/go/linux-x86/src/regexp/ |
| onepass.go | 123 func (q *queueOnePass) insert(u uint32) { func
320 visitQueue.insert(pc)
372 instQueue.insert(inst.Out)
400 instQueue.insert(inst.Out)
424 instQueue.insert(inst.Out)
432 instQueue.insert(inst.Out)
443 instQueue.insert(uint32(p.Start))
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| UserList.py | 77 def insert(self, i, item): self.data.insert(i, item) member in class:UserList
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/ |
| UndoDelegator.py | 80 def insert(self, index, chars, tags=None): member in class:UndoDelegator
197 if name != "insert" and name != "current":
208 # Undoable insert command
217 # Insert before the final newline
219 text.insert(self.index1, self.chars, self.tags)
225 text.mark_set('insert', self.index1)
226 text.insert(self.index1, self.chars, self.tags)
228 text.see('insert')
232 text.mark_set('insert', self.index1)
235 text.see('insert')
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_bisect.py | 44 def insert(self, idx, item): member in class:Range
253 def insert(self, index, item): member in class:TestInsort.test_listDerived.List
254 self.data.insert(index, item)
|
