Searched defs:begin (Results 26 - 50 of 787) sorted by last modified time

1234567891011>>

/external/stlport/stlport/stl/
H A D_tree.h43 begin(), and to the rightmost node of the tree, to enable linear time
421 iterator begin() { return iterator(_M_leftmost()); } function in class:_Rb_tree
422 const_iterator begin() const { return const_iterator(_M_leftmost()); } function in class:_Rb_tree
429 reverse_iterator rend() { return reverse_iterator(begin()); }
431 { return const_reverse_iterator(begin()); }
519 if (__first._M_node == this->_M_header._M_data._M_left && // begin()
H A D_unordered_map.h128 iterator begin() { return _M_ht.begin(); } function in class:unordered_map
130 const_iterator begin() const { return _M_ht.begin(); } function in class:unordered_map
180 local_iterator begin(size_type __n) { return _M_ht.begin(__n); } function in class:unordered_map
182 const_local_iterator begin(size_type __n) const { return _M_ht.begin(__n); } function in class:unordered_map
296 iterator begin() { return _M_ht.begin(); } function in class:unordered_multimap
298 const_iterator begin() const { return _M_ht.begin(); } function in class:unordered_multimap
340 local_iterator begin(size_type __n) { return _M_ht.begin(__n); } function in class:unordered_multimap
342 const_local_iterator begin(size_type __n) const { return _M_ht.begin(__n); } function in class:unordered_multimap
[all...]
H A D_unordered_set.h122 iterator begin() { return _M_ht.begin(); } function in class:unordered_set
124 const_iterator begin() const { return _M_ht.begin(); } function in class:unordered_set
166 local_iterator begin(size_type __n) { return _M_ht.begin(__n); } function in class:unordered_set
168 const_local_iterator begin(size_type __n) const { return _M_ht.begin(__n); } function in class:unordered_set
272 iterator begin() { return _M_ht.begin(); } function in class:unordered_multiset
274 const_iterator begin() const { return _M_ht.begin(); } function in class:unordered_multiset
316 local_iterator begin(size_type __n) { return _M_ht.begin(__n); } function in class:unordered_multiset
318 const_local_iterator begin(size_type __n) const { return _M_ht.begin(__n); } function in class:unordered_multiset
[all...]
H A D_vector.h182 iterator begin() { return this->_M_start; } function in class:vector
183 const_iterator begin() const { return this->_M_start; } function in class:vector
189 reverse_iterator rend() { return reverse_iterator(begin()); }
190 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
202 reference operator[](size_type __n) { return *(begin() + __n); }
203 const_reference operator[](size_type __n) const { return *(begin() + __n); }
205 reference front() { return *begin(); }
206 const_reference front() const { return *begin(); }
249 this->_M_finish = _STLP_PRIV __ucopy_ptrs(__x.begin(), __x.end(), this->_M_start, _TrivialUCopy());
349 iterator __cur = begin();
[all...]
/external/stlport/stlport/stl/debug/
H A D_deque.h89 iterator begin() { return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); } function in class:deque
91 const_iterator begin() const { return const_iterator(&_M_iter_list, _M_non_dbg_impl.begin()); } function in class:deque
95 reverse_iterator rend() { return reverse_iterator(begin()); }
97 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
113 return *begin();
117 return *begin();
279 _Invalidate_iterator(begin());
376 if (__pos._M_iterator == _M_non_dbg_impl.begin()) {
[all...]
H A D_hashtable.h172 _Invalidate_iterators(begin(), end());
183 iterator begin() { return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); } function in class:hashtable
185 local_iterator begin(size_type __n) { function in class:hashtable
188 return local_iterator(&_M_iter_list, _M_non_dbg_impl.begin(__n));
196 const_iterator begin() const { return const_iterator(&_M_iter_list, _M_non_dbg_impl.begin()); } function in class:hashtable
198 const_local_iterator begin(size_type __n) const { function in class:hashtable
201 return const_local_iterator(&_M_iter_list, _M_non_dbg_impl.begin(__n));
300 const_iterator(begin()), const_iterato
[all...]
H A D_list.h155 _Invalidate_iterators(begin(), end());
163 iterator begin() { return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); } function in class:list
164 const_iterator begin() const { return const_iterator(&_M_iter_list, _M_non_dbg_impl.begin()); } function in class:list
170 reverse_iterator rend() { return reverse_iterator(begin()); }
173 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
182 return *begin();
186 return *begin();
272 _Invalidate_iterator(begin());
[all...]
H A D_slist.h171 _Invalidate_iterators(begin(), end());
180 _Invalidate_iterators(begin(), end());
189 iterator begin() function in class:slist
190 { return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); }
191 const_iterator begin() const function in class:slist
192 { return const_iterator(&_M_iter_list, _M_non_dbg_impl.begin());}
263 _Invalidate_iterators(begin(), end());
269 _Invalidate_iterators(begin(), end());
274 _Invalidate_iterators(begin(), end());
361 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__before_first, __last, begin(), en
[all...]
H A D_string.h183 iterator begin() { return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); } function in class:basic_string
184 const_iterator begin() const { return const_iterator(&_M_iter_list, _M_non_dbg_impl.begin()); } function in class:basic_string
190 reverse_iterator rend() { return reverse_iterator(begin()); }
191 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
202 _Invalidate_iterators(begin() + __n, end());
493 _Invalidate_iterators(begin() + __pos, end());
505 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__f, __l, begin(), end()))
556 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__f, __l, begin(), en
[all...]
H A D_tree.h147 _Invalidate_iterators(begin(), end());
156 iterator begin() { return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); } function in class:_Rb_tree
157 const_iterator begin() const { return const_iterator(&_M_iter_list, _M_non_dbg_impl.begin()); } function in class:_Rb_tree
163 reverse_iterator rend() { return reverse_iterator(begin()); }
164 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
293 _STLP_DEBUG_CHECK(__check_range(__first, __last, begin(), end()))
303 _Invalidate_iterators(begin(), end());
H A D_vector.h146 iterator begin() { return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); } function in class:vector
147 const_iterator begin() const { return const_iterator(&_M_iter_list, _M_non_dbg_impl.begin()); } function in class:vector
153 reverse_iterator rend() { return reverse_iterator(begin()); }
154 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
250 return *begin();
254 return *begin();
353 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last, begin(), end()))
367 _Invalidate_iterators(begin()
[all...]
/external/stlport/stlport/stl/pointers/
H A D_deque.h127 iterator begin() { return ite_cast_traits::to_value_type_ite(_M_impl.begin()); } function in class:deque
129 const_iterator begin() const { return ite_cast_traits::to_value_type_cite(_M_impl.begin()); } function in class:deque
133 reverse_iterator rend() { return reverse_iterator(begin()); }
137 { return const_reverse_iterator(begin()); }
H A D_list.h117 insert(begin(), __first, __last);
127 { insert(begin(), __first, __last); }
152 iterator begin() { return iterator(_M_impl.begin()._M_node); } function in class:list
153 const_iterator begin() const { return const_iterator(_M_impl.begin()._M_node); } function in class:list
161 reverse_iterator rend() { return reverse_iterator(begin()); }
162 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
168 reference front() { return *begin(); }
169 const_reference front() const { return *begin(); }
[all...]
H A D_set.h211 iterator begin() { return _S_to_value_ite(_M_t.begin()); } function in class:set
213 const_iterator begin() const { return _S_to_value_ite(_M_t.begin()); } function in class:set
216 reverse_iterator rend() { return reverse_iterator(begin()); }
218 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
464 iterator begin() { return _S_to_value_ite(_M_t.begin()); } function in class:multiset
466 const_iterator begin() const { return _S_to_value_ite(_M_t.begin()); } function in class:multiset
[all...]
H A D_slist.h189 iterator begin() { return iterator(_M_impl.begin()._M_node); } function in class:slist
190 const_iterator begin() const { return const_iterator(const_cast<_Node_base*>(_M_impl.begin()._M_node));} function in class:slist
205 reference front() { return *begin(); }
206 const_reference front() const { return *begin(); }
H A D_vector.h79 iterator begin() { return cast_traits::to_value_type_ptr(_M_impl.begin()); } function in class:vector
80 const_iterator begin() const { return cast_traits::to_value_type_cptr(_M_impl.begin()); } function in class:vector
86 reverse_iterator rend() { return reverse_iterator(begin()); }
87 const_reverse_iterator rend() const { return const_reverse_iterator(begin()); }
/external/stlport/test/eh/
H A Dtest_algo.cpp41 SortClass* begin() { return items; } function in struct:SortBuffer
42 const SortClass* begin() const { return items; } function in struct:SortBuffer
50 EH_STD::sort( begin(), begin() + ( end() - begin() )/2 );
51 EH_STD::sort( begin() + ( end() - begin() )/2, end() );
52 for ( SortClass* p = begin(); p != end(); p++ )
63 SortClass* q = begin();
64 for ( const SortClass* p = rhs.begin() ;
[all...]
/external/srec/srec/ca/
H A Dann_api.c391 hAnnotation->data->tcp[ii].begin,
392 hAnnotation->data->tcp[ii].begin
430 if (hAnnotation->data->tcp[0].begin
527 int* begin, int* end, char* buff, int buffLen)
540 annotation_get_data(hAnnotation->data, id, begin, end, buff, buffLen);
631 hAnnotation->data->tcp[0].begin = start;
637 hAnnotation->data->tcp[0].begin = beep_start_point;
679 beep_start = hBeepAnnotation->data->tcp[0].begin;
680 beep_end = hBeepAnnotation->data->tcp[hBeepAnnotation->data->numWords-1].begin
684 printf("Speech1 begin
526 CA_GetAnnotationData(CA_Annotation* hAnnotation, int id, int* begin, int* end, char* buff, int buffLen) argument
[all...]
/external/srec/srec/include/
H A Dutteranc.h58 long begin; member in struct:__anon31167
236 int set_data_frame(file_utterance_info *utt, long begin);
/external/srec/tools/grxmlcompile/
H A Dhashmap.cpp90 for (pos = m_Map.begin(); pos != m_Map.end(); ++pos) {
107 m_pPos= m_Map.begin();
150 for (pos = m_Map.begin(); pos != m_Map.end(); ++pos) {
161 for (pos = m_Map.begin(); pos != m_Map.end(); ++pos) {
168 typename std::map<T1,T2>::iterator HashMap<T1,T2>::begin() function in class:HashMap
170 m_pPos = m_Map.begin();
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dstring-weight.h75 StringWeight(const Iter &begin, const Iter &end) { argument
77 for (Iter iter = begin; iter != end; ++iter)
161 iter_(rest_.begin()) {}
177 iter_ = rest_.begin();
/external/skia/src/animator/
H A DSkAnimateBase.h38 SkOperand* getValues() { return fValues.begin(); }
50 SkMSec begin; member in class:SkAnimateBase
H A DSkDisplayApply.h78 SkMSec begin; member in class:SkApply
H A DSkDrawExtraPathEffect.cpp95 virtual SkScalar begin(SkScalar contourLength) const { function in class:SkShape1DPathEffect
232 virtual void begin(const SkIRect& uvBounds, SkPath*) const SK_OVERRIDE {
H A DSkTDArray_Experimental.h118 T* begin() const { SYNC(); return (T*) fArray; } function in class:SkTDS32Array

Completed in 250 milliseconds

1234567891011>>