IntrusiveList.h

Go to the documentation of this file.

/*
// $Id: //open/dev/fennel/common/IntrusiveList.h#10 $
// Fennel is a library of data storage and processing components.
// Copyright (C) 2005-2009 The Eigenbase Project
// Copyright (C) 2005-2009 SQLstream, Inc.
// Copyright (C) 2005-2009 LucidEra, Inc.
// Portions Copyright (C) 1999-2009 John V. Sichi
//
// This program is free software; you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by the Free
// Software Foundation; either version 2 of the License, or (at your option)
// any later version approved by The Eigenbase Project.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
*/

#ifndef Fennel_IntrusiveList_Included
#define Fennel_IntrusiveList_Included

#include "fennel/common/RawIntrusiveList.h"

FENNEL_BEGIN_NAMESPACE

template <class T,class DerivedListNode = IntrusiveListNode>
class IntrusiveList : public RawIntrusiveList
{
    typedef RawIntrusiveList super;

public:
    void push_front(T &element)
    {
        super::push_front(static_cast<DerivedListNode &>(element));
    }

    void push_back(T &element)
    {
        super::push_back(static_cast<DerivedListNode &>(element));
    }

    T &front() const
    {
        return static_cast<T &>(
            static_cast<DerivedListNode &>(super::front()));
    }

    T &back() const
    {
        return static_cast<T &>(
            static_cast<DerivedListNode &>(super::back()));
    }

    bool remove(T &element)
    {
        return super::remove(
            static_cast<DerivedListNode &>(element));
    }
};

template <class T,class DerivedListNode = IntrusiveListNode>
class IntrusiveListIter : public RawIntrusiveListIter
{
    typedef RawIntrusiveListIter super;

public:
    explicit IntrusiveListIter()
    {
    }

    explicit IntrusiveListIter(
        IntrusiveList<T,DerivedListNode> const &list)
        : super(list)
    {
    }

    T *operator -> () const
    {
        return static_cast<T *>(
            static_cast<DerivedListNode *>(getCurrent()));
    }

    operator T * () const
    {
        return static_cast<T *>(
            static_cast<DerivedListNode *>(getCurrent()));
    }

    T & operator * () const
    {
        return *static_cast<T *>(
            static_cast<DerivedListNode *>(getCurrent()));
    }

    void repositionToFront(
        IntrusiveList<T,DerivedListNode> const &list)
    {
        super::repositionToFront(list);
    }
};

template <class T,class DerivedListNode = IntrusiveListNode>
class IntrusiveListMutator
    : public RawIntrusiveListMutator
{
    typedef RawIntrusiveListMutator super;

public:
    explicit IntrusiveListMutator()
    {
    }

    explicit IntrusiveListMutator(
        IntrusiveList<T,DerivedListNode> &list)
        : super(list)
    {
    }

    T *operator -> () const
    {
        return static_cast<T *>(
            static_cast<DerivedListNode *>(getCurrent()));
    }

    operator T * () const
    {
        return static_cast<T *>(
            static_cast<DerivedListNode *>(getCurrent()));
    }

    T & operator * () const
    {
        return *static_cast<T *>(
            static_cast<DerivedListNode *>(getCurrent()));
    }

    T *detach()
    {
        return static_cast<T *>(
            static_cast<DerivedListNode *>(super::detach()));
    }

    void repositionToFront(
        IntrusiveList<T,DerivedListNode> &list)
    {
        super::repositionToFront(list);
    }

    void repositionToFront()
    {
        super::repositionToFront();
    }
};

FENNEL_END_NAMESPACE

#endif

// End IntrusiveList.h

---