| /external/llvm/include/llvm/ADT/ |
| DenseSet.h | 117 std::pair<iterator, bool> insert(const ValueT &V) { function in class:llvm::DenseSet
118 return TheMap.insert(std::make_pair(V, 0));
123 void insert(InputIt I, InputIt E) { function in class:llvm::DenseSet
125 insert(*I);
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| 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/ |
| 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/mesa3d/src/mesa/tnl/ |
| t_vertex.h | 75 tnl_insert_func insert[4]; member in struct:tnl_format_info
|
| /external/qemu/distrib/sdl-1.2.15/src/cdrom/freebsd/ |
| 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/ |
| SDL_syscdrom.c | 197 char *insert; local
201 insert = SDL_strchr(drive, '?');
202 if ( insert != NULL ) {
203 *insert = j;
|
| /external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
| ShadowArrayAdapter.java | 103 public void insert(T object, int index) { method in class:ShadowArrayAdapter
|
| /external/skia/src/animator/ |
| 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/skia/src/core/ |
| SkBitmapHeap.cpp | 235 // insert ourselves into the bitmapIndex
237 *fLookupTable.insert(index) = SkNEW_ARGS(LookupEntry, (indexEntry));
279 int32_t SkBitmapHeap::insert(const SkBitmap& originalBitmap) { function in class:SkBitmapHeap
337 copySucceeded = fExternalStorage->insert(originalBitmap, entry->fSlot);
|
| /external/skia/src/pathops/ |
| 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
|
| /external/stlport/stlport/stl/ |
| _vector.c | 223 vector<_Tp, _Alloc>::insert(iterator __pos, const _Tp& __x) { function in class:_Alloc
|
| /external/stlport/test/unit/ |
| deque_test.cpp | 25 CPPUNIT_TEST(insert);
37 void insert();
80 void DequeTest::insert() function in class:DequeTest
91 dit = d.insert(d.begin(), 3);
98 dit = d.insert(d.begin() + 1, 4);
105 dit = d.insert(d.end(), 5);
112 dit = d.insert(d.end() - 1, 6);
119 d.insert(d.begin(), 2, 7);
125 //There is more elements to insert than elements before insertion position
126 d.insert(d.begin() + 1, 2, 8)
[all...] |
| /external/v8/benchmarks/spinning-balls/ |
| splay-tree.js | 62 * @param {number} key Key to insert into the tree.
63 * @param {*} value Value to insert into the tree.
65 SplayTree.prototype.insert = function(key, value) {
114 // Insert the original right child as the right child of the new
|
| /external/v8/benchmarks/ |
| splay.js | 72 // Insert new node with a unique key.
78 splayTree.insert(key, payload);
157 * @param {number} key Key to insert into the tree.
158 * @param {*} value Value to insert into the tree.
160 SplayTree.prototype.insert = function(key, value) {
209 // Insert the original right child as the right child of the new
|
| /external/v8/tools/ |
| splaytree.js | 64 * @param {number} key Key to insert into the tree.
65 * @param {*} value Value to insert into the tree.
67 SplayTree.prototype.insert = function(key, value) {
116 // Insert the original right child as the right child of the new
|
| /frameworks/av/media/libstagefright/foundation/ |
| AString.cpp | 265 void AString::insert(const AString &from, size_t insertionPos) { function in class:android::AString
266 insert(from.c_str(), from.size(), insertionPos);
269 void AString::insert(const char *from, size_t size, size_t insertionPos) { function in class:android::AString
|
| /frameworks/base/core/java/android/content/ |
| IContentProvider.java | 41 public Uri insert(String callingPkg, Uri url, ContentValues initialValues) method in interface:IContentProvider
|
| /frameworks/base/core/java/android/text/method/ |
| CharacterPickerDialog.java | 52 * the sense of <code>insert</code>) into <code>text</code>.
56 boolean insert) {
62 mInsert = insert;
96 mText.insert(selEnd, replace);
|
| /frameworks/base/core/tests/coretests/src/android/app/activity/ |
| LocalProvider.java | 59 // insert alarms
60 db.execSQL("INSERT INTO data (text, integer) VALUES ('first data', 100);");
154 public Uri insert(Uri url, ContentValues initialValues) { method in class:LocalProvider
|
| /frameworks/base/core/tests/coretests/src/android/content/ |
| MemoryFileProvider.java | 77 // insert alarms
82 db.insert("data", null, values);
168 public Uri insert(Uri url, ContentValues initialValues) { method in class:MemoryFileProvider
169 throw new UnsupportedOperationException("insert not supported");
|
| /frameworks/base/tests/LocationTracker/src/com/android/locationtracker/data/ |
| TrackerProvider.java | 99 public Uri insert(Uri uri, ContentValues values) { method in class:TrackerProvider
101 long rowId = db.insert(TABLE_NAME, null, values);
|
| /hardware/qcom/media/mm-video-legacy/vidc/vdec/inc/ |
| Map.h | 55 void insert(T,T2);
142 void Map<T,T2>::insert(T data, T2 data2) function in class:Map
|
| /hardware/qcom/media/mm-video-v4l2/vidc/vdec/inc/ |
| Map.h | 58 void insert(T,T2);
147 void Map<T,T2>::insert(T data, T2 data2) function in class:Map
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _vector.c | 223 vector<_Tp, _Alloc>::insert(iterator __pos, const _Tp& __x) { function in class:_Alloc
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| deque_test.cpp | 25 CPPUNIT_TEST(insert);
37 void insert();
80 void DequeTest::insert() function in class:DequeTest
91 dit = d.insert(d.begin(), 3);
98 dit = d.insert(d.begin() + 1, 4);
105 dit = d.insert(d.end(), 5);
112 dit = d.insert(d.end() - 1, 6);
119 d.insert(d.begin(), 2, 7);
125 //There is more elements to insert than elements before insertion position
126 d.insert(d.begin() + 1, 2, 8)
[all...] |
