source: code/trunk/src/external/bullet/LinearMath/btList.h @ 8653

/*
Copyright (c) 2003-2006 Gino van den Bergen / Erwin Coumans  http://continuousphysics.com/Bullet/

This software is provided 'as-is', without any express or implied warranty.
In no event will the authors be held liable for any damages arising from the use of this software.
Permission is granted to anyone to use this software for any purpose, 
including commercial applications, and to alter it and redistribute it freely, 
subject to the following restrictions:

1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
*/



#ifndef BT_GEN_LIST_H
#define BT_GEN_LIST_H

class btGEN_Link {
public:
    btGEN_Link() : m_next(0), m_prev(0) {}
    btGEN_Link(btGEN_Link *next, btGEN_Link *prev) : m_next(next), m_prev(prev) {}
    
    btGEN_Link *getNext() const { return m_next; }  
    btGEN_Link *getPrev() const { return m_prev; }  

    bool isHead() const { return m_prev == 0; }
    bool isTail() const { return m_next == 0; }

    void insertBefore(btGEN_Link *link) {
        m_next         = link;
        m_prev         = link->m_prev;
        m_next->m_prev = this;
        m_prev->m_next = this;
    } 

    void insertAfter(btGEN_Link *link) {
        m_next         = link->m_next;
        m_prev         = link;
        m_next->m_prev = this;
        m_prev->m_next = this;
    } 

    void remove() { 
        m_next->m_prev = m_prev; 
        m_prev->m_next = m_next;
    }

private:  
    btGEN_Link  *m_next;
    btGEN_Link  *m_prev;
};

class btGEN_List {
public:
    btGEN_List() : m_head(&m_tail, 0), m_tail(0, &m_head) {}

    btGEN_Link *getHead() const { return m_head.getNext(); } 
    btGEN_Link *getTail() const { return m_tail.getPrev(); } 

    void addHead(btGEN_Link *link) { link->insertAfter(&m_head); }
    void addTail(btGEN_Link *link) { link->insertBefore(&m_tail); }
    
private:
    btGEN_Link m_head;
    btGEN_Link m_tail;
};

#endif //BT_GEN_LIST_H