HomeSort by relevance Sort by last modified time
    Searched defs:insert (Results 626 - 650 of 1132) sorted by null

<<21222324252627282930>>

  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x500/style/
IETFUtils.java 397 vBuf.insert(index, "\\");
410 vBuf.insert(start, "\\");
419 vBuf.insert(endBuf, '\\');
  /external/chromium_org/third_party/WebKit/Source/core/html/parser/
HTMLDocumentParser.cpp 618 void HTMLDocumentParser::insert(const SegmentedString& source) function in class:WebCore::HTMLDocumentParser
623 TRACE_EVENT0("webkit", "HTMLDocumentParser::insert");
732 // easily use the insert() method, so we hack append() for them to be synchronous.
735 // from insert() so that only document.write() uses insert.
    [all...]
  /external/chromium_org/third_party/angle/src/compiler/
SymbolTable.h 193 bool insert(const TString &name, TSymbol &symbol) function in class:TSymbolTableLevel
198 tInsertResult result = level.insert(tLevelPair(name, &symbol));
203 bool insert(TSymbol &symbol) function in class:TSymbolTableLevel
205 return insert(symbol.getMangledName(), symbol);
270 bool insert(TSymbol& symbol) function in class:TSymbolTable
273 return table[currentLevel()]->insert(symbol);
280 return insert(*constant);
302 return insert(*function);
  /external/chromium_org/third_party/libxml/src/
