/external/chromium_org/third_party/skia/src/animator/ |
H A D | SkTDArray_Experimental.h | 49 int32_t* insert(U16CPU index, U16CPU count, const int32_t* src); 121 T* insert(U16CPU index) { return this->insert(index, 1, NULL); } function in class:SkTDS32Array 122 T* insert(U16CPU index, U16CPU count, const T* src = NULL) { function in class:SkTDS32Array 123 return (T*) SkDS32Array::insert(index, count, (const int32_t*) src); }
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkBitmapHeap.cpp | 244 // insert ourselves into the bitmapIndex 246 *fLookupTable.insert(index) = SkNEW_ARGS(LookupEntry, (indexEntry)); 288 int32_t SkBitmapHeap::insert(const SkBitmap& originalBitmap) { function in class:SkBitmapHeap 346 copySucceeded = fExternalStorage->insert(originalBitmap, entry->fSlot);
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkIntersections.cpp | 12 insert(i[0][index], i[1][index], i.pt(index)); 64 int SkIntersections::insert(double one, double two, const SkDPoint& pt) { function in class:SkIntersections 125 (void) insert(one, two, pt1);
|
/external/chromium_org/third_party/webrtc/system_wrappers/interface/ |
H A D | scoped_vector.h | 113 iterator insert(iterator position, T* x) { function in class:webrtc::ScopedVector 114 return v_.insert(position, x); 119 void insert(iterator position, InputIterator first, InputIterator last) { function in class:webrtc::ScopedVector 120 v_.insert(position, first, last);
|
/external/chromium_org/v8/src/ |
H A D | hashmap.h | 46 // 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/Analysis/Support/ |
H A D | BumpVector.h | 160 /// insert - Insert some number of copies of element into a position. Return 162 iterator insert(iterator I, size_t Cnt, const_reference E, function in class:clang::BumpVector
|
/external/clang/include/clang/Rewrite/Core/ |
H A D | RewriteRope.h | 55 /// For example, we could have a 1M RopePiece and want to insert something 177 void insert(unsigned Offset, const RopePiece &R); 223 Chunks.insert(0, MakeRopeString(Start, End)); 226 void insert(unsigned Offset, const char *Start, const char *End) { function in class:clang::RewriteRope 227 assert(Offset <= size() && "Invalid position to insert!"); 229 Chunks.insert(Offset, MakeRopeString(Start, End));
|
/external/clang/lib/Edit/ |
H A D | Commit.cpp | 43 bool Commit::insert(SourceLocation loc, StringRef text, function in class:Commit 100 bool commitableBefore = insert(range.getBegin(), before, /*afterToken=*/false, 106 commitableAfter = insert(range.getEnd(), after);
|
/external/compiler-rt/lib/msan/ |
H A D | msan_report.cc | 154 int insert(u32 o) { function in class:__msan::OriginSet 235 id = origin_set.insert(o);
|
/external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
H A D | 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/libcxx/test/support/ |
H A D | nasty_containers.hpp | 103 iterator insert(const_iterator pos, const value_type& x) { return v_.insert(pos, x); } function in class:nasty_vector 105 iterator insert(const_iterator pos, value_type&& x) { return v_.insert(pos, std::forward<value_type>(x)); } function in class:nasty_vector 107 iterator insert(const_iterator pos, size_type n, const value_type& x) { return v_.insert(pos, n, x); } function in class:nasty_vector 109 iterator insert(const_iterator pos, InputIterator first, InputIterator last) function in class:nasty_vector 110 { return v_.insert(pos, first, last); } 113 iterator insert(const_iterator pos, std::initializer_list<value_type> il) { return v_.insert(po function in class:nasty_vector 224 iterator insert(const_iterator pos, const value_type& x) { return l_.insert(pos, x); } function in class:nasty_list 226 iterator insert(const_iterator pos, value_type&& x) { return l_.insert(pos, std::forward<value_type>(x)); } function in class:nasty_list 228 iterator insert(const_iterator pos, size_type n, const value_type& x) { return l_.insert(pos, n, x); } function in class:nasty_list 230 iterator insert(const_iterator pos, InputIterator first, InputIterator last) function in class:nasty_list 234 iterator insert(const_iterator pos, std::initializer_list<value_type> il) { return l_.insert(pos, il); } function in class:nasty_list [all...] |
/external/lldb/test/pexpect-2.4/ |
H A D | screen.py | 166 def insert (self, ch): member in class:screen
|
/external/llvm/include/llvm/ADT/ |
H A D | DenseSet.h | 116 std::pair<iterator, bool> insert(const ValueT &V) { function in class:llvm::DenseSet 117 return TheMap.insert(std::make_pair(V, 0)); 122 void insert(InputIt I, InputIt E) { function in class:llvm::DenseSet 124 insert(*I);
|
H A D | EquivalenceClasses.h | 25 /// supports three efficient operations: insert an element into a class of its 38 /// EC.unionSets(1, 2); // insert 1, 2 into the same set 39 /// EC.insert(4); EC.insert(5); // insert 4, 5 into own sets 127 member_iterator LeaderIt = member_begin(insert(*MI)); 129 unionSets(LeaderIt, member_begin(insert(*MI))); 175 member_iterator MI = findLeader(insert(V)); 193 /// insert - Insert a new value into the union/find set, ignoring the request 195 iterator insert(cons function in class:llvm::EquivalenceClasses [all...] |
H A D | ScopedHashTable.h | 17 // HT.insert(0, 0); 18 // HT.insert(1, 1); 21 // HT.insert(0, 42); 187 void insert(const K &Key, const V &Val) { function in class:llvm::ScopedHashTable 206 /// (possibly not the current) scope. While it is ok to insert into a scope 207 /// that isn't the current one, it isn't ok to insert *underneath* an existing
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64AddressTypePromotion.cpp | 106 /// - Inst is used only once (no need to insert truncate). 186 // If the Inst is used more that once, we may need to insert truncate 292 ToRemove.insert(Inst); 349 ToRemove.insert(SExt); 362 ToRemove.insert(SExt); 392 ToRemove.insert(Pt); 405 ToRemove.insert(Inst); 436 bool insert = false; local 443 insert = true; 464 if (insert || AlreadySee [all...] |
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_graph.cpp | 44 void Graph::insert(Node *node) function in class:nv50_ir::Graph 99 // insert head 121 graph->insert(node); 123 node->graph->insert(this);
|
H A D | nv50_ir_util.cpp | 63 DLList::Iterator::insert(void *data) function in class:nv50_ir::DLList::Iterator 93 this->insert(that); 123 break; // insert before 125 // insert after 189 void Interval::insert(const Interval &that) function in class:nv50_ir::Interval
|
/external/mesa3d/src/glsl/ |
H A D | loop_analysis.cpp | 53 loop_state::insert(ir_loop *ir) function in class:loop_state 79 loop_variable_state::insert(ir_variable *var) function in class:loop_variable_state 94 loop_variable_state::insert(ir_if *if_stmt) function in class:loop_variable_state 187 lv = ls->insert(var); 217 loop_variable_state *ls = this->loops->insert(ir); 250 ls->insert(if_stmt);
|
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
H A D | InsnList.java | 46 * {@link #set set}, {@link #insert(AbstractInsnNode, AbstractInsnNode)},
47 * {@link #insert(AbstractInsnNode, InsnList)}, {@link #remove remove} and
312 public void insert(final AbstractInsnNode insn) {
method in class:InsnList 336 public void insert(final InsnList insns) {
method in class:InsnList 368 public void insert(final AbstractInsnNode location, final AbstractInsnNode insn) {
method in class:InsnList 396 public void insert(final AbstractInsnNode location, final InsnList insns) {
method in class:InsnList
|
/external/qemu/android/base/containers/ |
H A D | PodVector.h | 209 // to use insert() directly, which will do the item copy for you. 219 void insert(size_t index, const T& item) { function in class:android::base::PodVector 230 // Append an item at the end of a vector. Specialized version of insert()
|
/external/qemu/distrib/sdl-1.2.15/src/cdrom/freebsd/ |
H A D | SDL_syscdrom.c | 188 char *insert; local 192 insert = SDL_strchr(drive, '?'); 193 if ( insert != NULL ) { 194 *insert = j;
|
/external/qemu/distrib/sdl-1.2.15/src/cdrom/openbsd/ |
H A D | SDL_syscdrom.c | 197 char *insert; local 201 insert = SDL_strchr(drive, '?'); 202 if ( insert != NULL ) { 203 *insert = j;
|
/external/qemu/distrib/sdl-1.2.15/src/cdrom/qnx/ |
H A D | SDL_syscdrom.c | 214 char* insert; local 220 insert = SDL_strchr(drive, '?'); 221 if (insert != NULL) 223 *insert = j;
|
/external/regex-re2/util/ |
H A D | sparse_array.h | 79 // To insert a new entry, set sparse_to_dense_[i] to size_, 163 pair<iterator, bool> insert(const value_type& new_value); 321 pair<typename SparseArray<Value>::iterator, bool> SparseArray<Value>::insert( function in class:re2::SparseArray
|