Searched defs:Insert (Results 51 - 75 of 99) sorted by relevance

1234

/external/lzma/CPP/Common/
H A DMyVector.h60 void Insert(int index, T item) function in class:CRecordVector
128 Insert(right, item);
206 void Insert(int index, const T& item) { CPointerVector::Insert(index, new T(item)); } function in class:CObjectVector
254 Insert(right, item);
H A DMyString.h469 int Insert(int index, T c) function in class:CStringBase
476 int Insert(int index, const CStringBase &s) function in class:CStringBase
523 Insert(pos, newString);
/external/openfst/src/include/fst/
H A Dutil.h391 void Insert(Key key) { function in class:fst::CompactSet
/external/webrtc/src/system_wrappers/source/
H A Dlist_unittest.cc66 int Insert(ListItem* existing_previous_item, function in class:ListWrapperSimple
68 const int retval = list_.Insert(existing_previous_item, new_item);
387 // Use Insert to interleave two lists.
423 EXPECT_EQ(0, interleave_list->Insert(item, insert_item));
/external/chromium_org/net/disk_cache/simple/
H A Dsimple_index.cc244 void SimpleIndex::Insert(uint64 entry_hash) { function in class:disk_cache::SimpleIndex
/external/chromium_org/third_party/WebKit/Source/core/html/parser/
H A DHTMLConstructionSite.h46 Insert, enumerator in enum:blink::HTMLConstructionSiteTask::Operation
48 InsertAlreadyParsedChild, // Insert w/o calling begin/end parsing.
70 // object in the common case of the Insert operation.
/external/chromium_org/third_party/leveldatabase/src/util/
H A Dcache.cc62 LRUHandle* Insert(LRUHandle* h) { function in class:leveldb::__anon12466::HandleTable
144 Cache::Handle* Insert(const Slice& key, uint32_t hash,
225 Cache::Handle* LRUCache::Insert( function in class:leveldb::__anon12466::LRUCache
242 LRUHandle* old = table_.Insert(e);
293 virtual Handle* Insert(const Slice& key, void* value, size_t charge, function in class:leveldb::__anon12466::ShardedLRUCache
296 return shard_[Shard(hash)].Insert(key, hash, value, charge, deleter);
/external/chromium_org/third_party/tcmalloc/chromium/src/
H A Daddressmap-inl.h119 // Insert <key,value> into the map. Any old value associated
121 void Insert(Key key, Value value);
308 void AddressMap<Value>::Insert(Key key, Value value) { function in class:AddressMap
/external/chromium_org/third_party/tcmalloc/vendor/src/
H A Daddressmap-inl.h119 // Insert <key,value> into the map. Any old value associated
121 void Insert(Key key, Value value);
308 void AddressMap<Value>::Insert(Key key, Value value) { function in class:AddressMap
/external/chromium_org/third_party/webrtc/modules/video_coding/main/source/
H A Dsession_info.cc159 frame_buffer_ptr += Insert(nalu_ptr,
173 packet.sizeBytes = Insert(packet_buffer,
180 size_t VCMSessionInfo::Insert(const uint8_t* buffer, function in class:webrtc::VCMSessionInfo
/external/chromium_org/tools/telemetry/telemetry/unittest/
H A Dsystem_stub.py160 def Insert(self, bucket, remote_path, local_path): member in class:CloudStorageModuleStub
/external/chromium_org/v8/src/
H A Deffects.h98 if (!this->Insert(var, &locator)) {
112 if (!this->Insert(var, &locator)) {
154 self.Insert(var, &locator);
205 bool Insert(Var var, Locator* locator) { function in class:v8::internal::EffectsBase
207 return map_->Insert(var, locator);
277 bool Insert(Var var, Locator* locator);
295 bool NestedEffectsBase<Var, kNoVar>::Insert(Var var, Locator* locator) { function in class:v8::internal::NestedEffectsBase
297 if (!node_->effects.Insert(var, locator)) return false;
H A Dhydrogen-bce.cc314 void BoundsCheckTable::Insert(BoundsCheckKey* key, function in class:v8::internal::BoundsCheckTable
445 table_.Insert(key, bb_data_list, zone());
457 table_.Insert(data->Key(), data->FatherInDominatorTree(), zone());
H A Dhydrogen-check-elimination.cc210 copy->Insert(phi, NULL, pred_entry->maps_, pred_entry->state_);
231 copy->Insert(object, cmp, cmp->map(), state);
258 copy->Insert(left, NULL, re->maps_, re->state_);
261 copy->Insert(right, NULL, le->maps_, le->state_);
279 copy->Insert(object, NULL, string_maps(),
444 Insert(object, check, instr->maps(), state);
453 Insert(value, NULL, string_maps(), HCheckTableEntry::CHECKED);
499 Insert(instr, NULL, maps, HCheckTableEntry::UNCHECKED_STABLE);
535 Insert(object, NULL, c_transition->MapValue(), state);
544 Insert(objec
764 void Insert(HValue* object, function in class:v8::internal::HCheckTable
771 void Insert(HValue* object, function in class:v8::internal::HCheckTable
[all...]
/external/llvm/lib/Analysis/
H A DBlockFrequencyInfoImpl.cpp661 LoopData *OuterLoop, std::list<LoopData>::iterator Insert,
670 auto Loop = BFI.Loops.emplace(Insert, OuterLoop, Headers.begin(),
684 std::list<LoopData>::iterator Insert) {
685 assert((OuterLoop == nullptr) == (Insert == Loops.begin()));
686 auto Prev = OuterLoop ? std::prev(Insert) : Loops.end();
693 createIrreducibleLoop(*this, G, OuterLoop, Insert, *I);
697 return make_range(std::next(Prev), Insert);
698 return make_range(Loops.begin(), Insert);
659 createIrreducibleLoop( BlockFrequencyInfoImplBase &BFI, const IrreducibleGraph &G, LoopData *OuterLoop, std::list<LoopData>::iterator Insert, const std::vector<const IrreducibleGraph::IrrNode *> &SCC) argument
682 analyzeIrreducible( const IrreducibleGraph &G, LoopData *OuterLoop, std::list<LoopData>::iterator Insert) argument
/external/llvm/lib/CodeGen/
H A DBasicTargetTransformInfo.cpp38 /// Estimate the overhead of scalarizing an instruction. Insert and Extract
40 unsigned getScalarizationOverhead(Type *Ty, bool Insert, bool Extract) const;
262 unsigned BasicTTI::getScalarizationOverhead(Type *Ty, bool Insert, argument
268 if (Insert)
/external/llvm/lib/Target/X86/
H A DX86TargetTransformInfo.cpp41 /// Estimate the overhead of scalarizing an instruction. Insert and Extract
43 unsigned getScalarizationOverhead(Type *Ty, bool Insert, bool Extract) const;
763 unsigned X86TTI::getScalarizationOverhead(Type *Ty, bool Insert, argument
769 if (Insert)
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/host/chrome/
H A Dbraille_key_types.js116 'Insert': 45,
/external/chromium_org/ipc/
H A Dipc_channel_posix.cc119 // Insert a mapping from @channel_id to @fd. It's a fatal error to insert a
121 void Insert(const std::string& channel_id, int fd) { function in class:IPC::__anon8472::PipeMap
314 PipeMap::GetInstance()->Insert(pipe_name_, client_pipe_);
/external/chromium_org/media/cdm/
H A Daes_decryptor.cc41 void Insert(const std::string& web_session_id,
72 void AesDecryptor::SessionIdDecryptionKeyMap::Insert( function in class:media::AesDecryptor::SessionIdDecryptionKeyMap
488 key_id_entry->second->Insert(web_session_id, decryption_key.Pass());
495 inner_map->Insert(web_session_id, decryption_key.Pass());
/external/chromium_org/net/disk_cache/blockfile/
H A Drankings.cc249 void Rankings::Insert(CacheRankingsBlock* node, bool modified, List list) { function in class:disk_cache::Rankings
250 Trace("Insert 0x%x l %d", node->address().value(), list);
401 // A crash in between Remove and Insert will lead to a dirty entry not on the
415 Insert(node, modified, list);
678 // This part will be skipped by the logic of Insert.
682 Insert(node, true, static_cast<List>(control_data_->operation_list));
/external/chromium_org/net/quic/crypto/
H A Dstrike_register.cc133 InsertStatus StrikeRegister::Insert(const uint8 nonce[32], function in class:net::StrikeRegister
/external/lldb/source/Plugins/SymbolFile/DWARF/
H A DDWARFDebugLine.cpp1148 // Insert a row at the correct address if the addresses can be out of
1152 DWARFDebugLine::Row::Insert(Row::collection& state_coll, const Row& state) function in class:DWARFDebugLine::Row
/external/llvm/lib/IR/
H A DMetadata.cpp220 FunctionLocalness FL, bool Insert) {
234 if (N || !Insert)
219 getMDNode(LLVMContext &Context, ArrayRef<Value*> Vals, FunctionLocalness FL, bool Insert) argument
/external/chromium_org/base/
H A Dvalues.cc1066 bool ListValue::Insert(size_t index, Value* in_value) { function in class:base::ListValue

Completed in 7247 milliseconds

1234