dict.c 727 xmlDictEntryPtr insert; local
742 insert = NULL;
744 for (insert = &(dict->dict[key]); insert->next != NULL;
745 insert = insert->next) {
747 if ((insert->okey == okey) && (insert->len == len)) {
748 if (!memcmp(insert->name, name, len))
749 return(insert->name)
859 xmlDictEntryPtr insert; local
962 xmlDictEntryPtr insert; local
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
nv50_ir_util.h 102 virtual bool insert(void *) = 0; // insert after current position
184 inline void insert(void *data) { insertTail(data); } function in class:nv50_ir::DLList
200 virtual bool insert(void *data);
360 void insert(void *item, int& id) function in class:nv50_ir::ArrayList
426 void insert(const Interval&);
696 insert(obj, clone);
701 virtual void insert(const void *obj, void *clone) = 0;
723 virtual void insert(const void *obj, void *clone)
757 virtual void insert(const void *obj, void *clone
    [all...]
  /external/chromium_org/third_party/protobuf/python/google/protobuf/internal/
cpp_message.py 122 def insert(self, key, value): member in class:RepeatedScalarContainer
124 values.insert(key, value)
  /external/chromium_org/third_party/skia/src/core/
SkString.cpp 439 void SkString::insert(size_t offset, const char text[]) { function in class:SkString
440 this->insert(offset, text, text ? strlen(text) : 0);
443 void SkString::insert(size_t offset, const char text[], size_t len) { function in class:SkString
456 /* If we're the only owner, and we have room in our allocation for the insert,
502 this->insert(offset, buffer, len);
509 this->insert(offset, buffer, stop - buffer);
515 this->insert(offset, buffer, stop - buffer);
521 this->insert(offset, buffer, stop - buffer);
527 this->insert(offset, buffer, stop - buffer);
549 this->insert(offset, p, buffer + sizeof(buffer) - p)
    [all...]
  /external/clang/lib/ARCMigrate/
ARCMT.cpp 185 PPOpts.Includes.insert(PPOpts.Includes.begin(), OriginalFile);
528 virtual void insert(SourceLocation loc, StringRef text) { function in class:__anon15664::RewritesApplicator
532 Listener->insert(loc, text);
  /external/dexmaker/src/dx/java/com/android/dx/dex/code/
OutputFinisher.java 230 * @param at {@code >= 0;} what index to insert at
231 * @param insn {@code non-null;} the instruction to insert
233 public void insert(int at, DalvInsn insn) { method in class:OutputFinisher
239 * Helper for {@link #add} and {@link #insert},
  /external/eigen/Eigen/src/SparseCore/
SparseVector.h 140 inline Scalar& insert(Index row, Index col) function in class:Eigen::SparseVector
145 return insert(inner);
147 Scalar& insert(Index i) function in class:Eigen::SparseVector
284 /** \deprecated use insert(Index,Index) */
291 /** \deprecated use insert(Index) */
294 return insert(i);
320 insert(i) = it.value();
  /external/javassist/src/main/javassist/bytecode/analysis/
Executor.java 265 int insert = end - (opcode - DUP_X1) - 1; local
268 while (end > insert) {
272 frame.setStack(insert, type);
282 int insert = end - (opcode - DUP2_X1) - 1; local
287 while (end > insert) {
291 frame.setStack(insert, type2);
292 frame.setStack(insert - 1, type1);
    [all...]
  /external/kernel-headers/original/linux/netfilter/
nf_conntrack_common.h 151 unsigned int insert; member in struct:ip_conntrack_stat
  /external/libxml2/
dict.c 760 xmlDictEntryPtr insert; local
775 insert = NULL;
777 for (insert = &(dict->dict[key]); insert->next != NULL;
778 insert = insert->next) {
780 if ((insert->okey == okey) && (insert->len == len)) {
781 if (!memcmp(insert->name, name, len))
782 return(insert->name)
892 xmlDictEntryPtr insert; local
995 xmlDictEntryPtr insert; local
    [all...]
hash.c 526 xmlHashEntryPtr insert; local
557 insert = NULL;
560 for (insert = &(table->table[key]); insert->next != NULL;
561 insert = insert->next) {
562 if ((insert->name == name) &&
563 (insert->name2 == name2) &&
564 (insert->name3 == name3))
568 if ((insert->name == name) &
642 xmlHashEntryPtr insert; local
    [all...]
  /external/llvm/include/llvm/ADT/
StringMap.h 320 /// insert - Insert the specified key/value pair into the map. If the key
322 /// insert it and return true.
323 bool insert(MapEntryTy *KeyValue) { function in class:llvm::StringMap
358 /// exists, return it. Otherwise, default construct a value, insert it, and
ValueMap.h 133 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { function in class:llvm::ValueMap
135 Map.insert(std::make_pair(Wrap(KV.first), KV.second));
139 /// insert - Range insertion of pairs.
141 void insert(InputIt I, InputIt E) { function in class:llvm::ValueMap
143 insert(*I);
242 Copy.Map->insert(std::make_pair(typed_new_key, Target));
  /external/llvm/include/llvm/CodeGen/
MachineInstrBuilder.h 251 BB.insert(I, MI);
262 BB.insert(I, MI);
290 BB.insert(I, MI);
300 BB.insert(I, MI);
378 BB.insert(I, MI);
455 /// Insert MI into this bundle before I which must point to an instruction in
457 MIBundleBuilder &insert(MachineBasicBlock::instr_iterator I, function in class:llvm::MIBundleBuilder
459 MBB.insert(I, MI);
477 /// Insert MI into MBB by prepending it to the instructions in the bundle.
480 return insert(begin(), MI)
    [all...]
  /external/llvm/lib/IR/
ConstantsContext.h 552 std::pair<typename MapTy::iterator, bool> IP = Map.insert(InsertVal);
585 I = Map.insert(I, std::make_pair(MapKey(Ty, V), Result));
588 InverseMap.insert(std::make_pair(Result, I));
754 /// Insert the constant into its proper slot.
755 void insert(ConstantClass *CP) { function in class:llvm::ConstantAggrUniqueMap
  /external/llvm/tools/llvm-diff/
DifferenceEngine.cpp 48 /// Insert a new value on the heap.
49 void insert(const T &V) { function in class:__anon22366::PriorityQueue
169 Queue.insert(BlockPair(L, R));
213 TentativeValues.insert(std::make_pair(LeftI, RightI));
527 TentativeValues.insert(std::make_pair(&*LI, &*RI));
659 LNames.insert(LFn->getName());
  /external/mesa3d/src/gallium/drivers/nv50/codegen/
nv50_ir_util.h 102 virtual bool insert(void *) = 0; // insert after current position
184 inline void insert(void *data) { insertTail(data); } function in class:nv50_ir::DLList
200 virtual bool insert(void *data);
360 void insert(void *item, int& id) function in class:nv50_ir::ArrayList
426 void insert(const Interval&);
696 insert(obj, clone);
701 virtual void insert(const void *obj, void *clone) = 0;
723 virtual void insert(const void *obj, void *clone)
757 virtual void insert(const void *obj, void *clone
    [all...]
  /external/skia/src/core/
SkString.cpp 439 void SkString::insert(size_t offset, const char text[]) { function in class:SkString
440 this->insert(offset, text, text ? strlen(text) : 0);
443 void SkString::insert(size_t offset, const char text[], size_t len) { function in class:SkString
456 /* If we're the only owner, and we have room in our allocation for the insert,
502 this->insert(offset, buffer, len);
509 this->insert(offset, buffer, stop - buffer);
515 this->insert(offset, buffer, stop - buffer);
521 this->insert(offset, buffer, stop - buffer);
527 this->insert(offset, buffer, stop - buffer);
549 this->insert(offset, p, buffer + sizeof(buffer) - p)
    [all...]
  /external/stlport/src/
locale_impl.cpp 120 void _Locale_impl::insert(_Locale_impl *from, const locale::id& n) { function in class:_Locale_impl
122 this->insert(from->facets_vec[n._M_index], n);
126 locale::facet* _Locale_impl::insert(locale::facet *f, const locale::id& n) { function in class:_Locale_impl
156 this->insert(i2, ctype<char>::id);
157 this->insert(i2, codecvt<char, char, mbstate_t>::id);
159 this->insert(i2, ctype<wchar_t>::id);
160 this->insert(i2, codecvt<wchar_t, char, mbstate_t>::id);
212 this->insert(ct, ctype<char>::id);
213 this->insert(cvt, codecvt<char, char, mbstate_t>::id);
215 this->insert(wct, ctype<wchar_t>::id)
    [all...]
  /external/stlport/stlport/stl/
_string.c 280 void basic_string<_CharT,_Traits,_Alloc>::insert(iterator __pos, function in class:_Alloc
382 insert(__last, __n - __len, __c);
406 // We have to deal with possible reallocation because we do insert first.
_string_sum.h 156 //insert
157 _BString& insert(size_type __pos, const _BString& __s) {return _M_get_storage().insert(__pos, __s);} function in class:__bstr_sum
158 _BString& insert(size_type __pos, const _BString& __s, size_type __beg, size_type __n) function in class:__bstr_sum
159 {return _M_get_storage().insert(__pos, __s, __beg, __n);}
160 _BString& insert(size_type __pos, const _CharT* __s, size_type __n) {return _M_get_storage().insert(__pos, __s, __n);} function in class:__bstr_sum
161 _BString& insert(size_type __pos, const _CharT* __s) {return _M_get_storage().insert(__pos, __s);} function in class:__bstr_sum
162 _BString& insert(size_type __pos, size_type __n, _CharT __c) {return _M_get_storage().insert(__pos, __n, __c); function in class:__bstr_sum
    [all...]
  /external/stlport/stlport/stl/pointers/
_deque.h 187 insert(end(), __first, __last);
197 { insert(end(), __first, __last); }
289 iterator insert(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type)) function in class:deque
291 iterator insert(iterator __pos, const value_type& __x)
293 { return ite_cast_traits::to_value_type_ite(_M_impl.insert(ite_cast_traits::to_storage_type_ite(__pos),
297 iterator insert(iterator __pos) { return insert(__pos, _STLP_DEFAULT_CONSTRUCTED(value_type)); } function in class:deque
300 void insert(iterator __pos, size_type __n, const value_type& __x) function in class:deque
301 { _M_impl.insert(ite_cast_traits::to_storage_type_ite(__pos), __n, cast_traits::to_storage_type_cref(__x)); }
309 _M_impl.insert(ite_cast_traits::to_storage_type_ite(__pos), __n, __val)
325 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { function in class:deque
336 void insert(iterator __pos, function in class:deque
342 void insert(iterator __pos, function in class:deque
    [all...]

Completed in 1157 milliseconds

<<21222324252627282930>>