listimp.h

uc/os 很好的学习代码

protected:

    virtual BI_ListElement<T> _FAR *findDetach( T t );
    virtual BI_ListElement<T> _FAR *findPred( T );

};

template <class T> void BI_SListImp<T>::add( T t )
{
    new BI_ListElement<T>( t, findPred(t) );
}

template <class T> BI_ListElement<T> _FAR *BI_SListImp<T>::findDetach( T t )
{
    BI_ListElement<T> _FAR *res = findPred(t);
    if( res->next->data == t )
        return res;
    else
        return &tail;
}

template <class T> BI_ListElement<T> _FAR *BI_SListImp<T>::findPred( T t )
{
    tail.data = t;
    BI_ListElement<T> _FAR *cursor = &head;
    while( cursor->next->data < t )
        cursor = cursor->next;
    return cursor;
}

/*------------------------------------------------------------------------*/
/*                                                                        */
/*  template <class T> class BI_ListIteratorImp                           */
/*                                                                        */
/*  Implements a list iterator.  This iterator works with any direct      */
/*  list.  For indirect lists, see BI_IListIteratorImp.                   */
/*                                                                        */
/*------------------------------------------------------------------------*/

template <class T> class _CLASSTYPE BI_ListIteratorImp
{

public:

    BI_ListIteratorImp( const BI_ListImp<T> _FAR &l )
        {
        list = &l;
        cur = list->head.next;
        }

    operator int()
        {
        return cur != &(list->tail);
        }

    T current()
        {
        return cur->data;
        }

    T operator ++ ( int )
        {
        BI_ListElement<T> _FAR *temp = cur;
        cur = cur->next;
        return temp->data;
        }

    T operator ++ ()
        {
        cur = cur->next;
        return cur->data;
        }

    void restart()
        {
        cur = list->head.next;
        }

private:

    const BI_ListImp<T> _FAR *list;
    BI_ListElement<T> _FAR *cur;

};

/*------------------------------------------------------------------------*/
/*                                                                        */
/*  template <class T, class Vect> class BI_InternalIListImp              */
/*                                                                        */
/*  Implements a list of pointers to objects of type T.                   */
/*  This is implemented through the form of BI_ListImp specified by List. */
/*  Since pointers always have meaningful copy semantics, this class      */
/*  can handle any type of object.                                        */
/*                                                                        */
/*------------------------------------------------------------------------*/

template <class T, class List> class _CLASSTYPE BI_InternalIListImp :
    public List
{
public:

    T _FAR *peekHead() const
        {
        return (T _FAR *)List::peekHead();
        }

    void add( T _FAR *t )
        {
        List::add( t );
        }

    void detach( T _FAR *t, int del = 0 )
        {
        List::detach( t, del );
        }

    void forEach( void (_FAR *)(T _FAR &, void _FAR *), void _FAR * );
    T _FAR *firstThat( int (_FAR *)(const T _FAR &, void _FAR *),
                       void _FAR *
                     ) const;
    T _FAR *lastThat( int (_FAR *)(const T _FAR &, void _FAR *),
                      void _FAR *
                    ) const;

protected:

    virtual BI_ListElement<void _FAR *> _FAR *findPred( void _FAR * ) = 0;

private:

    virtual void removeData( BI_ListElement<void _FAR *> _FAR *block )
        {
        delete (T _FAR *)(block->data);
        }
};

template <class T, class List>
void BI_InternalIListImp<T, List>::forEach( void (_FAR *f)(T _FAR &, void _FAR *),
                                            void _FAR *args
                                          )
{
    BI_ListElement<void _FAR *> _FAR *cur = head.next;
    while( cur->next != cur )
        {
        f( *(T _FAR *)cur->data, args );
        cur = cur->next;
        }
}

template <class T, class List>
T _FAR *BI_InternalIListImp<T, List>::firstThat( int (_FAR *cond)(const T _FAR &, void _FAR *),
                                            void _FAR *args
                                          ) const
{
    BI_ListElement<void _FAR *> _FAR *cur = head.next;
    while( cur->next != cur )
        if( cond( *(T _FAR *)(cur->data), args ) != 0 )
            return (T _FAR *)cur->data;
        else
            cur = cur->next;
    return 0;
}

