HomeSort by relevance Sort by last modified time
    Searched defs:insert (Results 201 - 225 of 1132) sorted by null

1 2 3 4 5 6 7 891011>>

  /development/samples/MySampleRss/src/com/example/codelab/rssexample/
RssContentProvider.java 180 public Uri insert(Uri requestUri, ContentValues initialValues) { method in class:RssContentProvider
185 rowId = mDb.insert(DATABASE_TABLE_NAME, "rawcontent", initialValues);
  /development/samples/SearchableDictionary/src/com/example/android/searchabledict/
DictionaryProvider.java 189 public Uri insert(Uri uri, ContentValues values) { method in class:DictionaryProvider
  /external/blktrace/btt/
proc.c 157 static void insert(struct p_info *pip) function
218 insert(pip);
  /external/chromium_org/base/containers/
scoped_ptr_hash_map.h 38 std::pair<iterator, bool> insert( function in class:base::ScopedPtrHashMap
40 return data_.insert(
50 return data_.insert(std::pair<Key, Value*>(key, raw_ptr));
56 return data_.insert(std::pair<Key, Value*>(key, raw_ptr));
81 data_.insert(std::pair<Key, Value*>(key, static_cast<Value*>(NULL)));
  /external/chromium_org/base/memory/
scoped_vector.h 103 iterator insert(iterator position, T* x) { function in class:ScopedVector
104 return v_.insert(position, x);
109 void insert(iterator position, InputIterator first, InputIterator last) { function in class:ScopedVector
110 v_.insert(position, first, last);
  /external/chromium_org/content/browser/indexed_db/
list_set.h 33 void insert(const T& elem) { function in class:list_set
36 set_.insert(elem);
  /external/chromium_org/net/base/
linked_hash_map.h 168 return (*((this->insert(std::make_pair(key, Value()))).first)).second;
172 std::pair<iterator, bool> insert(const std::pair<Key, Value>& pair) { function in class:linked_hash_map
175 // didn't insert anything.
179 // Otherwise, insert into the list first.
187 CHECK(map_.insert(std::make_pair(pair.first, last)).second)
  /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/
v8-splay.js 67 // Insert new node with a unique key.
72 splayTree.insert(key, GeneratePayloadTree(kSplayTreePayloadDepth, key));
151 * @param {number} key Key to insert into the tree.
152 * @param {*} value Value to insert into the tree.
154 SplayTree.prototype.insert = function(key, value) {
203 // Insert the original right child as the right child of the new
  /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/
v8-splay.js 67 // Insert new node with a unique key.
72 splayTree.insert(key, GeneratePayloadTree(kSplayTreePayloadDepth, key));
151 * @param {number} key Key to insert into the tree.
152 * @param {*} value Value to insert into the tree.
154 SplayTree.prototype.insert = function(key, value) {
203 // Insert the original right child as the right child of the new
  /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/
v8-splay.js 67 // Insert new node with a unique key.
73 splayTree.insert(key, payload);
152 * @param {number} key Key to insert into the tree.
153 * @param {*} value Value to insert into the tree.
155 SplayTree.prototype.insert = function(key, value) {
204 // Insert the original right child as the right child of the new
  /external/chromium_org/third_party/WebKit/Source/platform/
Length.cpp 120 int insert(PassRefPtr<CalculationValue> calcValue) function in class:WebCore::CalculationValueHandleMap
175 m_intValue = calcHandles().insert(calc);
  /external/chromium_org/third_party/libxslt/libxslt/
templates.c 199 xmlNodePtr oldInsert, insert = NULL; local
214 insert = xmlNewDocNode(ctxt->output, NULL,
216 if (insert == NULL) {
221 oldInsert = ctxt->insert;
222 ctxt->insert = insert;
228 ctxt->insert = oldInsert;
230 ret = xmlNodeGetContent(insert);
231 if (insert != NULL)
232 xmlFreeNode(insert);
    [all...]
  /external/chromium_org/third_party/mesa/src/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/chromium_org/third_party/mesa/src/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/chromium_org/third_party/mesa/src/src/mesa/tnl/
t_vertex.h 75 tnl_insert_func insert[4]; member in struct:tnl_format_info
  /external/chromium_org/third_party/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/chromium_org/third_party/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/chromium_org/third_party/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/chromium_org/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/chromium_org/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/chromium_org/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
  /external/chromium_org/webkit/data/test_shell/sort/
sort.js 334 Sort.prototype.insert = function(from, to) {
  /external/clang/lib/Edit/
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/libvpx/libvpx/examples/includes/HTML-Toc-0.91/
TocUpdator.pm 438 #--- HTML::TocUpdator::insert() -----------------------------------------------
439 # function: Insert ToC in string.
441 # - $aString: string to insert ToC in.
444 sub insert { subroutine
447 # Do start insert
449 } # insert()
453 # function: Insert ToC in file.
455 # - $aFile: File to insert ToC in.
461 # Do start insert
520 # - $aToc: Reference to ToC to insert
    [all...]
  /external/libxslt/libxslt/
templates.c 198 xmlNodePtr oldInsert, insert = NULL; local
213 insert = xmlNewDocNode(ctxt->output, NULL,
215 if (insert == NULL) {
220 oldInsert = ctxt->insert;
221 ctxt->insert = insert;
227 ctxt->insert = oldInsert;
229 ret = xmlNodeGetContent(insert);
230 if (insert != NULL)
231 xmlFreeNode(insert);
    [all...]

Completed in 682 milliseconds

1 2 3 4 5 6 7 891011>>