| /external/compiler-rt/lib/msan/ |
| msan_report.cc | 154 int insert(u32 o) { function in class:__msan::OriginSet
231 id = origin_set.insert(o);
|
| /external/guava/guava/src/com/google/common/collect/ |
| HashBiMap.java | 159 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/guava/guava-tests/benchmark/com/google/common/util/concurrent/ |
| MonitorBasedArrayBlockingQueue.java | 104 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/icu/android_icu4j/src/main/java/android/icu/impl/ |
| Punycode.java | 389 /* Insert n at position i of the output: */
428 /* BMP, insert one code unit */
429 dest.insert(codeUnitIndex, (char)n);
431 /* supplementary character, insert two code units */
432 dest.insert(codeUnitIndex, UTF16.getLeadSurrogate(n));
433 dest.insert(codeUnitIndex+1, UTF16.getTrailSurrogate(n));
|
| /external/icu/icu4c/source/i18n/ |
| number_stringbuilder.cpp | 163 return insert(fLength, unistr, field, status);
166 int32_t NumberStringBuilder::insert(int32_t index, const UnicodeString &unistr, Field field, function in class:NumberStringBuilder
169 // Nothing to insert.
172 // Fast path: insert using insertCodePoint.
175 return insert(index, unistr, 0, unistr.length(), field, status);
180 NumberStringBuilder::insert(int32_t index, const UnicodeString &unistr, int32_t start, int32_t end, function in class:NumberStringBuilder
195 return insert(fLength, other, status);
199 NumberStringBuilder::insert(int32_t index, const NumberStringBuilder &other, UErrorCode &status) { function in class:NumberStringBuilder
206 // Nothing to insert.
256 // caller wants to insert
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| Punycode.java | 387 /* Insert n at position i of the output: */
426 /* BMP, insert one code unit */
427 dest.insert(codeUnitIndex, (char)n);
429 /* supplementary character, insert two code units */
430 dest.insert(codeUnitIndex, UTF16.getLeadSurrogate(n));
431 dest.insert(codeUnitIndex+1, UTF16.getTrailSurrogate(n));
|
| /external/ims/rcs/presencepolling/src/com/android/service/ims/presence/ |
| DatabaseContentProvider.java | 248 * insertInternal allows getContentResolver().insert() to occur atomically
250 * rows were added to the db) - otherwise, it functions exactly as getContentResolver().insert()
252 * @param uri - uri on which to insert
253 * @param values - values to insert
259 public Uri insert(Uri uri, ContentValues values) { method in class:DatabaseContentProvider
|
| /external/jdiff/src/jdiff/ |
| API.java | 298 sb.insert(i+1, "EsS_tHaN");
301 sb.insert(i+1, "Nd_cHaR");
304 sb.insert(i+1, "uote_cHaR");
399 sb.insert(i, "/");
416 sb.insert(i+1, "#045;");
425 sb.insert(i, ">");
|
| /external/ksoap2/ksoap2-base/src/main/java/org/ksoap2/kdom/ |
| Node.java | 68 types.insert(index, (char) type);
|
| /external/libchrome/base/containers/ |
| small_map.h | 99 // on any call to erase(), insert() and operator[].
440 std::pair<iterator, bool> insert(const value_type& x) { function in class:base::SmallMap
451 std::pair<typename NormalMap::iterator, bool> ret = map_->insert(x);
458 std::pair<typename NormalMap::iterator, bool> ret = map_->insert(x);
465 void insert(InputIterator f, InputIterator l) { function in class:base::SmallMap
467 insert(*f);
602 // Insert elements into it.
604 map_->insert(std::move(*temp_array[i]));
|
| /external/libcups/cups/ |
| array.c | 49 insert, /* Last inserted element */ member in struct:_cups_array_s
69 static int cups_array_add(cups_array_t *a, void *e, int insert);
243 a->insert = -1;
380 da->insert = a->insert;
587 return (a->insert);
611 * 'cupsArrayInsert()' - Insert an element in the array.
637 * Insert the element...
755 a->insert = -1;
926 if (current < a->insert)
[all...] |
| /external/libcxx/test/support/ |
| nasty_containers.hpp | 102 iterator insert(const_iterator pos, const value_type& x) { return v_.insert(pos, x); } function in class:nasty_vector
104 iterator insert(const_iterator pos, value_type&& x) { return v_.insert(pos, std::forward<value_type>(x)); } function in class:nasty_vector
106 iterator insert(const_iterator pos, size_type n, const value_type& x) { return v_.insert(pos, n, x); } function in class:nasty_vector
108 iterator insert(const_iterator pos, InputIterator first, InputIterator last) function in class:nasty_vector
109 { return v_.insert(pos, first, last); }
112 iterator insert(const_iterator pos, std::initializer_list<value_type> il) { return v_.insert(pos, il); 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/llvm/include/llvm/ADT/ |
| DenseSet.h | 152 std::pair<iterator, bool> insert(const ValueT &V) { function in class:llvm::DenseSet
154 return TheMap.insert(std::make_pair(V, Empty));
157 /// Alternative version of insert that uses a different (and possibly less
172 void insert(InputIt I, InputIt E) { function in class:llvm::DenseSet
174 insert(*I);
|
| EquivalenceClasses.h | 26 /// 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 reques
196 iterator insert(const ElemTy &Data) { function in class:llvm::EquivalenceClasses
[all...] |
| 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/include/llvm/CodeGen/GlobalISel/ |
| RegBankSelect.h | 100 /// before we actually need to insert something.
103 /// Tell if the insert point has already been materialized.
136 /// MachineBasicBlock::insert. I.e., additional code happens
155 /// MachineBasicBlock::insert and ::getPoint. The new code should
168 /// Insert \p MI in the just before ::getPoint()
169 MachineBasicBlock::iterator insert(MachineInstr &MI) { function in class:llvm::RegBankSelect::InsertPoint
170 return getInsertMBB().insert(getPoint(), &MI);
243 // If we try to insert before phis, we should use the insertion
247 // If we try to insert after the terminators, we should use the
302 Insert,
[all...] |
| /external/llvm/include/llvm/MC/ |
| MCInst.h | 179 iterator insert(iterator I, const MCOperand &Op) { function in class:llvm::MCInst
180 return Operands.insert(I, Op);
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64AddressTypePromotion.cpp | 108 /// - Inst is used only once (no need to insert truncate).
188 // 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 || AlreadySeen != SeenChains.end())
[all...] |
| /external/llvm/lib/Target/Hexagon/ |
| HexagonBitSimplify.cpp | 55 RegisterSet &insert(unsigned R) { function in struct:__anon27657::RegisterSet
67 RegisterSet &insert(const RegisterSet &Rs) { function in struct:__anon27657::RegisterSet
228 NewAVs.insert(Defs);
251 Defs.insert(R);
263 Uses.insert(R);
[all...] |
| HexagonGenInsert.cpp | 39 static cl::opt<unsigned> VRegIndexCutoff("insert-vreg-cutoff", cl::init(~0U),
40 cl::Hidden, cl::ZeroOrMore, cl::desc("Vreg# cutoff for insert generation."));
43 static cl::opt<unsigned> VRegDistCutoff("insert-dist-cutoff", cl::init(30U),
44 cl::Hidden, cl::ZeroOrMore, cl::desc("Vreg distance cutoff for insert "
47 static cl::opt<bool> OptTiming("insert-timing", cl::init(false), cl::Hidden,
48 cl::ZeroOrMore, cl::desc("Enable timing of insert generation"));
49 static cl::opt<bool> OptTimingDetail("insert-timing-detail", cl::init(false),
50 cl::Hidden, cl::ZeroOrMore, cl::desc("Enable detailed timing of insert "
53 static cl::opt<bool> OptSelectAll0("insert-all0", cl::init(false), cl::Hidden,
55 static cl::opt<bool> OptSelectHas0("insert-has0", cl::init(false), cl::Hidden
97 RegisterSet &insert(unsigned R) { function in struct:__anon27683::RegisterSet
109 RegisterSet &insert(const RegisterSet &Rs) { function in struct:__anon27683::RegisterSet
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| SROA.cpp | 223 /// \brief Insert new slices for this alloca.
228 void insert(ArrayRef<Slice> NewSlices) { function in class:llvm::sroa::AllocaSlices
629 if (VisitedDeadInsts.insert(&I).second)
[all...] |
| /external/mesa3d/src/compiler/glsl/ |
| loop_analysis.cpp | 93 loop_state::insert(ir_loop *ir) function in class:loop_state
121 loop_variable_state::insert(ir_variable *var) function in class:loop_variable_state
136 loop_variable_state::insert(ir_if *if_stmt) function in class:loop_variable_state
166 lv = this->insert(var);
266 loop_variable_state *ls = this->loops->insert(ir);
299 ls->insert(if_stmt);
|
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_build_util.h | 45 inline void insert(Instruction *);
154 inline Value *insert(ValueMap&, unsigned i, unsigned c, Value *v);
244 void BuildUtil::insert(Instruction *i) function in class:nv50_ir::BuildUtil
263 insert(insn);
318 BuildUtil::DataArray::insert(ValueMap &m, unsigned i, unsigned c, Value *v)
320 m.insert(Location(array, arrayIdx, i, c), v);
|
| 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);
|
| /external/mesa3d/src/gallium/state_trackers/clover/core/ |
| kernel.cpp | 313 insert(T &v, const T &w) { function in namespace:__anon30189
314 v.insert(v.end(), w.begin(), w.end());
395 insert(ctx.input, w);
427 insert(ctx.input, v);
463 insert(ctx.input, v);
492 insert(ctx.input, v);
528 insert(ctx.input, v);
559 insert(ctx.input, v);
|