template <class T, class List>
T _FAR *BI_InternalIListImp<T, List>::lastThat( int (_FAR *cond)(const T _FAR &, void _FAR *),
                                           void _FAR *args
                                         ) const
{
    T _FAR *res = 0;
    BI_ListElement<void _FAR *> _FAR *cur = head.next;
    while( cur->next != cur )
        {
        if( cond( *(T _FAR *)(cur->data), args ) != 0 )
            res = (T _FAR *)(cur->data);
        cur = cur->next;
        }
    return res;
}

/*------------------------------------------------------------------------*/
/*                                                                        */
/*  template <class T> class BI_IListImp                                  */
/*                                                                        */
/*  Implements a list of pointers to objects of type T.                   */
/*  This is implemented through the template BI_InternalIListImp.  Since  */
/*  pointers always have meaningful copy semantics, this class            */
/*  can handle any type of object.                                        */
/*                                                                        */
/*------------------------------------------------------------------------*/

template <class T> class _CLASSTYPE BI_IListImp :
    public BI_InternalIListImp<T, BI_ListImp<void _FAR *> >
{

protected:

    virtual BI_ListElement<void _FAR *> _FAR *findPred( void _FAR * );

};

template <class T>
BI_ListElement<void _FAR *> _FAR *BI_IListImp<T>::findPred( void _FAR *t )
{
    tail.data = t;
    BI_ListElement<void _FAR *> _FAR *cursor = &head;
    while( !(*(T _FAR *)t == *(T _FAR *)(cursor->next->data)) )
        cursor = cursor->next;
    return cursor;
}

/*------------------------------------------------------------------------*/
/*                                                                        */
/*  template <class T> class BI_ISListImp                                 */
/*                                                                        */
/*  Implements a sorted list of pointers to objects of type T.            */
/*  This is implemented through the template BI_InternalIListImp.  Since  */
/*  pointers always have meaningful copy semantics, this class            */
/*  can handle any type of object.                                        */
/*                                                                        */
/*------------------------------------------------------------------------*/

template <class T> class _CLASSTYPE BI_ISListImp :
    public BI_InternalIListImp<T, BI_SListImp<void _FAR *> >
{

protected:

    virtual BI_ListElement<void _FAR *> _FAR *findDetach( void _FAR * );
    virtual BI_ListElement<void _FAR *> _FAR *findPred( void _FAR * );

};

template <class T>
BI_ListElement<void _FAR *> _FAR *BI_ISListImp<T>::findDetach( void _FAR *t )
{
    BI_ListElement<void _FAR *> _FAR *res = findPred(t);
    if( *(T _FAR *)(res->next->data) == *(T _FAR *)t )
        return res;
    else
        return &tail;
}

template <class T>
BI_ListElement<void _FAR *> _FAR *BI_ISListImp<T>::findPred( void _FAR *t )
{
    tail.data = t;
    BI_ListElement<void _FAR *> _FAR *cursor = &head;
    while( *(T _FAR *)(cursor->next->data) < *(T _FAR *)t )
        cursor = cursor->next;
    return cursor;
}

/*------------------------------------------------------------------------*/
/*                                                                        */
/*  template <class T> class BI_IListIteratorImp                          */
/*                                                                        */
/*  Implements a list iterator.  This iterator works with any indirect    */
/*  list.  For direct lists, see BI_ListIteratorImp.                      */
/*                                                                        */
/*------------------------------------------------------------------------*/

template <class T>
class _CLASSTYPE BI_IListIteratorImp : public BI_ListIteratorImp<void _FAR *>
{

public:

   BI_IListIteratorImp( const BI_ListImp<void _FAR *> _FAR &l ) :
        BI_ListIteratorImp<void _FAR *>(l) {}

   T _FAR *current()
        {
        return (T _FAR *)BI_ListIteratorImp<void _FAR *>::current();
        }

   T _FAR *operator ++ (int)
        {
        return (T _FAR *)BI_ListIteratorImp<void _FAR *>::operator ++ (1);
        }

   T _FAR *operator ++ ()
        {
        return (T _FAR *)BI_ListIteratorImp<void _FAR *>::operator ++ ();
        }


};

#endif  // __LISTIMP_H