Searched defs:insert (Results 1 - 25 of 300) sorted by last modified time

1234567891011>>

/external/zlib/src/
H A Ddeflate.h159 uInt strstart; /* start of string to insert */
250 uInt insert; /* bytes at end of window left to insert */ member in struct:internal_state
/external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/
H A DXMPMetaImpl.java1291 * "last()", normalize it and check the insert flags. The order of the
1296 * @param itemIndex the index where to insert the item
1299 * @param insert insert oder overwrite at index position?
1303 PropertyOptions itemOptions, boolean insert) throws XMPException
1308 // in insert mode the index after the last is allowed,
1310 int maxIndex = insert ? arrayNode.getChildrenLength() + 1 : arrayNode.getChildrenLength();
1318 if (!insert)
1302 doSetArrayItem(XMPNode arrayNode, int itemIndex, String itemValue, PropertyOptions itemOptions, boolean insert) argument
/external/valgrind/main/coregrind/m_gdbserver/
H A Dm_gdbserver.c295 static void breakpoint (Bool insert, CORE_ADDR addr) argument
300 if (insert) {
301 /* insert a breakpoint at addr or upgrade its kind */
303 add_gs_address (addr, GS_break, "m_gdbserver breakpoint insert");
330 Bool insert,
334 Bool insert,
341 Bool VG_(gdbserver_point) (PointKind kind, Bool insert, argument
350 (insert ? "insert" : "remove"),
356 breakpoint (insert, add
333 needs_watchpoint(Bool (watchpoint) PointKind kind, Bool insert, Addr addr, SizeT len)) argument
[all...]
H A Dtarget.c503 /* insert or remove a breakpoint */
505 int valgrind_point (Bool insert, char type, CORE_ADDR addr, int len) argument
529 if (VG_(gdbserver_point) (kind, insert, addr, len))
542 return valgrind_point (/* insert */ True, type, addr, len);
547 return valgrind_point (/* insert*/ False, type, addr, len);
/external/valgrind/main/memcheck/
H A Dmc_main.c382 /* Tunable parameter: How far along the L1 queue to insert
6835 static Bool mc_mark_unaddressable_for_watchpoint (PointKind kind, Bool insert, argument
6842 if (insert)
/external/tremolo/Tremolo/
H A Dmisc.c143 int insert; local
182 insert=((head *)ptr)->ptr;
183 insertlist[insert]=pinsert;
184 pinsert=insert;
186 if(pointers[insert]==NULL){
195 pointers[insert]=NULL;
/external/stlport/src/
H A Dlocale_impl.cpp120 void _Locale_impl::insert(_Locale_impl *from, const locale::id& n) { function in class:_Locale_impl
122 this->insert(from->facets_vec[n._M_index], n);
126 locale::facet* _Locale_impl::insert(locale::facet *f, const locale::id& n) { function in class:_Locale_impl
156 this->insert(i2, ctype<char>::id);
157 this->insert(i2, codecvt<char, char, mbstate_t>::id);
159 this->insert(i2, ctype<wchar_t>::id);
160 this->insert(i2, codecvt<wchar_t, char, mbstate_t>::id);
212 this->insert(ct, ctype<char>::id);
213 this->insert(cvt, codecvt<char, char, mbstate_t>::id);
215 this->insert(wc
[all...]
H A Dmessages.cpp29 void _Catalog_locale_map::insert(nl_catd_type key, const locale& L) { function in class:_Catalog_locale_map
46 M->insert(map_type::value_type(key, L));
72 messages_base::catalog _Catalog_nl_catd_map::insert(nl_catd_type cat) { function in class:_Catalog_nl_catd_map
130 _M_map->insert(result, L);
132 return _STLP_MUTABLE(_Messages_impl, _M_cat).insert( result );
/external/stlport/stlport/stl/
H A D_bvector.h439 __pos = insert(__pos, *__first);
600 insert(end(), __n - size(), __x);
633 insert(end(), __first, __last);
646 insert(end(), __mid, __last);
685 iterator insert(iterator __position, bool __x = bool()) { function in class:__BVECTOR_QUALIFIED
713 void insert(iterator __position, function in class:__BVECTOR_QUALIFIED
719 void insert(iterator __position, function in class:__BVECTOR_QUALIFIED
741 void insert(iterator __position, const bool* __first, const bool* __last) { function in class:__BVECTOR_QUALIFIED
783 void insert(iterator __position, size_type __n, bool __x) { function in class:__BVECTOR_QUALIFIED
804 insert(en
[all...]
H A D_deque.c115 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
H A D_deque.h590 insert(end(), __n - size(), __val);
630 insert(end(), __first, __last);
643 insert(end(), __mid, __last);
657 insert(end(), __mid, __last);
730 iterator insert(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(_Tp)) { function in class:deque
732 iterator insert(iterator __pos, const value_type& __x) {
753 iterator insert(iterator __pos) function in class:deque
754 { return insert(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp)); }
757 void insert(iterator __pos, size_type __n, const value_type& __x) function in class:deque
783 void insert(iterato function in class:deque
[all...]
H A D_hash_map.h179 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(__va
[all...]
H A D_hash_set.h181 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(__va
[all...]
H A D_list.h311 { this->insert(begin(), __n, _STLP_DEFAULT_CONSTRUCTED(value_type)); }
314 { this->insert(begin(), __n, __val); }
318 { this->insert(begin(), __n, __val); }
321 // We don't need any dispatching tricks here, because insert does all of
420 iterator insert(iterator __pos, const_reference __x = value_type()) function in class:list
422 iterator insert(iterator __pos, const_reference __x)
456 insert(__pos, *__first);
462 insert(__pos, *__first);
468 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { function in class:list
485 void insert(iterato
498 void insert(iterator __pos, size_type __n, const_reference __x) function in class:list
512 iterator insert(iterator __pos) function in class:list
[all...]
H A D_map.h179 __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(iterato 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...]
H A D_rope.h1732 void insert(size_t __p, const _Self& __r) { function in class:rope
1738 void insert(size_t __p, size_t __n, _CharT __c) { function in class:rope
1740 insert(__p, __r);
1743 void insert(size_t __p, const _CharT* __i, size_t __n) { function in class:rope
1755 void insert(size_t __p, const _CharT* __c_string) { function in class:rope
1756 insert(__p, __c_string, _S_char_ptr_len(__c_string));
1759 void insert(size_t __p, _CharT __c) { function in class:rope
1760 insert(__p, &__c, 1);
1763 void insert(size_t __p) { function in class:rope
1765 insert(__
1768 void insert(size_t __p, const _CharT* __i, const _CharT* __j) { function in class:rope
1773 void insert(size_t __p, const const_iterator& __i, function in class:rope
1779 void insert(size_t __p, const iterator& __i, function in class:rope
1870 iterator insert(const iterator& __p, const _Self& __r) function in class:rope
1872 iterator insert(const iterator& __p, size_t __n, _CharT __c) function in class:rope
1874 iterator insert(const iterator& __p, _CharT __c) function in class:rope
1876 iterator insert(const iterator& __p ) function in class:rope
1878 iterator insert(const iterator& __p, const _CharT* c_string) function in class:rope
1880 iterator insert(const iterator& __p, const _CharT* __i, size_t __n) function in class:rope
1882 iterator insert(const iterator& __p, const _CharT* __i, function in class:rope
1885 iterator insert(const iterator& __p, function in class:rope
1888 iterator insert(const iterator& __p, function in class:rope
[all...]
H A D_set.h167 // 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(_InputIterato 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...]
H A D_slist.h635 iterator insert(iterator __pos, const value_type& __x = _Tp()) { function in class:slist
637 iterator insert(iterator __pos, const value_type& __x) {
644 iterator insert(iterator __pos) { function in class:slist
650 void insert(iterator __pos, size_type __n, const value_type& __x) { function in class:slist
658 void insert(iterator __pos, _InIter __first, _InIter __last) { function in class:slist
660 void insert(iterator __pos, const value_type* __first,
665 void insert(iterator __pos, const_iterator __first, const_iterator __last) {
745 insert(__pos, __x.begin(), __x.end());
759 insert(__pos, *__i);
774 insert(__po
[all...]
H A D_string.c280 void basic_string<_CharT,_Traits,_Alloc>::insert(iterator __pos, function in class:_Alloc
382 insert(__last, __n - __len, __c);
406 // We have to deal with possible reallocation because we do insert first.
H A D_string.h608 _Self& insert(size_type __pos, const _Self& __s) { function in class:basic_string
617 _Self& insert(size_type __pos, const _Self& __s, function in class:basic_string
628 _Self& insert(size_type __pos, const _CharT* __s, size_type __n) { function in class:basic_string
638 _Self& insert(size_type __pos, const _CharT* __s) { function in class:basic_string
649 _Self& insert(size_type __pos, size_type __n, _CharT __c) { function in class:basic_string
654 insert(begin() + __pos, __n, __c);
658 iterator insert(iterator __p, _CharT __c) { function in class:basic_string
668 void insert(iterator __p, size_t __n, _CharT __c);
670 _STLP_PRIVATE: // Helper functions for insert.
705 __p = insert(__
772 void insert(iterator __p, _InputIter __first, _InputIter __last) { function in class:basic_string
781 void insert(iterator __p, const _CharT* __f, const _CharT* __l) { function in class:basic_string
[all...]
H A D_string_sum.h156 //insert
157 _BString& insert(size_type __pos, const _BString& __s) {return _M_get_storage().insert(__pos, __s);} function in class:__bstr_sum
158 _BString& insert(size_type __pos, const _BString& __s, size_type __beg, size_type __n) function in class:__bstr_sum
159 {return _M_get_storage().insert(__pos, __s, __beg, __n);}
160 _BString& insert(size_type __pos, const _CharT* __s, size_type __n) {return _M_get_storage().insert(__pos, __s, __n);} function in class:__bstr_sum
161 _BString& insert(size_type __pos, const _CharT* __s) {return _M_get_storage().insert(__pos, __s);} function in class:__bstr_sum
162 _BString& insert(size_typ function in class:__bstr_sum
[all...]
H A D_string_workaround.h319 _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
342 _Base::insert(__po
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...]
H A D_unordered_map.h133 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_iterato
[all...]
H A D_unordered_set.h127 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_iterato
[all...]
H A D_vector.c223 vector<_Tp, _Alloc>::insert(iterator __pos, const _Tp& __x) { function in class:_Alloc

Completed in 1242 milliseconds

1234567891011>>