Searched defs:insert (Results 76 - 100 of 185) sorted by relevance

12345678

/external/v8/src/
H A Dhashmap.h46 // but insert is set, a new entry is inserted with
49 Entry* Lookup(void* key, uint32_t hash, bool insert,
115 void* key, uint32_t hash, bool insert, AllocationPolicy allocator) {
122 // No entry found; insert one if necessary.
123 if (insert) {
339 Iterator find(Key* key, bool insert = false,
341 return Iterator(this, this->Lookup(key, key->Hash(), insert, allocator));
114 Lookup( void* key, uint32_t hash, bool insert, AllocationPolicy allocator) argument
/external/clang/include/clang/AST/
H A DASTVector.h216 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
286 iterator insert(const ASTContext &C, iterator I, ItTy From, ItTy To) { function in class:clang::ASTVector
/external/guava/guava/src/com/google/common/collect/
H A DHashBiMap.java159 private void insert(BiEntry<K, V> entry) { method in class:HashBiMap
246 insert(newEntry);
275 insert(newEntry);
294 insert(entry);
466 insert(newEntry);
619 insert(newEntry);
/external/libxml2/
H A Dhash.c522 xmlHashEntryPtr insert; local
553 insert = NULL;
556 for (insert = &(table->table[key]); insert->next != NULL;
557 insert = insert->next) {
558 if ((insert->name == name) &&
559 (insert->name2 == name2) &&
560 (insert->name3 == name3))
564 if ((insert
638 xmlHashEntryPtr insert; local
[all...]
H A Ddict.c829 xmlDictEntryPtr insert; local
851 insert = NULL;
853 for (insert = &(dict->dict[key]); insert->next != NULL;
854 insert = insert->next) {
856 if ((insert->okey == okey) && (insert->len == l)) {
857 if (!memcmp(insert->name, name, l))
858 return(insert
968 xmlDictEntryPtr insert; local
1077 xmlDictEntryPtr insert; local
[all...]
/external/llvm/lib/Analysis/
H A DLazyCallGraph.cpp42 CalleeIndexMap.insert(std::make_pair(F, Callees.size())).second) {
51 if (Visited.insert(cast<Constant>(Op)).second)
69 if (Visited.insert(C).second)
82 CalleeIndexMap.insert(std::make_pair(&Callee, Callees.size()));
87 CalleeIndexMap.insert(std::make_pair(&CalleeN.getFunction(), Callees.size()));
105 if (EntryIndexMap.insert(std::make_pair(&F, EntryNodes.size())).second) {
116 if (Visited.insert(GV.getInitializer()).second)
159 void LazyCallGraph::SCC::insert(Node &N) { function in class:LazyCallGraph::SCC
181 // First insert it into the caller.
191 // First insert i
[all...]
/external/llvm/lib/ProfileData/
H A DCoverageMapping.cpp249 void insert(const FunctionRecord &Function, unsigned FileID) { function in class:__anon10583::FunctionInstantiationSetCollector
341 Filenames.insert(Filenames.end(), Function.Filenames.begin(),
430 InstantiationSetCollector.insert(Function, *MainFileID);
437 Result.insert(Result.end(), InstantiationSet.second.begin(),
/external/llvm/lib/Transforms/Scalar/
H A DSROA.cpp248 void insert(ArrayRef<Slice> NewSlices) { function in class:__anon11083::AllocaSlices
646 if (VisitedDeadInsts.insert(&I).second)
851 MemTransferSliceMap.insert(std::make_pair(&II, AS.Slices.size()));
902 Visited.insert(Root);
933 if (Visited.insert(cast<Instruction>(U)).second)
1142 } while (Visited.insert(Ptr).second);
1193 /// onto insert and extract operations on a vector value, and convert them to
1730 Visited.insert(Ptr);
1754 if (!Visited.insert(Ptr).second)
1794 } while (Visited.insert(Pt
[all...]
/external/llvm/tools/llvm-diff/
H A DDifferenceEngine.cpp49 void insert(const T &V) { function in class:__anon11161::PriorityQueue
169 Queue.insert(BlockPair(L, R));
211 TentativeValues.insert(std::make_pair(LeftI, RightI));
525 TentativeValues.insert(std::make_pair(&*LI, &*RI));
657 LNames.insert(LFn->getName());
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_build_util.h45 inline void insert(Instruction *);
144 inline Value *insert(ValueMap&, unsigned i, unsigned c, Value *v);
234 void BuildUtil::insert(Instruction *i) function in class:nv50_ir::BuildUtil
253 insert(insn);
300 BuildUtil::DataArray::insert(ValueMap &m, unsigned i, unsigned c, Value *v)
302 m.insert(Location(array, arrayIdx, i, c), v);
/external/opencv/cv/src/
H A D_cvkdtree.hpp156 // insert given points into the tree; return created node
158 int insert(__instype * first, __instype * last, __valuector ctor) { function in class:CvKDTree
174 node & n = *nodes.insert(nodes.end(), node());
185 // note that recursive insert may invalidate this ref
186 node & n = *nodes.insert(nodes.end(), node());
191 int left = insert(first, split, ctor);
193 int right = insert(split, last, ctor);
267 root_node = insert(first, last, ctor);
/external/protobuf/python/google/protobuf/internal/
H A Dcpp_message.py122 def insert(self, key, value): member in class:RepeatedScalarContainer
124 values.insert(key, value)
/external/skia/include/core/
H A DSkString.h179 void insert(size_t offset, const SkString& src) { this->insert(offset, src.c_str(), src.size()); } function in class:SkString
180 void insert(size_t offset, const char text[]);
181 void insert(size_t offset, const char text[], size_t len);
190 void append(const SkString& str) { this->insert((size_t)-1, str); }
191 void append(const char text[]) { this->insert((size_t)-1, text); }
192 void append(const char text[], size_t len) { this->insert((size_t)-1, text, len); }
201 void prepend(const SkString& str) { this->insert(0, str); }
202 void prepend(const char text[]) { this->insert(0, text); }
203 void prepend(const char text[], size_t len) { this->insert(
[all...]
/external/skia/src/pathops/
H A DSkOpSegment.h197 SkOpSpan* insert(SkOpSpan* prev, SkChunkAlloc* allocator) { function in class:SkOpSegment
/external/toybox/toys/pending/
H A Dtcpsvd.c89 static void insert(struct list_pid **l, int pid, char *addr) function
397 insert(&pids, pid, addr);
/external/vixl/src/vixl/
H A Dinvalset.h95 // It is illegal to insert an element already present in the set.
96 void insert(const ElementType& element);
280 void InvalSet<TEMPLATE_INVALSET_P_DEF>::insert(const ElementType& element) { function in class:vixl::InvalSet
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DExplodedGraph.h404 Impl.insert(N);
410 if (N && !static_cast<ExplodedNode*>(N)->isSink()) Impl.insert(N);
421 void insert(const ExplodedNodeSet &S) { function in class:clang::ento::ExplodedNodeSet
426 Impl.insert(S.begin(), S.end());
/external/eigen/Eigen/src/SparseCore/
H A DSparseVector.h155 inline Scalar& insert(Index row, Index col) function in class:Eigen::SparseVector
162 return insert(inner);
164 Scalar& insert(Index i) function in class:Eigen::SparseVector
309 /** \internal \deprecated use insert(Index,Index) */
316 /** \internal \deprecated use insert(Index) */
319 return insert(i);
418 dst.insert(it.index()) = it.value();
430 dst.insert(i) = it.value();
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DUTF16.java1136 * @param offset16 UTF16 position to insert into
1169 * @param offset16 UTF16 position to insert into
1415 * @param target String buffer to insert to
1422 public static StringBuffer insert(StringBuffer target, int offset16, int char32) { method in class:UTF16
1427 target.insert(offset16, str);
1443 * @param target Char array to insert to
1451 public static int insert(char target[], int limit, int offset16, int char32) { method in class:UTF16
/external/jetty/src/java/org/eclipse/jetty/server/session/
H A DJDBCSessionIdManager.java381 insert(id);
581 _insertId = "insert into "+_sessionIdTable+" (id) values (?)";
655 _insertSession = "insert into "+_sessionTable+
686 private void insert (String id) method in class:JDBCSessionIdManager
699 //only insert the id if it isn't in the db already
/external/jmonkeyengine/engine/src/core/com/jme3/font/
H A DLetterQuad.java69 prev.insert(this);
173 void insert(LetterQuad ins) { method in class:LetterQuad
/external/libvterm/src/
H A Dvterm_internal.h87 int insert:1; member in struct:VTermState::__anon9668
/external/llvm/include/llvm/ADT/
H A DStringMap.h286 return insert(std::make_pair(Key, ValueTy())).first->second;
294 /// insert - Insert the specified key/value pair into the map. If the key
296 /// insert it and return true.
297 bool insert(MapEntryTy *KeyValue) { function in class:llvm::StringMap
313 /// insert - Inserts the specified key/value pair into the map if the key
317 std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) { function in class:llvm::StringMap
/external/llvm/include/llvm/CodeGen/
H A DMachineInstrBuilder.h263 BB.insert(I, MI);
274 BB.insert(I, MI);
302 BB.insert(I, MI);
312 BB.insert(I, MI);
393 BB.insert(I, MI);
472 MIBundleBuilder &insert(MachineBasicBlock::instr_iterator I, function in class:llvm::MIBundleBuilder
474 MBB.insert(I, MI);
495 return insert(begin(), MI);
501 return insert(end(), MI);
/external/llvm/include/llvm/IR/
H A DValueMap.h149 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { function in class:llvm::ValueMap
150 auto MapResult = Map.insert(std::make_pair(Wrap(KV.first), KV.second));
154 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) { function in class:llvm::ValueMap
156 Map.insert(std::make_pair(Wrap(KV.first), std::move(KV.second)));
160 /// insert - Range insertion of pairs.
162 void insert(InputIt I, InputIt E) { function in class:llvm::ValueMap
164 insert(*I);
266 Copy.Map->insert(std::make_pair(typed_new_key, std::move(Target)));

Completed in 839 milliseconds

12345678