Searched defs:insert (Results 51 - 75 of 185) sorted by relevance

12345678

/external/clang/include/clang/Rewrite/Core/
H A DRewriteRope.h55 /// For example, we could have a 1M RopePiece and want to insert something
153 void insert(unsigned Offset, const RopePiece &R);
193 Chunks.insert(0, MakeRopeString(Start, End));
196 void insert(unsigned Offset, const char *Start, const char *End) { function in class:clang::RewriteRope
197 assert(Offset <= size() && "Invalid position to insert!");
199 Chunks.insert(Offset, MakeRopeString(Start, End));
/external/clang/lib/Edit/
H A DCommit.cpp43 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/clang/test/SemaCXX/
H A Dflexible-array-test.cpp6 void insert(const Key &, const T &);
12 void QMap<Key, T>::insert(const Key &, const T &avalue) function in class:QMap
41 eventForId.insert(ptr->wd, *ptr);
/external/compiler-rt/lib/msan/
H A Dmsan_report.cc154 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 DOutputFinisher.java230 * @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/guava/guava-tests/benchmark/com/google/common/util/concurrent/
H A DMonitorBasedArrayBlockingQueue.java104 private void insert(E x) { method in class:MonitorBasedArrayBlockingQueue
239 * which can fail to insert an element only by throwing an exception.
249 insert(e);
272 insert(e);
294 insert(e);
382 * <p>Note that you <em>cannot</em> always tell if an attempt to insert
385 * insert or remove an element.
/external/jetty/src/java/org/eclipse/jetty/webapp/
H A DOrdering.java94 //3. if <other> was specified, insert rest of the fragments
287 //If its in the no-others list, insert into this list so that we are before it
290 insert(list, idx1+1, b);
299 insert(list, idx2, f.getName());
329 insert(list,idx1, aResource);
337 insert(list,idx1, a);
448 protected void insert(List<Resource> list, int index, String fragName) method in class:Ordering.RelativeOrdering
454 insert(list, index, jar);
457 protected void insert(List<Resource> list, int index, Resource resource) method in class:Ordering.RelativeOrdering
/external/jmonkeyengine/engine/src/tools/jme3tools/optimize/
H A DTextureAtlas.java251 Node node = root.insert(image);
577 public Node insert(Image image) { method in class:TextureAtlas.Node
579 Node newNode = child[0].insert(image);
585 return child[1].insert(image);
611 return child[0].insert(image);
/external/libcxx/test/support/
H A Dnasty_containers.hpp103 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 Dscreen.py166 def insert (self, ch): member in class:screen
/external/llvm/include/llvm/ADT/
H A DDenseSet.h147 std::pair<iterator, bool> insert(const ValueT &V) { function in class:llvm::DenseSet
149 return TheMap.insert(std::make_pair(V, Empty));
154 void insert(InputIt I, InputIt E) { function in class:llvm::DenseSet
156 insert(*I);
H A DEquivalenceClasses.h26 /// supports three efficient operations: insert an element into a class of its
39 /// EC.unionSets(1, 2); // insert 1, 2 into the same set
40 /// EC.insert(4); EC.insert(5); // insert 4, 5 into own sets
128 member_iterator LeaderIt = member_begin(insert(*MI));
130 unionSets(LeaderIt, member_begin(insert(*MI)));
176 member_iterator MI = findLeader(insert(V));
194 /// insert - Insert a new value into the union/find set, ignoring the request
196 iterator insert(cons function in class:llvm::EquivalenceClasses
[all...]
H A DMapVector.h77 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
91 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { function in class:llvm::MapVector
93 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
H A DScopedHashTable.h17 // 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/include/llvm/MC/
H A DMCInst.h180 iterator insert(iterator I, const MCOperand &Op) { function in class:llvm::MCInst
181 return Operands.insert(I, Op);
/external/llvm/lib/Target/AArch64/
H A DAArch64AddressTypePromotion.cpp107 /// - Inst is used only once (no need to insert truncate).
187 // If the Inst is used more that once, we may need to insert truncate
293 ToRemove.insert(Inst);
350 ToRemove.insert(SExt);
363 ToRemove.insert(SExt);
393 ToRemove.insert(Pt);
406 ToRemove.insert(Inst);
437 bool insert = false; local
444 insert = true;
465 if (insert || AlreadySee
[all...]
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_graph.cpp44 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 Dnv50_ir_util.cpp63 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 Dloop_analysis.cpp53 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 DInsnList.java46 * {@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/regex-re2/util/
H A Dsparse_array.h79 // 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
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
H A DShadowSQLiteDatabase.java72 public long insert(String table, String nullColumnHack, ContentValues values) { method in class:ShadowSQLiteDatabase
94 PreparedStatement insert = connection.prepareStatement(sqlInsertString.sql, Statement.RETURN_GENERATED_KEYS);
99 insert.setObject(i++, columns.next());
101 insert.executeUpdate();
102 ResultSet resultSet = insert.getGeneratedKeys();
/external/skia/include/core/
H A DSkTDArray.h184 T* insert(int index) { function in class:SkTDArray
185 return this->insert(index, 1, NULL);
187 T* insert(int index, int count, const T* src = NULL) { function in class:SkTDArray
/external/skia/src/animator/
H A DSkTDArray_Experimental.h49 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/skia/src/core/
H A DSkBitmapHeap.cpp231 // insert ourselves into the bitmapIndex
233 *fLookupTable.insert(index) = SkNEW_ARGS(LookupEntry, (indexEntry));
275 int32_t SkBitmapHeap::insert(const SkBitmap& originalBitmap) { function in class:SkBitmapHeap
333 copySucceeded = fExternalStorage->insert(originalBitmap, entry->fSlot);

Completed in 3939 milliseconds

12345678