| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_list.h | 1070 insert(iterator __position, value_type&& __x) function in class:list
1087 insert(iterator __p, initializer_list<value_type> __l) function in class:list
1104 insert(iterator __position, size_type __n, const value_type& __x) function in class:list
1125 insert(iterator __position, _InputIterator __first, function in class:list
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/ov_tree_map_/ |
| ov_tree_map_.hpp | 268 insert(r_key);
274 insert(const_reference r_value) function in class:__gnu_pbds::detail::PB_DS_OV_TREE_NAME
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/ |
| hashtable.h | 339 private: // Find, insert and erase helper functions
342 // better to just specialize insert on __unique_keys. There may be a
372 // Insert and erase
374 insert(const value_type& __v) function in class:tr1::_Hashtable
379 insert(iterator, const value_type& __v) function in class:tr1::_Hashtable
380 { return iterator(_Insert_Conv_Type()(this->insert(__v))); }
383 insert(const_iterator, const value_type& __v) function in class:tr1::_Hashtable
384 { return const_iterator(_Insert_Conv_Type()(this->insert(__v))); }
388 insert(_InputIterator __first, _InputIterator __last);
567 this->insert(*__f)
978 insert(_InputIterator __first, _InputIterator __last) function in class:tr1::_Hashtable
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| hashtable_policy.h | 571 * insert member functions appropriate to all _Hashtables.
601 insert(const value_type& __v) function in struct:__detail::_Insert_base
608 insert(const_iterator, const value_type& __v) function in struct:__detail::_Insert_base
609 { return __iconv_type()(insert(__v)); }
612 insert(initializer_list<value_type> __l) function in struct:__detail::_Insert_base
613 { this->insert(__l.begin(), __l.end()); }
617 insert(_InputIterator __first, _InputIterator __last);
628 insert(_InputIterator __first, _InputIterator __last) function in class:__detail::_Insert_base
647 this->insert(*__first);
653 * Select insert member functions appropriate to _Hashtable policy choices
686 insert(value_type&& __v) function in struct:__detail::_Insert
693 insert(const_iterator, value_type&& __v) function in struct:__detail::_Insert
720 insert(value_type&& __v) function in struct:__detail::_Insert
727 insert(const_iterator, value_type&& __v) function in struct:__detail::_Insert
766 insert(_Pair&& __v) function in struct:__detail::_Insert
774 insert(const_iterator, _Pair&& __v) function in struct:__detail::_Insert
[all...] |
| stl_deque.h | 1492 insert(iterator __position, value_type&& __x) function in class:deque
1505 insert(iterator __p, initializer_list<value_type> __l) function in class:deque
1519 insert(iterator __position, size_type __n, const value_type& __x) function in class:deque
1536 insert(iterator __position, _InputIterator __first, function in class:deque
1542 insert(iterator __position, _InputIterator __first, function in class:deque
[all...] |
| stl_list.h | 1089 insert(iterator __position, value_type&& __x) function in class:list
1106 insert(iterator __p, initializer_list<value_type> __l) function in class:list
1123 insert(iterator __position, size_type __n, const value_type& __x) function in class:list
1149 insert(iterator __position, _InputIterator __first, function in class:list
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/ov_tree_map_/ |
| ov_tree_map_.hpp | 268 insert(r_key);
274 insert(const_reference r_value) function in class:__gnu_pbds::detail::PB_DS_OV_TREE_NAME
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/tr1/ |
| hashtable.h | 339 private: // Find, insert and erase helper functions
342 // better to just specialize insert on __unique_keys. There may be a
372 // Insert and erase
374 insert(const value_type& __v) function in class:tr1::_Hashtable
379 insert(iterator, const value_type& __v) function in class:tr1::_Hashtable
380 { return iterator(_Insert_Conv_Type()(this->insert(__v))); }
383 insert(const_iterator, const value_type& __v) function in class:tr1::_Hashtable
384 { return const_iterator(_Insert_Conv_Type()(this->insert(__v))); }
388 insert(_InputIterator __first, _InputIterator __last);
567 this->insert(*__f)
978 insert(_InputIterator __first, _InputIterator __last) function in class:tr1::_Hashtable
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/xml/etree/ |
| ElementTree.py | 318 # @param index Where to insert the new subelement.
320 def insert(self, index, element): member in class:Element
322 self._children.insert(index, element)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/xml/etree/ |
| ElementTree.py | 318 # @param index Where to insert the new subelement.
320 def insert(self, index, element): member in class:Element
322 self._children.insert(index, element)
[all...] |
| /packages/providers/DownloadProvider/src/com/android/providers/downloads/ |
| DownloadProvider.java | 339 * insert() now ensures these four columns are never null for new downloads, so this method
517 public Uri insert(final Uri uri, final ContentValues values) { method in class:DownloadProvider
524 Log.d(Constants.TAG, "calling insert on an unknown/invalid URI: " + uri);
679 long rowID = db.insert(DB_TABLE, null, filteredValues);
681 Log.d(Constants.TAG, "couldn't insert into downloads database");
[all...] |
| /packages/providers/CalendarProvider/tests/src/com/android/providers/calendar/ |
| CalendarProvider2Test.java | 175 * This is used to insert a new event into the database. The event is
180 private class Insert implements Command {
183 public Insert(String eventName) {
188 Log.i(TAG, "insert " + eventInfo.mTitle);
768 new Insert("normal0"),
769 new Insert("normal1"),
770 new Insert("normal2"),
2715 public Uri insert(Uri uri, ContentValues values) { method in class:CalendarProvider2Test.MockProvider
[all...] |
| /cts/tests/tests/content/src/android/content/cts/ |
| AsyncQueryHandlerTest.java | 48 private static final Object INSERT_COOKIE = "insert cookie";
81 mResolver.insert(DummyProvider.CONTENT_URI, values0);
85 mResolver.insert(DummyProvider.CONTENT_URI, values1);
89 mResolver.insert(DummyProvider.CONTENT_URI, values2);
114 // insert without cancelling.
123 // insert will be cancelled.
|
| /cts/tests/tests/provider/src/android/provider/cts/ |
| ContactsTest.java | 90 // Test: insert
98 Uri uri = mProvider.insert(People.CONTENT_URI, value);
164 // Test: insert
170 Uri uri = mProvider.insert(Groups.CONTENT_URI, value);
228 // Test: insert
234 mProvider.insert(Photos.CONTENT_URI, value);
237 // Don't support direct insert operation to photos URI.
269 Uri peopleUri = mProvider.insert(People.CONTENT_URI, value);
272 // Test: insert
279 Uri uri = mProvider.insert(Phones.CONTENT_URI, value)
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/ |
| X509Name.java | [all...] |
| /external/chromium_org/third_party/freetype/src/pshinter/ |
| pshalgo.c | 1924 PSH_Point* insert; local
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| normalizer2impl.cpp | 82 insert(c, cc);
111 insert(c, leadCC); // insert first code point
230 void ReorderingBuffer::insert(UChar32 c, uint8_t cc) { function in class:ReorderingBuffer
232 // insert c at codePointLimit, after the character with prevCC<=cc
[all...] |
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| tstnorm.cpp | 500 inline static void insert(UnicodeString& dest, int pos, UChar32 ch) function
519 insert(reverse, 0, ch);
[all...] |
| /external/chromium_org/third_party/protobuf/java/src/main/java/com/google/protobuf/ |
| RopeByteString.java | 225 * testing trees of specific structure. We are also able to insert empty
610 // BAP95: Insert balanced subtrees whole. This means the result might not
613 // relatively few calls to insert() result.
615 insert(root);
641 private void insert(ByteString byteString) { method in class:RopeByteString.Balancer
[all...] |
| /external/chromium_org/third_party/skia/src/pipe/ |
| SkGPipeWrite.cpp | 180 virtual bool insert(const SkBitmap& bitmap, int32_t slot) SK_OVERRIDE;
184 * insert will crash.
770 int32_t bitmapIndex = fBitmapHeap->insert(bm);
1232 bool BitmapShuttle::insert(const SkBitmap& bitmap, int32_t slot) { function in class:BitmapShuttle
[all...] |
| /external/clang/include/clang/Analysis/ |
| CFG.h | 315 reverse_iterator insert(reverse_iterator I, size_t Cnt, CFGElement E, function in class:clang::CFGBlock::ElementList
317 return Impl.insert(I, Cnt, E, C);
568 // steps. First we prepare space for some number of elements, then we insert
572 return iterator(Elements.insert(I.base(), Cnt, CFGAutomaticObjDtor(0, 0), C));
[all...] |