Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched defs:insert (Results 801 - 825 of 1909) sorted by null

<<31323334353637383940>>

/prebuilts/clang/host/linux-x86/clang-4630689/include/clang/AST/
ASTVector.h	216 iterator insert(const ASTContext &C, iterator I, const T &Elt) { function in class:clang::ASTVector 237 iterator insert(const ASTContext &C, iterator I, size_type NumToInsert, function in class:clang::ASTVector 280 // Insert the non-overwritten middle part. 286 iterator insert(const ASTContext &C, iterator I, ItTy From, ItTy To) { function in class:clang::ASTVector 333 // Insert the non-overwritten middle part.
/prebuilts/clang/host/linux-x86/clang-4630689/include/clang/Analysis/Support/
BumpVector.h	165 /// insert - Insert some number of copies of element into a position. Return 167 iterator insert(iterator I, size_t Cnt, const_reference E, function in class:clang::BumpVector
/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/
EquivalenceClasses.h	27 /// supports three efficient operations: insert an element into a class of its 40 /// EC.unionSets(1, 2); // insert 1, 2 into the same set 41 /// EC.insert(4); EC.insert(5); // insert 4, 5 into own sets 133 member_iterator LeaderIt = member_begin(insert(*MI)); 135 unionSets(LeaderIt, member_begin(insert(*MI))); 181 member_iterator MI = findLeader(insert(V)); 198 /// insert - Insert a new value into the union/find set, ignoring the reques 200 iterator insert(const ElemTy &Data) { function in class:llvm::EquivalenceClasses     [all...]
ScopedHashTable.h	17 // HT.insert(0, 0); 18 // HT.insert(1, 1); 21 // HT.insert(0, 42); 195 void insert(const K &Key, const V &Val) { function in class:llvm::ScopedHashTable 214 /// (possibly not the current) scope. While it is ok to insert into a scope 215 /// that isn't the current one, it isn't ok to insert *underneath* an existing
/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/CodeGen/GlobalISel/
RegBankSelect.h	110 /// before we actually need to insert something. 113 /// Tell if the insert point has already been materialized. 147 /// MachineBasicBlock::insert. I.e., additional code happens 166 /// MachineBasicBlock::insert and ::getPoint. The new code should 179 /// Insert \p MI in the just before ::getPoint() 180 MachineBasicBlock::iterator insert(MachineInstr &MI) { function in class:llvm::RegBankSelect::InsertPoint 181 return getInsertMBB().insert(getPoint(), &MI); 257 // If we try to insert before phis, we should use the insertion 261 // If we try to insert after the terminators, we should use the 321 Insert,     [all...]
/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/MC/
MCInst.h	197 iterator insert(iterator I, const MCOperand &Op) { function in class:llvm::MCInst 198 return Operands.insert(I, Op);
/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/XRay/
Graph.h	393 InNeighbors[I.second].insert(I.first); 394 OutNeighbors[I.first].insert(I.second); 449 insert(const std::pair<VertexIdentifier, VertexAttribute> &Val) { function in class:llvm::xray::Graph 450 return Vertices.insert(Val); 454 insert(std::pair<VertexIdentifier, VertexAttribute> &&Val) { function in class:llvm::xray::Graph 455 return Vertices.insert(std::move(Val)); 462 insert(const std::pair<EdgeIdentifier, EdgeAttribute> &Val) { function in class:llvm::xray::Graph 463 const auto &p = Edges.insert(Val); 468 InNeighbors[EI.second].insert(EI.first); 469 OutNeighbors[EI.first].insert(EI.second) 479 insert(std::pair<EdgeIdentifier, EdgeAttribute> &&Val) { function in class:llvm::xray::Graph     [all...]
/prebuilts/clang/host/linux-x86/clang-4639204/include/clang/AST/
ASTVector.h	216 iterator insert(const ASTContext &C, iterator I, const T &Elt) { function in class:clang::ASTVector 237 iterator insert(const ASTContext &C, iterator I, size_type NumToInsert, function in class:clang::ASTVector 280 // Insert the non-overwritten middle part. 286 iterator insert(const ASTContext &C, iterator I, ItTy From, ItTy To) { function in class:clang::ASTVector 333 // Insert the non-overwritten middle part.
/prebuilts/clang/host/linux-x86/clang-4639204/include/clang/Analysis/Support/
BumpVector.h	165 /// insert - Insert some number of copies of element into a position. Return 167 iterator insert(iterator I, size_t Cnt, const_reference E, function in class:clang::BumpVector
/prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/
EquivalenceClasses.h	27 /// supports three efficient operations: insert an element into a class of its 40 /// EC.unionSets(1, 2); // insert 1, 2 into the same set 41 /// EC.insert(4); EC.insert(5); // insert 4, 5 into own sets 133 member_iterator LeaderIt = member_begin(insert(*MI)); 135 unionSets(LeaderIt, member_begin(insert(*MI))); 181 member_iterator MI = findLeader(insert(V)); 198 /// insert - Insert a new value into the union/find set, ignoring the reques 200 iterator insert(const ElemTy &Data) { function in class:llvm::EquivalenceClasses     [all...]
ScopedHashTable.h	17 // HT.insert(0, 0); 18 // HT.insert(1, 1); 21 // HT.insert(0, 42); 195 void insert(const K &Key, const V &Val) { function in class:llvm::ScopedHashTable 214 /// (possibly not the current) scope. While it is ok to insert into a scope 215 /// that isn't the current one, it isn't ok to insert *underneath* an existing
/prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/GlobalISel/
RegBankSelect.h	110 /// before we actually need to insert something. 113 /// Tell if the insert point has already been materialized. 147 /// MachineBasicBlock::insert. I.e., additional code happens 166 /// MachineBasicBlock::insert and ::getPoint. The new code should 179 /// Insert \p MI in the just before ::getPoint() 180 MachineBasicBlock::iterator insert(MachineInstr &MI) { function in class:llvm::RegBankSelect::InsertPoint 181 return getInsertMBB().insert(getPoint(), &MI); 257 // If we try to insert before phis, we should use the insertion 261 // If we try to insert after the terminators, we should use the 321 Insert,     [all...]
/prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/MC/
MCInst.h	197 iterator insert(iterator I, const MCOperand &Op) { function in class:llvm::MCInst 198 return Operands.insert(I, Op);
/prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/XRay/
Graph.h	393 InNeighbors[I.second].insert(I.first); 394 OutNeighbors[I.first].insert(I.second); 449 insert(const std::pair<VertexIdentifier, VertexAttribute> &Val) { function in class:llvm::xray::Graph 450 return Vertices.insert(Val); 454 insert(std::pair<VertexIdentifier, VertexAttribute> &&Val) { function in class:llvm::xray::Graph 455 return Vertices.insert(std::move(Val)); 462 insert(const std::pair<EdgeIdentifier, EdgeAttribute> &Val) { function in class:llvm::xray::Graph 463 const auto &p = Edges.insert(Val); 468 InNeighbors[EI.second].insert(EI.first); 469 OutNeighbors[EI.first].insert(EI.second) 479 insert(std::pair<EdgeIdentifier, EdgeAttribute> &&Val) { function in class:llvm::xray::Graph     [all...]
/prebuilts/clang/host/linux-x86/clang-4691093/include/clang/AST/
ASTVector.h	216 iterator insert(const ASTContext &C, iterator I, const T &Elt) { function in class:clang::ASTVector 237 iterator insert(const ASTContext &C, iterator I, size_type NumToInsert, function in class:clang::ASTVector 280 // Insert the non-overwritten middle part. 286 iterator insert(const ASTContext &C, iterator I, ItTy From, ItTy To) { function in class:clang::ASTVector 333 // Insert the non-overwritten middle part.
/prebuilts/clang/host/linux-x86/clang-4691093/include/clang/Analysis/Support/
BumpVector.h	165 /// insert - Insert some number of copies of element into a position. Return 167 iterator insert(iterator I, size_t Cnt, const_reference E, function in class:clang::BumpVector
/prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/
EquivalenceClasses.h	27 /// supports three efficient operations: insert an element into a class of its 40 /// EC.unionSets(1, 2); // insert 1, 2 into the same set 41 /// EC.insert(4); EC.insert(5); // insert 4, 5 into own sets 133 member_iterator LeaderIt = member_begin(insert(*MI)); 135 unionSets(LeaderIt, member_begin(insert(*MI))); 181 member_iterator MI = findLeader(insert(V)); 198 /// insert - Insert a new value into the union/find set, ignoring the reques 200 iterator insert(const ElemTy &Data) { function in class:llvm::EquivalenceClasses     [all...]
ScopedHashTable.h	17 // HT.insert(0, 0); 18 // HT.insert(1, 1); 21 // HT.insert(0, 42); 195 void insert(const K &Key, const V &Val) { function in class:llvm::ScopedHashTable 214 /// (possibly not the current) scope. While it is ok to insert into a scope 215 /// that isn't the current one, it isn't ok to insert *underneath* an existing
/prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/CodeGen/GlobalISel/
RegBankSelect.h	110 /// before we actually need to insert something. 113 /// Tell if the insert point has already been materialized. 147 /// MachineBasicBlock::insert. I.e., additional code happens 166 /// MachineBasicBlock::insert and ::getPoint. The new code should 179 /// Insert \p MI in the just before ::getPoint() 180 MachineBasicBlock::iterator insert(MachineInstr &MI) { function in class:llvm::RegBankSelect::InsertPoint 181 return getInsertMBB().insert(getPoint(), &MI); 257 // If we try to insert before phis, we should use the insertion 261 // If we try to insert after the terminators, we should use the 321 Insert,     [all...]
/prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/MC/
MCInst.h	197 iterator insert(iterator I, const MCOperand &Op) { function in class:llvm::MCInst 198 return Operands.insert(I, Op);
/prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/XRay/
Graph.h	393 InNeighbors[I.second].insert(I.first); 394 OutNeighbors[I.first].insert(I.second); 449 insert(const std::pair<VertexIdentifier, VertexAttribute> &Val) { function in class:llvm::xray::Graph 450 return Vertices.insert(Val); 454 insert(std::pair<VertexIdentifier, VertexAttribute> &&Val) { function in class:llvm::xray::Graph 455 return Vertices.insert(std::move(Val)); 462 insert(const std::pair<EdgeIdentifier, EdgeAttribute> &Val) { function in class:llvm::xray::Graph 463 const auto &p = Edges.insert(Val); 468 InNeighbors[EI.second].insert(EI.first); 469 OutNeighbors[EI.first].insert(EI.second) 479 insert(std::pair<EdgeIdentifier, EdgeAttribute> &&Val) { function in class:llvm::xray::Graph     [all...]
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/
stl_map.h	303 this->insert(__l.begin(), __l.end()); 469 __i = insert(__i, value_type(__k, mapped_type())); 521 * @brief Attempts to build and insert a std::pair into the %map. 531 * This function attempts to build and insert a (key, value) %pair into 544 * @brief Attempts to build and insert a std::pair into the %map. 578 * @brief Attempts to insert a std::pair into the %map. 587 * This function attempts to insert a (key, value) %pair into the %map. 594 insert(const value_type& __x) function in class:map 602 insert(_Pair&& __x) function in class:map 608 * @brief Attempts to insert a list of std::pairs into the %map 615 insert(std::initializer_list<value_type> __list) function in class:map 644 insert(const_iterator __position, const value_type& __x) function in class:map 655 insert(const_iterator __position, _Pair&& __x) function in class:map 670 insert(_InputIterator __first, _InputIterator __last) function in class:map     [all...]
stl_multimap.h	297 this->insert(__l.begin(), __l.end()); 437 * @brief Build and insert a std::pair into the %multimap. 501 insert(const value_type& __x) function in class:multimap 509 insert(_Pair&& __x) function in class:multimap 535 insert(const_iterator __position, const value_type& __x) function in class:multimap 537 insert(iterator __position, const value_type& __x) 546 insert(const_iterator __position, _Pair&& __x) function in class:multimap 552 * @brief A template function that attempts to insert a range 562 insert(_InputIterator __first, _InputIterator __last) function in class:multimap 567 * @brief Attempts to insert a list of std::pairs into the %multimap 574 insert(initializer_list<value_type> __l) function in class:multimap     [all...]
stl_multiset.h	269 this->insert(__l.begin(), __l.end()); 393 // insert/erase 454 insert(const value_type& __x) function in class:multiset 459 insert(value_type&& __x) function in class:multiset 484 insert(const_iterator __position, const value_type& __x) function in class:multiset 489 insert(const_iterator __position, value_type&& __x) function in class:multiset 494 * @brief A template function that tries to insert a range of elements. 503 insert(_InputIterator __first, _InputIterator __last) function in class:multiset 508 * @brief Attempts to insert a list of elements into the %multiset. 515 insert(initializer_list<value_type> __l function in class:multiset     [all...]
stl_set.h	272 this->insert(__l.begin(), __l.end()); 396 // insert/erase 399 * @brief Attempts to build and insert an element into the %set. 405 * This function attempts to build and insert an element into the %set. 417 * @brief Attempts to insert an element into the %set. 447 * @brief Attempts to insert an element into the %set. 453 * This function attempts to insert an element into the %set. A %set 460 insert(const value_type& __x) function in class:set 469 insert(value_type&& __x) function in class:set 478 * @brief Attempts to insert an element into the %set 497 insert(const_iterator __position, const value_type& __x) function in class:set 502 insert(const_iterator __position, value_type&& __x) function in class:set 517 insert(_InputIterator __first, _InputIterator __last) function in class:set 529 insert(initializer_list<value_type> __l) function in class:set     [all...]

Completed in 1198 milliseconds

<<31323334353637383940>>