| /device/generic/goldfish/opengl/system/egl/ |
| eglDisplay.cpp | 306 char *insert = ext; local
311 if (ext != insert) {
312 memcpy(insert, ext, len+1); // including space
314 insert += (len + 1);
320 *insert = '\0';
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3string.h | 115 pANTLR3_UINT8 (*insert) (struct ANTLR3_STRING_struct * string, ANTLR3_UINT32 point, const char * newbit); member in struct:ANTLR3_STRING_struct
|
| /external/chromium_org/android_webview/java/src/org/chromium/android_webview/ |
| HttpAuthDatabase.java | 173 mDatabase.insert(HTTPAUTH_TABLE_NAME, HTTPAUTH_HOST_COL, c);
|
| /external/chromium_org/android_webview/test/shell/src/org/chromium/android_webview/test/ |
| TestContentProvider.java | 103 public Uri insert(Uri uri, ContentValues values) { method in class:TestContentProvider
|
| /external/chromium_org/base/containers/ |
| small_map.h | 98 // on any call to erase(), insert() and operator[].
439 std::pair<iterator, bool> insert(const value_type& x) { function in class:base::SmallMap
450 std::pair<typename NormalMap::iterator, bool> ret = map_->insert(x);
457 std::pair<typename NormalMap::iterator, bool> ret = map_->insert(x);
464 void insert(InputIterator f, InputIterator l) { function in class:base::SmallMap
466 insert(*f);
604 // Insert elements into it.
606 map_->insert(*temp_array[i]);
|
| /external/chromium_org/extensions/common/permissions/ |
| base_set_operators.h | 98 insert(it->Clone());
156 set3->insert(it1->Clone());
163 set3->insert(p);
170 set3->insert(it1->Clone());
192 set3->insert(p);
211 set3->insert(it2->Clone());
218 set3->insert(it1->Clone());
224 set3->insert(it1->Clone());
227 set3->insert(it2->Clone());
230 set3->insert(it1->Union(*it2))
262 void insert(ElementType* item) { function in class:extensions::BaseSetOperators
[all...] |
| /external/chromium_org/third_party/libxml/src/ |
| hash.c | 490 xmlHashEntryPtr insert; local
521 insert = NULL;
524 for (insert = &(table->table[key]); insert->next != NULL;
525 insert = insert->next) {
526 if ((insert->name == name) &&
527 (insert->name2 == name2) &&
528 (insert->name3 == name3))
532 if ((insert->name == name) &
606 xmlHashEntryPtr insert; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_build_util.h | 45 inline void insert(Instruction *);
144 inline Value *insert(ValueMap&, unsigned i, unsigned c, Value *v);
234 void BuildUtil::insert(Instruction *i) function in class:nv50_ir::BuildUtil
253 insert(insn);
300 BuildUtil::DataArray::insert(ValueMap &m, unsigned i, unsigned c, Value *v)
302 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/chromium_org/third_party/pexpect/ |
| screen.py | 182 def insert (self, ch): member in class:screen
392 # Insert line Esc [ Pn L
|
| /external/chromium_org/third_party/re2/util/ |
| 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
|
| /external/chromium_org/third_party/skia/include/core/ |
| SkString.h | 167 void insert(size_t offset, const SkString& src) { this->insert(offset, src.c_str(), src.size()); } function in class:SkString
168 void insert(size_t offset, const char text[]);
169 void insert(size_t offset, const char text[], size_t len);
178 void append(const SkString& str) { this->insert((size_t)-1, str); }
179 void append(const char text[]) { this->insert((size_t)-1, text); }
180 void append(const char text[], size_t len) { this->insert((size_t)-1, text, len); }
189 void prepend(const SkString& str) { this->insert(0, str); }
190 void prepend(const char text[]) { this->insert(0, text); }
191 void prepend(const char text[], size_t len) { this->insert(0, text, len);
[all...] |
| SkTDArray.h | 193 T* insert(int index) { function
194 return this->insert(index, 1, NULL);
196 T* insert(int index, int count, const T* src = NULL) { function
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkRTree.cpp | 47 void SkRTree::insert(void* data, const SkIRect& bounds, bool defer) { function in class:SkRTree
68 Branch* newSibling = insert(fRoot.fChild.subtree, &newBranch);
92 this->insert(fRoot.fChild.subtree, &fDeferredInserts[0]);
131 SkRTree::Branch* SkRTree::insert(Node* root, Branch* branch, uint16_t level) { function in class:SkRTree
135 toInsert = this->insert(root->child(childIndex)->fChild.subtree, branch, level);
476 // since we check for empty bounds on insert, we know we'll never have empty rects
|
| /external/chromium_org/third_party/skia/src/pdf/ |
| SkPDFTypes.cpp | 434 SkPDFObject* SkPDFDict::insert(SkPDFName* key, SkPDFObject* value) { function in class:SkPDFDict
443 SkPDFObject* SkPDFDict::insert(const char key[], SkPDFObject* value) { function in class:SkPDFDict
|
| /external/clang/include/clang/AST/ |
| ASTVector.h | 217 iterator insert(ASTContext &C, iterator I, const T &Elt) { function in class:clang::ASTVector
238 iterator insert(ASTContext &C, iterator I, size_type NumToInsert, function in class:clang::ASTVector
281 // Insert the non-overwritten middle part.
287 iterator insert(ASTContext &C, iterator I, ItTy From, ItTy To) { function in class:clang::ASTVector
333 // Insert the non-overwritten middle part.
|
| /external/clang/include/clang/Analysis/Support/ |
| 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/ |
| RewriteRope.h | 54 /// For example, we could have a 1M RopePiece and want to insert something
171 void insert(unsigned Offset, const RopePiece &R);
217 Chunks.insert(0, MakeRopeString(Start, End));
220 void insert(unsigned Offset, const char *Start, const char *End) { function in class:clang::RewriteRope
221 assert(Offset <= size() && "Invalid position to insert!");
223 Chunks.insert(Offset, MakeRopeString(Start, End));
|
| /external/clang/lib/Frontend/ |
| DiagnosticRenderer.cpp | 82 virtual void insert(SourceLocation loc, StringRef text) { function in class:__anon15868::FixitReceiver
111 commit.insert(Hint.RemoveRange.getBegin(), Hint.CodeToInsert,
|
| /external/clang/tools/arcmt-test/ |
| arcmt-test.cpp | 89 virtual void insert(SourceLocation loc, StringRef text) { function in class:__anon17219::PrintTransforms
91 OS << "Insert: ";
|
| /external/dexmaker/src/dx/java/com/android/dx/util/ |
| IntList.java | 228 * that index up one. May not be used to insert at an index beyond the
232 * @param n {@code >= 0, <=size();} index of where to insert
233 * @param value value to insert
235 public void insert(int n, int value) { method in class:IntList
|
| /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/libvpx/libvpx/examples/includes/HTML-Toc-0.91/ |
| TocInsertor.pm | 2 # function: Insert Table of Contents HTML::Toc, generated by
55 # Bias to not insert ToC
138 # No, insert only;
177 # No, insert;
191 # function: Insert ToC in string.
201 # Generate & insert ToC
205 # No, just insert ToC
206 # Insert by parsing file
215 # function: Do insert generated ToCs in file.
216 # args: - $aToc: (reference to array of) ToC object(s) to insert
718 sub insert { subroutine
[all...] |
| /external/llvm/include/llvm/ADT/ |
| 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 reques
195 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
|
