HomeSort by relevance Sort by last modified time
    Searched defs:Insert (Results 76 - 100 of 229) sorted by null

1 2 34 5 6 7 8 910

  /prebuilts/clang/host/linux-x86/clang-4630689/include/clang/Tooling/ASTDiff/
ASTDiff.h 32 Insert, // (Src, Dst, Pos): insert Src as child of Dst at offset Pos.
  /prebuilts/clang/host/linux-x86/clang-4630689/prebuilt_include/llvm/lib/Fuzzer/
FuzzerTracePC.h 37 void Insert(size_t Idx, const T &Arg1, const T &Arg2) {
  /prebuilts/clang/host/linux-x86/clang-4639204/include/clang/Tooling/ASTDiff/
ASTDiff.h 32 Insert, // (Src, Dst, Pos): insert Src as child of Dst at offset Pos.
  /prebuilts/clang/host/linux-x86/clang-4639204/prebuilt_include/llvm/lib/Fuzzer/
FuzzerTracePC.h 37 void Insert(size_t Idx, const T &Arg1, const T &Arg2) {
  /prebuilts/clang/host/linux-x86/clang-4691093/include/clang/Tooling/ASTDiff/
ASTDiff.h 32 Insert, // (Src, Dst, Pos): insert Src as child of Dst at offset Pos.
  /prebuilts/clang/host/linux-x86/clang-4691093/prebuilt_include/llvm/lib/Fuzzer/
FuzzerTracePC.h 37 void Insert(size_t Idx, const T &Arg1, const T &Arg2) {
  /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/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)
  /art/runtime/
class_table.cc 153 classes_.back().Insert(slot);
157 void ClassTable::Insert(ObjPtr<mirror::Class> klass) {
171 classes_.back().Insert(slot);
271 combined.Insert(root);
292 classes_.insert(classes_.begin(), std::move(set));
intern_table.cc 76 strong_interns_.Insert(new_ref);
134 strong_interns_.Insert(s);
143 weak_interns_.Insert(s);
159 // Insert/remove methods used to undo changes made during an aborted transaction.
211 ObjPtr<mirror::String> InternTable::Insert(ObjPtr<mirror::String> s,
263 // No match in the strong table or the weak table. Insert into the strong / weak table.
286 return Insert(s, true, true);
290 return Insert(s, true, false);
294 return Insert(s, false, false);
380 // Insert at the front since we add new interns into the back
    [all...]
  /external/chromium-trace/catapult/common/py_utils/py_utils/
cloud_storage.py 359 def Insert(bucket, remote_path, local_path, publicly_readable=False):
  /external/libchrome/base/trace_event/
heap_profiler_allocation_register.h 71 std::pair<KVIndex, bool> Insert(const Key& key, const Value& value) {
223 // Number of calls to Insert() that were lost because the hashtable was full.
292 // Returns true if an insert occurred. Inserts may fail because the table
294 bool Insert(const void* address,
  /external/llvm/include/llvm/CodeGen/GlobalISel/
RegBankSelect.h 100 /// before we actually need to insert something.
103 /// Tell if the insert point has already been materialized.
136 /// MachineBasicBlock::insert. I.e., additional code happens
155 /// MachineBasicBlock::insert and ::getPoint. The new code should
168 /// Insert \p MI in the just before ::getPoint()
169 MachineBasicBlock::iterator insert(MachineInstr &MI) { function in class:llvm::RegBankSelect::InsertPoint
170 return getInsertMBB().insert(getPoint(), &MI);
243 // If we try to insert before phis, we should use the insertion
247 // If we try to insert after the terminators, we should use the
302 Insert,
    [all...]
  /external/python/cpython2/Lib/bsddb/
dbtables.py 480 def Insert(self, table, rowdict) :
481 """Insert(table, datadict) - Insert a new row into the table
501 # insert the row values into the table database
712 conditionlist.insert(j, i)
  /external/v8/src/
effects.h 96 if (!this->Insert(var, &locator)) {
110 if (!this->Insert(var, &locator)) {
152 self.Insert(var, &locator);
203 bool Insert(Var var, Locator* locator) {
205 return map_->Insert(var, locator);
275 bool Insert(Var var, Locator* locator);
293 bool NestedEffectsBase<Var, kNoVar>::Insert(Var var, Locator* locator) {
295 if (!node_->effects.Insert(var, locator)) return false;
transitions.cc 16 void TransitionArray::Insert(Handle<Map> map, Handle<Name> name,
93 // If there is enough capacity, insert new entry into the existing array.
  /external/v8/src/heap/
remembered-set.h 24 static void Insert(MemoryChunk* chunk, Address slot_addr) {
31 slot_set[offset / Page::kPageSize].Insert(offset % Page::kPageSize);
160 slot_set->Insert(slot_type, static_cast<uint32_t>(host_offset),
  /external/v8/src/interpreter/
constant-array-builder.cc 79 elements.insert(*handle);
170 size_t ConstantArrayBuilder::Insert(Smi* smi) {
178 size_t ConstantArrayBuilder::Insert(const AstRawString* raw_string) {
187 size_t ConstantArrayBuilder::Insert(const AstValue* heap_number) {
190 // singleton Insert methods (in the case of symbols), or skip the constant
202 size_t ConstantArrayBuilder::Insert(const Scope* scope) {
212 size_t ConstantArrayBuilder::Insert##NAME() { \
  /external/v8/src/snapshot/
serializer.h 50 void Insert(Address code_address, const char* name, int name_size) {
113 address_to_name_map_.Insert(code->address(), name, length);
  /external/vixl/src/
pool-manager-impl.h 375 Insert(new_object);
386 Insert(new_object);
394 void PoolManager<T>::Insert(const PoolObject<T>& new_object) {
400 objects_.insert(iter, new_object);
  /external/webrtc/webrtc/modules/remote_bitrate_estimator/test/
bwe.cc 51 received_packets_.Insert(media_packet.sequence_number(),
219 void LinkedSet::Insert(uint16_t sequence_number,
242 void LinkedSet::Insert(PacketIdentifierNode packet_identifier) {
243 Insert(packet_identifier.sequence_number, packet_identifier.send_time_ms,
  /prebuilts/clang/host/darwin-x86/clang-4579689/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/darwin-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/darwin-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/darwin-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...]

Completed in 736 milliseconds

1 2 34 5 6 7 8 910