/* ========================================================================== * ÀÛ ¼º ÀÚ : À̼ø±Ô * ÀÛ ¼º ÀÏ : 2006.12.06 * ³» ¿ë : tPointerList¸¦ ±¸Çö * ÁÖÀÇ»çÇ× : *===========================================================================*/ public: explicit tPointerList() : list() { } void Clear() { clear(); } cIterator Insert( cIterator pos, const T val ) { /// ³Î Æ÷ÀÎÅÍ °Ë»ç if( val == 0 ) { assert( 0 && "null pointer" ); return pos; } else { return insert( pos, val ); } } bool PushFront( const T val ) { /// ³Î Æ÷ÀÎÅÍ °Ë»ç if( val == 0 ) { assert( 0 && "null pointer" ); return false; } else { push_front( val ); return true; } } bool PushBack( const T val ) { /// ³Î Æ÷ÀÎÅÍ °Ë»ç if( val == 0 ) { assert( 0 && "null pointer" ); return false; } else { push_back( val ); return true; } } cIterator Erase( cIterator pos ) { if( pos == end() ) { return pos; } else { return erase( pos ); } } cIterator Erase( cIterator first, cIterator last ) { return erase( first, last ); } void PopFront() { pop_front(); } void PopBack() { pop_back(); } void Splice( cIterator pos, cSelf& other ) { splice( pos, other ); } void Splice( cIterator pos, cSelf& other, cIterator first, cIterator last ) { splice( pos, other, first, last ); } void Splice( cIterator pos, cSelf& other, cIterator i ) { splice( pos, other, i ); } void Remove( const T val ) { remove( val ); } template void RemoveIf( Predicate op ) { remove_if( op ); } void Sort() { sort(); } template void Sort( StrictWeakOrdering op ) { sort( op ); } cIterator Begin() { return begin(); } cConstIterator Begin() const { return begin(); } cIterator End() { return end(); } cConstIterator End() const { return end(); } T& Front() { return front(); } const T& Front() const { return front(); } T& Back() { return back(); } const T& Back() const { return back(); } unsigned int GetSize() const { return size(); } bool IsEmpty() const { return empty(); }