HomeSort by relevance Sort by last modified time
    Searched defs:insert (Results 1176 - 1200 of 1909) sorted by null

<<41424344454647484950>>

  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Support/
OnDiskHashTable.h 88 /// \brief Insert an item into the appropriate hash bucket.
89 void insert(Bucket *Buckets, size_t Size, Item *E) { function in class:llvm::OnDiskChainedHashTableGenerator
104 insert(NewBuckets, NewSize, E);
114 /// \brief Insert an entry into the table.
115 void insert(typename Info::key_type_ref Key, function in class:llvm::OnDiskChainedHashTableGenerator
118 insert(Key, Data, InfoObj);
121 /// \brief Insert an entry into the table.
124 void insert(typename Info::key_type_ref Key, function in class:llvm::OnDiskChainedHashTableGenerator
129 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj));
  /prebuilts/clang/host/linux-x86/clang-4691093/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h 413 Impl.insert(N);
419 if (N && !static_cast<ExplodedNode*>(N)->isSink()) Impl.insert(N);
430 void insert(const ExplodedNodeSet &S) { function in class:clang::ento::ExplodedNodeSet
435 Impl.insert(S.begin(), S.end());
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/
DenseMap.h 191 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { function in class:llvm::DenseMapBase
198 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) { function in class:llvm::DenseMapBase
213 // Otherwise, insert the new element.
232 // Otherwise, insert the new element.
239 /// Alternate version of insert() which allows a different, and possibly
253 // Otherwise, insert the new element.
261 /// insert - Range insertion of pairs.
263 void insert(InputIt I, InputIt E) { function in class:llvm::DenseMapBase
265 insert(*I);
364 // Insert all the old elements
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/CodeGen/
MachineBasicBlock.h 496 /// This is the correct point to insert lowered copies at the beginning of a
501 /// debug. This is the correct point to insert copies at the beginning of a
553 /// Insert MI into the instruction list before I, possibly inside a bundle.
558 /// MIBundleBuilder::insert() for a more reliable way of doing that.
559 instr_iterator insert(instr_iterator I, MachineInstr *M);
561 /// Insert a range of instructions into the instruction list before I.
563 void insert(iterator I, IT S, IT E) { function in class:llvm::MachineBasicBlock
566 Insts.insert(I.getInstrIterator(), S, E);
569 /// Insert MI into the instruction list before I.
570 iterator insert(iterator I, MachineInstr *MI) function in class:llvm::MachineBasicBlock
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Support/
OnDiskHashTable.h 88 /// \brief Insert an item into the appropriate hash bucket.
89 void insert(Bucket *Buckets, size_t Size, Item *E) { function in class:llvm::OnDiskChainedHashTableGenerator
104 insert(NewBuckets, NewSize, E);
114 /// \brief Insert an entry into the table.
115 void insert(typename Info::key_type_ref Key, function in class:llvm::OnDiskChainedHashTableGenerator
118 insert(Key, Data, InfoObj);
121 /// \brief Insert an entry into the table.
124 void insert(typename Info::key_type_ref Key, function in class:llvm::OnDiskChainedHashTableGenerator
129 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj));
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/
hashtable_policy.h 571 * insert member functions appropriate to all _Hashtables.
601 insert(const value_type& __v) function in struct:__detail::_Insert_base
608 insert(const_iterator, const value_type& __v) function in struct:__detail::_Insert_base
609 { return __iconv_type()(insert(__v)); }
612 insert(initializer_list<value_type> __l) function in struct:__detail::_Insert_base
613 { this->insert(__l.begin(), __l.end()); }
617 insert(_InputIterator __first, _InputIterator __last);
628 insert(_InputIterator __first, _InputIterator __last) function in class:__detail::_Insert_base
653 * Select insert member functions appropriate to _Hashtable policy choices.
683 using __base_type::insert;
686 insert(value_type&& __v) function in struct:__detail::_Insert
693 insert(const_iterator, value_type&& __v) function in struct:__detail::_Insert
720 insert(value_type&& __v) function in struct:__detail::_Insert
727 insert(const_iterator, value_type&& __v) function in struct:__detail::_Insert
766 insert(_Pair&& __v) function in struct:__detail::_Insert
774 insert(const_iterator, _Pair&& __v) function in struct:__detail::_Insert
    [all...]
stl_deque.h 1492 insert(iterator __position, value_type&& __x) function in class:deque
1505 insert(iterator __p, initializer_list<value_type> __l) function in class:deque
1519 insert(iterator __position, size_type __n, const value_type& __x) function in class:deque
1536 insert(iterator __position, _InputIterator __first, function in class:deque
1542 insert(iterator __position, _InputIterator __first, function in class:deque
    [all...]
stl_list.h 1089 insert(iterator __position, value_type&& __x) function in class:list
1106 insert(iterator __p, initializer_list<value_type> __l) function in class:list
1123 insert(iterator __position, size_type __n, const value_type& __x) function in class:list
1149 insert(iterator __position, _InputIterator __first, function in class:list
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/ov_tree_map_/
ov_tree_map_.hpp 268 insert(r_key);
274 insert(const_reference r_value) function in class:__gnu_pbds::detail::PB_DS_OV_TREE_NAME
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/tr1/
hashtable.h 339 private: // Find, insert and erase helper functions
342 // better to just specialize insert on __unique_keys. There may be a
372 // Insert and erase
374 insert(const value_type& __v) function in class:tr1::_Hashtable
379 insert(iterator, const value_type& __v) function in class:tr1::_Hashtable
380 { return iterator(_Insert_Conv_Type()(this->insert(__v))); }
383 insert(const_iterator, const value_type& __v) function in class:tr1::_Hashtable
384 { return const_iterator(_Insert_Conv_Type()(this->insert(__v))); }
388 insert(_InputIterator __first, _InputIterator __last);
567 this->insert(*__f)
978 insert(_InputIterator __first, _InputIterator __last) function in class:tr1::_Hashtable
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/
hashtable_policy.h 571 * insert member functions appropriate to all _Hashtables.
601 insert(const value_type& __v) function in struct:__detail::_Insert_base
608 insert(const_iterator, const value_type& __v) function in struct:__detail::_Insert_base
609 { return __iconv_type()(insert(__v)); }
612 insert(initializer_list<value_type> __l) function in struct:__detail::_Insert_base
613 { this->insert(__l.begin(), __l.end()); }
617 insert(_InputIterator __first, _InputIterator __last);
628 insert(_InputIterator __first, _InputIterator __last) function in class:__detail::_Insert_base
653 * Select insert member functions appropriate to _Hashtable policy choices.
683 using __base_type::insert;
686 insert(value_type&& __v) function in struct:__detail::_Insert
693 insert(const_iterator, value_type&& __v) function in struct:__detail::_Insert
720 insert(value_type&& __v) function in struct:__detail::_Insert
727 insert(const_iterator, value_type&& __v) function in struct:__detail::_Insert
766 insert(_Pair&& __v) function in struct:__detail::_Insert
774 insert(const_iterator, _Pair&& __v) function in struct:__detail::_Insert
    [all...]
stl_deque.h 1492 insert(iterator __position, value_type&& __x) function in class:deque
1505 insert(iterator __p, initializer_list<value_type> __l) function in class:deque
1519 insert(iterator __position, size_type __n, const value_type& __x) function in class:deque
1536 insert(iterator __position, _InputIterator __first, function in class:deque
1542 insert(iterator __position, _InputIterator __first, function in class:deque
    [all...]
stl_list.h 1089 insert(iterator __position, value_type&& __x) function in class:list
1106 insert(iterator __p, initializer_list<value_type> __l) function in class:list
1123 insert(iterator __position, size_type __n, const value_type& __x) function in class:list
1149 insert(iterator __position, _InputIterator __first, function in class:list
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/ov_tree_map_/
ov_tree_map_.hpp 268 insert(r_key);
274 insert(const_reference r_value) function in class:__gnu_pbds::detail::PB_DS_OV_TREE_NAME
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/
hashtable.h 339 private: // Find, insert and erase helper functions
342 // better to just specialize insert on __unique_keys. There may be a
372 // Insert and erase
374 insert(const value_type& __v) function in class:tr1::_Hashtable
379 insert(iterator, const value_type& __v) function in class:tr1::_Hashtable
380 { return iterator(_Insert_Conv_Type()(this->insert(__v))); }
383 insert(const_iterator, const value_type& __v) function in class:tr1::_Hashtable
384 { return const_iterator(_Insert_Conv_Type()(this->insert(__v))); }
388 insert(_InputIterator __first, _InputIterator __last);
567 this->insert(*__f)
978 insert(_InputIterator __first, _InputIterator __last) function in class:tr1::_Hashtable
    [all...]
  /prebuilts/gdb/darwin-x86/lib/python2.7/lib-tk/
ttk.py 869 def insert(self, pos, child, **kw): member in class:Notebook
875 self.tk.call(self._w, "insert", pos, child, *(_format_optdict(kw)))
955 def insert(self, pos, child, **kw): member in class:Panedwindow
1317 def insert(self, parent, index, iid=None, **kw): member in class:Treeview
    [all...]
  /prebuilts/gdb/darwin-x86/lib/python2.7/xml/etree/
ElementTree.py 318 # @param index Where to insert the new subelement.
320 def insert(self, index, element): member in class:Element
322 self._children.insert(index, element)
    [all...]
  /prebuilts/gdb/linux-x86/lib/python2.7/lib-tk/
ttk.py 869 def insert(self, pos, child, **kw): member in class:Notebook
875 self.tk.call(self._w, "insert", pos, child, *(_format_optdict(kw)))
955 def insert(self, pos, child, **kw): member in class:Panedwindow
1317 def insert(self, parent, index, iid=None, **kw): member in class:Treeview
    [all...]
  /prebuilts/gdb/linux-x86/lib/python2.7/xml/etree/
ElementTree.py 318 # @param index Where to insert the new subelement.
320 def insert(self, index, element): member in class:Element
322 self._children.insert(index, element)
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib-tk/
ttk.py 869 def insert(self, pos, child, **kw): member in class:Notebook
875 self.tk.call(self._w, "insert", pos, child, *(_format_optdict(kw)))
955 def insert(self, pos, child, **kw): member in class:Panedwindow
1317 def insert(self, parent, index, iid=None, **kw): member in class:Treeview
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/xml/etree/
ElementTree.py 318 # @param index Where to insert the new subelement.
320 def insert(self, index, element): member in class:Element
322 self._children.insert(index, element)
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib-tk/
ttk.py 869 def insert(self, pos, child, **kw): member in class:Notebook
875 self.tk.call(self._w, "insert", pos, child, *(_format_optdict(kw)))
955 def insert(self, pos, child, **kw): member in class:Panedwindow
1317 def insert(self, parent, index, iid=None, **kw): member in class:Treeview
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/xml/etree/
ElementTree.py 318 # @param index Where to insert the new subelement.
320 def insert(self, index, element): member in class:Element
322 self._children.insert(index, element)
    [all...]
  /system/libvintf/test/
LibVintfTest.cpp 460 static bool insert(std::map<std::string, HalInterface>* map, HalInterface&& intf) { function in namespace:android::vintf
469 EXPECT_TRUE(insert(&mh.interfaces, {"IBetterCamera", {"default", "great"}}));
470 EXPECT_TRUE(insert(&mh.interfaces, {"ICamera", {"default"}}));
    [all...]
  /toolchain/binutils/binutils-2.27/include/opcode/
ppc.h 245 /* Insertion function. This is used by the assembler. To insert an
263 unsigned long (*insert)
316 insert function with any op value. The disassembler should call
262 unsigned long (*insert) member in struct:powerpc_operand

Completed in 1409 milliseconds

<<41424344454647484950>>