Searched defs:insert (Results 201 - 225 of 300) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/icu/source/test/intltest/
H A Dtstnorm.cpp501 inline static void insert(UnicodeString& dest, int pos, UChar32 ch) function
520 insert(reverse, 0, ch);
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DEdgeWalker_TestUtility.cpp574 char* insert = strstr(inData.begin(), marker); local
575 if (insert) {
576 insert += sizeof(marker) - 1;
577 const char* numLoc = insert + 4 /* indent spaces */ + testNameSize - 1;
/external/chromium_org/third_party/skia/src/pathops/
H A DSkOpAngle.cpp637 // OPTIMIZE: if this loops to only one other angle, after first compare fails, insert on other side
639 void SkOpAngle::insert(SkOpAngle* angle) { function in class:SkOpAngle
650 angle->insert(this);
776 insert(working);
/external/chromium_org/v8/src/heap/
H A Dheap-inl.h24 void PromotionQueue::insert(HeapObject* target, int size) { function in class:v8::internal::PromotionQueue
/external/clang/lib/ARCMigrate/
H A DTransformActions.cpp134 void insert(SourceLocation loc, StringRef text);
285 void TransformActionsImpl::insert(SourceLocation loc, StringRef text) { function in class:TransformActionsImpl
325 insert(range.getBegin(), text);
353 insert(S->getLocStart(), text);
460 StmtRemovals.insert(S);
537 Removals.insert(I, newRange);
553 Removals.insert(Removals.begin(), newRange);
562 receiver.insert(loc, *TI);
625 void TransformActions::insert(SourceLocation loc, StringRef text) { function in class:TransformActions
626 static_cast<TransformActionsImpl*>(Impl)->insert(lo
[all...]
/external/deqp/modules/gles31/functional/
H A Des31fShaderIntegerFunctionTests.cpp796 m_spec.inputs.push_back(Symbol("insert", glu::VarType(baseType, precision)));
800 m_spec.source = "result = bitfieldInsert(base, insert, offset, bits);";
840 const deUint32 insert = ((const deUint32*)inputs[1])[compNdx]; local
844 const deUint32 ref = (base & ~(mask<<offset)) | ((insert & mask)<<offset);
/external/deqp/modules/glshared/
H A DglsFboUtil.hpp135 bool insert(const typename M::key_type& key, const typename M::mapped_type& value, M& map) function in namespace:deqp::gls
138 std::pair<typename M::iterator,bool> ret = map.insert(entry);
394 m_configs.insert(cfg);
414 Checker (void) { m_statusCodes.insert(GL_FRAMEBUFFER_COMPLETE); }
/external/dnsmasq/src/
H A Dcache.c199 /* insert a new cache entry at the head of the list (youngest entry) */
347 insert due to error.
402 insert. Once in this state, all inserts will probably fail. */
505 struct crec *next, **up, **insert = NULL, **chainp = &ans; local
534 if (insert && (crecp->flags & (F_REVERSE | F_IMMORTAL)) == ins_flags)
537 crecp->hash_next = *insert;
538 *insert = crecp;
539 insert = &crecp->hash_next;
543 if (!insert)
545 insert
[all...]
/external/eigen/Eigen/src/SparseCore/
H A DSparseMatrix.h183 * If the element does not exist then it is inserted via the insert(Index,Index) function
186 * This is a O(log(nnz_j)) operation (binary search) plus the cost of insert(Index,Index)
200 return insert(row,col);
205 return insert(row,col);
220 Scalar& insert(Index row, Index col) function in class:Eigen::SparseMatrix
373 * \sa insert, insertBackByOuterInner, startVec */
441 * same as insert(Index,Index) except that the indices are given relative to the storage order */
444 return insert(IsRowMajor ? j : i, IsRowMajor ? i : j);
812 * \sa insert(Index,Index) */
831 * \sa insert(Inde
[all...]
/external/freetype/src/pshinter/
H A Dpshalgo.c1923 PSH_Point* insert; local
1929 for ( insert = strongs + num_strongs; insert > strongs; insert-- )
1931 if ( insert[-1]->org_u <= point->org_u )
1934 insert[0] = insert[-1];
1936 insert[0] = point;
/external/icu/icu4c/source/test/intltest/
H A Dtstnorm.cpp501 inline static void insert(UnicodeString& dest, int pos, UChar32 ch) function
520 insert(reverse, 0, ch);
/external/javassist/src/main/javassist/bytecode/
H A DCodeIterator.java316 public int insert(byte[] code) method in class:CodeIterator
343 public void insert(int pos, byte[] code) throws BadBytecode { method in class:CodeIterator
656 public void insert(ExceptionTable et, int offset) { method in class:CodeIterator
/external/libpng/contrib/libtests/
H A Dmakepng.c99 /* This structure is used for inserting extra chunks (the --insert argument, not
105 void (*insert)(png_structp, png_infop, int, png_charpp); member in struct:chunk_insert
556 volatile png_fixed_point gamma, chunk_insert * volatile insert,
672 while (insert != NULL)
674 insert->insert(png_ptr, info_ptr, insert->nparams, insert->parameters);
675 insert = insert
555 write_png(const char **name, FILE *fp, int color_type, int bit_depth, volatile png_fixed_point gamma, chunk_insert * volatile insert, unsigned int filters, unsigned int *colors) argument
1136 make_insert(png_const_charp what, void (*insert)(png_structp, png_infop, int, png_charpp), int nparams, png_charpp list) argument
[all...]
/external/llvm/include/llvm/ADT/
H A DDenseMap.h154 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { function in class:llvm::DenseMapBase
160 // Otherwise, insert the new element.
168 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) { function in class:llvm::DenseMapBase
174 // Otherwise, insert the new element.
181 /// insert - Range insertion of pairs.
183 void insert(InputIt I, InputIt E) { function in class:llvm::DenseMapBase
185 insert(*I);
561 this->insert(I, E);
721 this->insert(I, E);
H A Dilist.h412 iterator insert(iterator where, NodeTy *New) { function in class:llvm::iplist
430 return insert(begin(), New);
432 return insert(++where, New);
553 void push_front(NodeTy *val) { insert(begin(), val); }
554 void push_back(NodeTy *val) { insert(end(), val); }
564 // Special forms of insert...
565 template<class InIt> void insert(iterator where, InIt first, InIt last) { function in class:llvm::iplist
566 for (; first != last; ++first) insert(where, *first);
646 insert(this->begin(), right.begin(), right.end());
649 insert(thi
664 iterator insert(iterator where, const NodeTy &val) { function in struct:llvm::ilist
673 void insert(iterator where, size_type count, const NodeTy &val) { function in struct:llvm::ilist
[all...]
/external/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h447 /// not a PHI or a label. This is the correct point to insert copies at the
483 /// MIBundleBuilder::insert() for a more reliable way of doing that.
484 instr_iterator insert(instr_iterator I, MachineInstr *M);
488 void insert(iterator I, IT S, IT E) { function in class:llvm::MachineBasicBlock
489 Insts.insert(I.getInstrIterator(), S, E);
493 iterator insert(iterator I, MachineInstr *MI) { function in class:llvm::MachineBasicBlock
495 "Cannot insert instruction with bundle flags");
496 return Insts.insert(I.getInstrIterator(), MI);
502 "Cannot insert instruction with bundle flags");
561 /// Take an instruction from MBB 'Other' at the position From, and insert i
[all...]
/external/llvm/lib/CodeGen/
H A DMachineBasicBlock.cpp411 // its layout successor, insert a branch. First we have to locate the
710 MF->insert(std::next(MachineFunction::iterator(this)), NMBB);
868 PHISrcRegs.insert(Reg);
989 MachineBasicBlock::insert(instr_iterator I, MachineInstr *MI) { function in class:MachineBasicBlock
991 "Cannot insert instruction with bundle flags");
997 return Insts.insert(I, MI);
1089 if (!SeenMBBs.insert(MBB) ||
/external/llvm/lib/IR/
H A DConstantsContext.h544 std::pair<typename MapTy::iterator, bool> IP = Map.insert(InsertVal);
577 I = Map.insert(I, std::make_pair(MapKey(Ty, V), Result));
580 InverseMap.insert(std::make_pair(Result, I));
747 void insert(ConstantClass *CP) { function in class:llvm::ConstantAggrUniqueMap
/external/llvm/lib/MC/
H A DWinCOFFObjectWriter.cpp116 size_t insert(StringRef String);
278 size_t StringTable::insert(StringRef String) { function in class:StringTable
287 Data.insert(Data.end(), String.begin(), String.end());
515 uint64_t StringTableEntry = Strings.insert(S.Name.c_str());
541 size_t StringTableEntry = Strings.insert(S.Name.c_str());
/external/llvm/lib/Transforms/IPO/
H A DMergeFunctions.cpp29 // std::set::insert operation will give you result in log(N) time.
912 auto LeftSN = sn_mapL.insert(std::make_pair(L, sn_mapL.size())),
913 RightSN = sn_mapR.insert(std::make_pair(R, sn_mapR.size()));
1027 VisitedBBs.insert(FnLBBs[0]);
1043 if (!VisitedBBs.insert(TermL->getSuccessor(i)))
1083 bool insert(Function *NewFunction);
1112 /// The set of all distinct functions. Use the insert() and remove() methods
1231 Changed |= insert(F);
1245 Changed |= insert(F);
1412 bool MergeFunctions::insert(Functio function in class:MergeFunctions
[all...]
/external/mksh/src/
H A Dexec.c1081 /* insert if not found */
1082 unsigned char insert = Flag(FTRACKALL); local
1088 insert = 0;
1129 if (insert && !(flags & FC_DEFPATH)) {
/external/owasp/sanitizer/tools/findbugs/lib/
H A Dasm-tree-3.3.jar ... .objectweb.asm.tree.InsnList) public void insert (org.objectweb.asm.tree.AbstractInsnNode) public ...
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/pshinter/
H A Dpshalgo.c1924 PSH_Point* insert; local
1930 for ( insert = strongs + num_strongs; insert > strongs; insert-- )
1932 if ( insert[-1]->org_u <= point->org_u )
1935 insert[0] = insert[-1];
1937 insert[0] = point;
/external/skia/experimental/Intersection/
H A DEdgeWalker_TestUtility.cpp574 char* insert = strstr(inData.begin(), marker); local
575 if (insert) {
576 insert += sizeof(marker) - 1;
577 const char* numLoc = insert + 4 /* indent spaces */ + testNameSize - 1;
/external/skia/src/pathops/
H A DSkOpAngle.cpp640 // OPTIMIZE: if this loops to only one other angle, after first compare fails, insert on other side
642 void SkOpAngle::insert(SkOpAngle* angle) { function in class:SkOpAngle
653 angle->insert(this);
779 insert(working);

Completed in 2477 milliseconds

1234567891011>>