HomeSort by relevance Sort by last modified time
    Searched defs:insert (Results 176 - 200 of 541) sorted by null

1 2 3 4 5 6 78 91011>>

  /external/qemu/distrib/sdl-1.2.12/src/cdrom/qnx/
SDL_syscdrom.c 214 char* insert; local
220 insert = SDL_strchr(drive, '?');
221 if (insert != NULL)
223 *insert = j;
  /external/skia/include/core/
SkString.h 115 void insert(size_t offset, const SkString& src) { this->insert(offset, src.c_str(), src.size()); } function in class:SkString
116 void insert(size_t offset, const char text[]);
117 void insert(size_t offset, const char text[], size_t len);
124 void append(const SkString& str) { this->insert((size_t)-1, str); }
125 void append(const char text[]) { this->insert((size_t)-1, text); }
126 void append(const char text[], size_t len) { this->insert((size_t)-1, text, len); }
133 void prepend(const SkString& str) { this->insert(0, str); }
134 void prepend(const char text[]) { this->insert(0, text); }
135 void prepend(const char text[], size_t len) { this->insert(0, text, len);
    [all...]
SkTDArray.h 173 T* insert(size_t index) { function in class:SkTDArray
174 return this->insert(index, 1, NULL);
176 T* insert(size_t index, size_t count, const T* src = NULL) { function in class:SkTDArray
  /external/skia/src/core/
SkString.cpp 423 void SkString::insert(size_t offset, const char text[]) { function in class:SkString
424 this->insert(offset, text, text ? strlen(text) : 0);
427 void SkString::insert(size_t offset, const char text[], size_t len) { function in class:SkString
434 /* If we're the only owner, and we have room in our allocation for the insert,
480 this->insert(offset, buffer, len);
487 this->insert(offset, buffer, stop - buffer);
493 this->insert(offset, buffer, stop - buffer);
515 this->insert(offset, p, buffer + sizeof(buffer) - p);
521 this->insert(offset, buffer, stop - buffer);
  /external/skia/src/pdf/
SkPDFTypes.cpp 337 insert("Type", new SkPDFName(type))->unref();
371 SkPDFObject* SkPDFDict::insert(SkPDFName* key, SkPDFObject* value) { function in class:SkPDFDict
380 SkPDFObject* SkPDFDict::insert(const char key[], SkPDFObject* value) { function in class:SkPDFDict
383 return insert(keyName.get(), value);
  /external/stlport/stlport/stl/
_deque.c 115 insert(this->_M_finish, __mid, __x.end());
150 void deque<_Tp, _Alloc>::insert(iterator __pos, function in class:_Alloc
178 void deque<_Tp,_Alloc>::insert(iterator __pos, function in class:_Alloc
_hash_map.h 179 pair<iterator,bool> insert(const value_type& __obj) function in class:hash_map
183 void insert(_InputIterator __f, _InputIterator __l) function in class:hash_map
186 void insert(const value_type* __f, const value_type* __l) function in class:hash_map
188 void insert(const_iterator __f, const_iterator __l) function in class:hash_map
371 iterator insert(const value_type& __obj) function in class:hash_multimap
375 void insert(_InputIterator __f, _InputIterator __l) function in class:hash_multimap
378 void insert(const value_type* __f, const value_type* __l) { function in class:hash_multimap
381 void insert(const_iterator __f, const_iterator __l) function in class:hash_multimap
458 container->insert(__val);
485 container->insert(__val)
    [all...]
_hash_set.h 181 pair<iterator, bool> insert(const value_type& __obj) function in class:hash_set
185 void insert(_InputIterator __f, _InputIterator __l) function in class:hash_set
187 void insert(const_iterator __f, const_iterator __l)
189 void insert(const value_type* __f, const value_type* __l)
363 iterator insert(const value_type& __obj) { return _M_ht.insert_equal(__obj); } function in class:hash_multiset
366 void insert(_InputIterator __f, _InputIterator __l) function in class:hash_multiset
369 void insert(const value_type* __f, const value_type* __l) function in class:hash_multiset
371 void insert(const_iterator __f, const_iterator __l) function in class:hash_multiset
453 container->insert(__val);
480 container->insert(__val)
    [all...]
_map.h 179 __i = insert(__i, value_type(__k, _STLP_DEFAULT_CONSTRUCTED(_Tp)));
187 // insert/erase
188 pair<iterator,bool> insert(const value_type& __x) function in class:map
190 iterator insert(iterator __pos, const value_type& __x) function in class:map
194 void insert(_InputIterator __first, _InputIterator __last) function in class:map
197 void insert(const value_type* __first, const value_type* __last) function in class:map
199 void insert(const_iterator __first, const_iterator __last) function in class:map
365 // insert/erase
366 iterator insert(const value_type& __x) { return _M_t.insert_equal(__x); } function in class:multimap
367 iterator insert(iterator __pos, const value_type& __x) { return _M_t.insert_equal(__pos, __x); function in class:multimap
370 void insert(_InputIterator __first, _InputIterator __last) function in class:multimap
373 void insert(const value_type* __first, const value_type* __last) function in class:multimap
375 void insert(const_iterator __first, const_iterator __last) function in class:multimap
    [all...]
_set.h 167 // insert/erase
168 pair<iterator,bool> insert(const value_type& __x) function in class:set
170 iterator insert(iterator __pos, const value_type& __x) function in class:set
174 void insert(_InputIterator __first, _InputIterator __last) function in class:set
177 void insert(const_iterator __first, const_iterator __last) function in class:set
179 void insert(const value_type* __first, const value_type* __last) function in class:set
338 // insert/erase
339 iterator insert(const value_type& __x) function in class:multiset
341 iterator insert(iterator __pos, const value_type& __x) function in class:multiset
346 void insert(_InputIterator __first, _InputIterator __last function in class:multiset
349 void insert(const value_type* __first, const value_type* __last) function in class:multiset
351 void insert(const_iterator __first, const_iterator __last) function in class:multiset
    [all...]
_string_workaround.h 318 public: // Insert
319 _Self& insert(size_type __pos, const _Self& __s) { function in class:basic_string
320 _Base::insert(__pos, __s);
324 _Self& insert(size_type __pos, const _Self& __s, function in class:basic_string
326 _Base::insert(__pos, __s, __beg, __n);
329 _Self& insert(size_type __pos, const _CharT* __s, size_type __n) { function in class:basic_string
331 _Base::insert(__pos, __s, __n);
335 _Self& insert(size_type __pos, const _CharT* __s) { function in class:basic_string
337 _Base::insert(__pos, __s);
341 _Self& insert(size_type __pos, size_type __n, _CharT __c) function in class:basic_string
346 iterator insert(iterator __p, _CharT __c) function in class:basic_string
349 void insert(iterator __p, size_t __n, _CharT __c) function in class:basic_string
355 void insert(iterator __p, _InputIter __first, _InputIter __last) { function in class:basic_string
362 void insert(iterator __p, const _CharT* __f, const _CharT* __l) { function in class:basic_string
    [all...]
_unordered_map.h 133 pair<iterator,bool> insert(const value_type& __obj) function in class:unordered_map
135 iterator insert(const_iterator /*__hint*/, const value_type& __obj) function in class:unordered_map
139 void insert(_InputIterator __f, _InputIterator __l) function in class:unordered_map
141 void insert(const value_type* __f, const value_type* __l)
143 void insert(const_iterator __f, const_iterator __l)
301 iterator insert(const value_type& __obj) function in class:unordered_multimap
303 iterator insert(const_iterator /*__hint*/, const value_type& __obj) function in class:unordered_multimap
307 void insert(_InputIterator __f, _InputIterator __l) function in class:unordered_multimap
309 void insert(const value_type* __f, const value_type* __l)
311 void insert(const_iterator __f, const_iterator __l
    [all...]
_unordered_set.h 127 pair<iterator, bool> insert(const value_type& __obj) function in class:unordered_set
129 iterator insert(const_iterator /*__hint*/, const value_type& __obj) function in class:unordered_set
133 void insert(_InputIterator __f, _InputIterator __l) function in class:unordered_set
135 void insert(const_iterator __f, const_iterator __l)
137 void insert(const value_type* __f, const value_type* __l)
277 iterator insert(const value_type& __obj) function in class:unordered_multiset
279 iterator insert(const_iterator /*__hint*/, const value_type& __obj) function in class:unordered_multiset
283 void insert(_InputIterator __f, _InputIterator __l) function in class:unordered_multiset
285 void insert(const value_type* __f, const value_type* __l)
287 void insert(const_iterator __f, const_iterator __l
    [all...]
  /external/stlport/stlport/stl/debug/
_list.h 206 iterator insert(iterator __pos, const _Tp& __x = _Tp()) { function in class:list
208 iterator insert(iterator __pos, const _Tp& __x) {
211 return iterator(&_M_iter_list,_M_non_dbg_impl.insert(__pos._M_iterator, __x) );
215 iterator insert(iterator __pos) { return insert(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp)); } function in class:list
220 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { function in class:list
223 _M_non_dbg_impl.insert(__pos._M_iterator,
229 void insert(iterator __pos, const _Tp* __first, const _Tp* __last) { function in class:list
232 _M_non_dbg_impl.insert(__pos._M_iterator, __first, __last);
237 void insert(iterator __pos function in class:list
246 void insert(iterator __pos, function in class:list
257 void insert(iterator __pos, size_type __n, const _Tp& __x) { function in class:list
    [all...]
_slist.h 290 void insert(iterator __pos, _InIter __first, _InIter __last) { function in class:slist
294 _M_non_dbg_impl.insert(__pos._M_iterator,
313 void insert(iterator __pos, const_iterator __first, const_iterator __last) { function in class:slist
317 _M_non_dbg_impl.insert(__pos._M_iterator, __first._M_iterator, __last._M_iterator);
319 void insert(iterator __pos, const value_type* __first, function in class:slist
324 _M_non_dbg_impl.insert(__pos._M_iterator, __first, __last);
329 iterator insert(iterator __pos, const value_type& __x = _Tp()) { function in class:slist
331 iterator insert(iterator __pos, const value_type& __x) {
335 return iterator(&_M_iter_list, _M_non_dbg_impl.insert(__pos._M_iterator, __x));
339 iterator insert(iterator __pos) function in class:slist
344 void insert(iterator __pos, size_type __n, const value_type& __x) { function in class:slist
    [all...]
_string.h 388 // Insert
389 _Self& insert(size_type __pos, const _Self& __s) { function in class:basic_string
391 _M_non_dbg_impl.insert(__pos, __s._M_non_dbg_impl);
396 _Self& insert(size_type __pos, const _Self& __s, function in class:basic_string
399 _M_non_dbg_impl.insert(__pos, __s._M_non_dbg_impl, __beg, __n);
404 _Self& insert(size_type __pos, const _CharT* __s, size_type __n) { function in class:basic_string
408 _M_non_dbg_impl.insert(__pos, __s, __n);
413 _Self& insert(size_type __pos, const _CharT* __s) { function in class:basic_string
416 return insert(__pos, __s, _Traits::length(__s));
419 _Self& insert(size_type __pos, size_type __n, _CharT __c) function in class:basic_string
426 iterator insert(iterator __p, _CharT __c) { function in class:basic_string
434 void insert(iterator __p, size_t __n, _CharT __c) { function in class:basic_string
443 void insert(iterator __p, _InputIter __first, _InputIter __last) { function in class:basic_string
455 void insert(iterator __p, const _CharT* __f, const _CharT* __l) { function in class:basic_string
468 void insert(iterator __p, const_iterator __f, const_iterator __l) { function in class:basic_string
478 void insert(iterator __p, iterator __f, iterator __l) { function in class:basic_string
    [all...]
  /external/stlport/stlport/stl/pointers/
_list.h 117 insert(begin(), __first, __last);
127 { insert(begin(), __first, __last); }
180 iterator insert(iterator __pos, const_reference __x = _STLP_DEFAULT_CONSTRUCTED(value_type)) function in class:list
182 iterator insert(iterator __pos, const_reference __x)
184 { return iterator(_M_impl.insert(_BaseIte(__pos._M_node),
193 { _M_impl.insert(_BaseIte(__pos._M_node), __n, __val); }
199 _M_impl.insert(_BaseIte(__pos._M_node),
208 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { function in class:list
214 _M_impl.insert(_BaseIte(__pos._M_node), __first, __last);
218 void insert(iterator __pos, const value_type *__first, const value_type *__last function in class:list
221 void insert(iterator __pos, const_iterator __first, const_iterator __last) function in class:list
225 void insert(iterator __pos, size_type __n, const value_type& __x) function in class:list
232 iterator insert(iterator __pos) { return iterator(_M_impl.insert(__pos._M_node)._M_node); } function in class:list
    [all...]
_slist.h 287 iterator insert(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type)) function in class:slist
289 iterator insert(iterator __pos, const value_type& __x)
291 { return iterator(_M_impl.insert(_BaseIte(__pos._M_node),
295 iterator insert(iterator __pos) function in class:slist
296 { return iterator(_M_impl.insert(_BaseIte(__pos._M_node))._M_node); }
299 void insert(iterator __pos, size_type __n, const value_type& __x) function in class:slist
300 { _M_impl.insert(_BaseIte(__pos._M_node), __n, cast_traits::to_storage_type_cref(__x)); }
308 _M_impl.insert(_BaseIte(__pos._M_node), __n, __val);
315 _M_impl.insert(_BaseIte(__pos._M_node), _STLP_TYPENAME _STLP_PRIV _IteWrapper<_StorageType, _Tp, _InputIterator>::_Ite(__first),
323 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) function in class:slist
334 void insert(iterator __pos, const_iterator __first, const_iterator __last) function in class:slist
336 void insert(iterator __pos, const value_type* __first, const value_type* __last) function in class:slist
    [all...]
_vector.h 176 iterator insert(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type)) function in class:vector
178 iterator insert(iterator __pos, const value_type& __x)
180 { return cast_traits::to_value_type_ptr(_M_impl.insert(cast_traits::to_storage_type_ptr(__pos),
185 iterator insert(iterator __pos) function in class:vector
186 { return _M_impl.insert(cast_traits::to_storage_type_ptr(__pos)); }
196 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) function in class:vector
197 { _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), __first, __last); }
199 void insert(iterator __pos, const_iterator __first, const_iterator __last) { function in class:vector
200 _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), cast_traits::to_storage_type_cptr(__first),
205 void insert (iterator __pos, size_type __n, const value_type& __x) function in class:vector
    [all...]
  /external/stlport/test/unit/
set_test.cpp 23 CPPUNIT_TEST(insert);
40 void insert();
60 s.insert(42);
62 s.insert(42);
72 pair<int_set::iterator, bool> p = s.insert(42);
74 p = s.insert(42);
78 s.insert(array1, array1 + 4);
97 s.insert(1);
105 void SetTest::insert() function in class:SetTest
108 set<int>::iterator i = s.insert( s.end(), 0 )
    [all...]
  /external/webkit/Source/WebCore/html/parser/
HTMLDocumentParser.cpp 316 void HTMLDocumentParser::insert(const SegmentedString& source) function in class:WebCore::HTMLDocumentParser
575 parser->insert(source); // Use insert() so that the parser will not yield.
  /external/webkit/Source/WebCore/platform/graphics/
GraphicsLayer.cpp 44 void KeyframeValueList::insert(const AnimationValue* value) function in class:WebCore::KeyframeValueList
50 // insert after
51 m_values.insert(i + 1, value);
55 // insert before
56 m_values.insert(i, value);
137 m_children.insert(index, childLayer);
148 m_children.insert(i, childLayer);
168 m_children.insert(i+1, childLayer);
  /frameworks/base/core/java/android/content/
DefaultDataHandler.java 35 * Insert one row:
47 * Use first row's uri to insert into another table,
61 * Insert multiple rows in to same table and same attributes:
87 public void insert(ContentResolver contentResolver, InputStream in) method in class:DefaultDataHandler
93 public void insert(ContentResolver contentResolver, String in) method in class:DefaultDataHandler
128 Uri u = mContentResolver.insert(mUris.lastElement(), mValues);
137 // case 2, <Col> before <Row> insert last uri
143 throw new SAXException("insert to uri " +
SearchRecentSuggestionsProvider.java 266 public Uri insert(Uri uri, ContentValues values) { method in class:SearchRecentSuggestionsProvider
273 // Note: This table has on-conflict-replace semantics, so insert() may actually replace()
279 rowID = db.insert(sSuggestions, NULL_COLUMN, values);
  /frameworks/base/core/java/android/provider/
SearchRecentSuggestions.java 185 // Use content resolver (not cursor) to insert/update this query
194 cr.insert(mSuggestionsUri, values);

Completed in 1426 milliseconds

1 2 3 4 5 6 78 91011>>