Searched defs:Insert (Results 1 - 25 of 29) sorted by relevance

12

/external/chromium/net/disk_cache/
H A Dmem_rankings.cc16 void MemRankings::Insert(MemEntryImpl* node) { function in class:disk_cache::MemRankings
50 Insert(node);
H A Drankings.cc235 void Rankings::Insert(CacheRankingsBlock* node, bool modified, List list) { function in class:disk_cache::Rankings
236 Trace("Insert 0x%x l %d", node->address().value(), list);
382 // A crash in between Remove and Insert will lead to a dirty entry not on the
396 Insert(node, modified, list);
652 // This part will be skipped by the logic of Insert.
656 Insert(node, true, static_cast<List>(control_data_->operation_list));
/external/valgrind/tsan/
H A Dts_simple_cache.h47 void Insert(uintptr_t ptr, bool val) { function in class:PtrToBoolCache
81 void Insert(uint32_t a, uint32_t b, bool val) { function in class:IntPairToBoolCache
/external/chromium/chrome/common/extensions/
H A Dextension_set.cc24 void ExtensionSet::Insert(const scoped_refptr<const Extension>& extension) { function in class:ExtensionSet
/external/srec/seti/sltsEngine/src/
H A Dlinklist_impl.c123 LListResult Insert(LList *list, void *data) function
/external/v8/test/cctest/
H A Dtest-hashmap.cc48 void Insert(int x) { function in class:IntSet
97 set.Insert(1);
98 set.Insert(2);
99 set.Insert(3);
102 set.Insert(2);
103 set.Insert(3);
127 // Insert a long series of values.
136 set.Insert(x);
/external/webrtc/src/system_wrappers/source/
H A Dmap.cc68 int MapWrapper::Insert(int id, void* ptr) function in class:webrtc::MapWrapper
H A Dmap_no_stl.cc74 int MapNoStl::Insert(int id, void* ptr) function in class:webrtc::MapNoStl
H A Dlist_no_stl.cc149 int ListWrapper::Insert(ListItem* existing_previous_item, ListItem* new_item) function in class:webrtc::ListWrapper
H A Dlist_stl.cc180 int ListWrapper::Insert(ListItem* existing_previous_item, function in class:webrtc::ListWrapper
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/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/
H A DSubList.cs62 public void Insert( int index, object value ) method in class:Antlr.Runtime.JavaExtensions.SubList
281 void IList.Insert( int index, object value )
393 void IList<T>.Insert( int index, T item ) method in class:Antlr.Runtime.JavaExtensions.SubList
/external/chromium/chrome/browser/safe_browsing/
H A Dbloom_filter.cc71 void BloomFilter::Insert(SBPrefix hash) { function in class:BloomFilter
/external/openfst/src/include/fst/
H A Dheap.h64 // Insert a value into the heap
65 int Insert(const T& val) { function in class:fst::Heap
76 return Insert(val, size_ - 1);
86 Insert(val, i);
182 // Insert (update) element at subtree rooted at index i
183 int Insert(const T& val, int i) { function in class:fst::Heap
H A Dutil.h374 void Insert(Key key) { function in class:fst::CompactSet
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dheap.h59 int Insert(const T& val) { function in class:fst::Heap
70 return Insert(val, size_ - 1);
80 Insert(val, i);
170 int Insert(const T& val, int i) { function in class:fst::Heap
/external/v8/src/
H A Dsplay-tree-inl.h45 bool SplayTree<Config, Allocator>::Insert(const Key& key, Locator* locator) { function in class:v8::internal::SplayTree
59 // Insert the new node.
218 // Insert the original right child as the right child of the new
H A Disolate.cc330 thread_data_table_->Insert(per_thread);
1385 void Isolate::ThreadDataTable::Insert(Isolate::PerIsolateThreadData* data) { function in class:v8::internal::Isolate::ThreadDataTable
/external/webrtc/src/common_audio/resampler/
H A Dresampler.cc996 int Resampler::Insert(WebRtc_Word16 * samplesIn, int lengthIn) function in class:webrtc::Resampler
/external/chromium/base/
H A Dvalues.cc852 bool ListValue::Insert(size_t index, Value* in_value) { function in class:ListValue
/external/chromium/net/base/
H A Dx509_certificate.cc60 void Insert(X509Certificate* cert);
86 // Insert |cert| into the cache. The cache does NOT AddRef |cert|.
88 void X509CertificateCache::Insert(X509Certificate* cert) { function in class:net::__anon2856::X509CertificateCache
183 cache->Insert(cert);
/external/llvm/lib/VMCore/
H A DMetadata.cpp216 FunctionLocalness FL, bool Insert) {
230 if (N || !Insert)
215 getMDNode(LLVMContext &Context, ArrayRef<Value*> Vals, FunctionLocalness FL, bool Insert) argument
/external/llvm/lib/Transforms/Scalar/
H A DScalarReplAggregates.cpp882 /// ConvertScalar_InsertValue - Insert the value "SV" into the existing integer
1923 Value *Insert = UndefValue::get(LIType); local
1927 Insert = Builder.CreateInsertValue(Insert, Load, i, "insert");
1929 LI->replaceAllUsesWith(Insert);
1977 // utilizing just the first element of the scalarized result. Insert a
/external/protobuf/gtest/src/
H A Dgtest-internal-inl.h280 void PushBack(const E& element) { Insert(element, size_); }
283 void PushFront(const E& element) { Insert(element, 0); }
303 void Insert(const E& element, int index) { function in class:testing::internal::Vector
/external/llvm/include/llvm/
H A DIRBuilder.h396 /// Insert - Insert and return the specified instruction.
398 InstTy *Insert(InstTy *I, const Twine &Name = "") const { function in class:llvm::IRBuilder
405 /// Insert - No-op overload to handle constants.
406 Constant *Insert(Constant *C, const Twine& = "") const { function in class:llvm::IRBuilder
427 return Insert(ReturnInst::Create(Context));
434 return Insert(ReturnInst::Create(Context, V));
448 return Insert(ReturnInst::Create(Context, V));
453 return Insert(BranchInst::Create(Dest));
460 return Insert(addBranchWeight
[all...]

Completed in 538 milliseconds

12