Lines Matching full:begin
41 SortClass* begin() { return items; }
42 const SortClass* begin() const { return items; }
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() ; p != rhs.end(); p++,q++ )
96 SortClass* d = EH_STD::stable_partition( buf.begin(), buf.end(), throw_cmp );
109 for ( const SortClass *q = orig.begin(); q != orig.end(); q++ )
113 for ( const SortClass* p = buf.begin(); p != buf.end(); p++ )
117 if ( p != buf.begin() && p->value() == p[-1].value() ) {
155 for ( const SortClass *q = orig.begin(); q != orig.end(); q++ )
160 for ( const SortClass* p = buf.begin(); p != buf.end(); p++ )
162 if ( p != buf.begin() ) {
188 EH_STD::stable_sort( buf.begin(), buf.end() );
205 EH_STD::stable_sort( buf.begin(), buf.end(), EH_STD::less<SortClass>() );
222 EH_STD::inplace_merge( buf.begin(), buf.begin() + ( buf.end() - buf.begin() )/2, buf.end() );
239 EH_STD::inplace_merge( buf.begin(), buf.begin() + ( buf.end() - buf.begin() )/2, buf.end(),
