StiKTNIterator.h

//StiKTNIterator.h
//M.L. Miller (Yale Software)
//12/01

#ifndef StiKTNIterator_HH
#define StiKTNIterator_HH

#include <assert.h>
#include "StiKalmanTrackNode.h"
typedef StiKalmanTrackNode KTN_t;
class StiKTNIterator;
typedef StiKTNIterator StiKTNBidirectionalIterator;


//This is a temp hack to get around old gcc ansi-non-compliant STL implementation
class StiKTNIterator
{
public:
    
    StiKTNIterator(KTN_t* leaf=0,int dir=0) : mDir(dir),mNode( leaf) {};
    StiKTNIterator(KTN_t& leaf  ,int dir=0) : mDir(dir),mNode(&leaf) {};
    StiKTNIterator   begin();
    StiKTNIterator  rbegin();

    bool operator==(const StiKTNIterator& rhs) const;

    bool operator!=(const StiKTNIterator& rhs) const;

    KTN_t& operator*();
    KTN_t* operator()();
    
    StiKTNIterator& operator++ ();
    
    StiKTNIterator operator++(int);

    StiKTNIterator& operator-- ();
    
    StiKTNIterator operator--(int);

static const StiKTNIterator&  end();
static const StiKTNIterator& rend();

static    StiKTNIterator   begin(KTN_t* fist);
static    StiKTNIterator  rbegin(KTN_t* last);


private:
    int mDir;
    KTN_t* mNode;
};

class StiKTNForwardIterator: public StiKTNIterator{
public:
    StiKTNForwardIterator(KTN_t* leaf=0) : StiKTNIterator(leaf,1){};
    StiKTNForwardIterator(KTN_t& leaf  ) : StiKTNIterator(leaf,1){};
static const StiKTNForwardIterator& end();
};

//inlines --

inline bool StiKTNIterator::operator==(const StiKTNIterator& rhs) const
{
    return mNode==rhs.mNode;
}

inline bool StiKTNIterator::operator!=(const StiKTNIterator& rhs) const
{
    return !(mNode==rhs.mNode);
}

inline KTN_t& StiKTNIterator::operator*()
{
    return *mNode;
}
inline KTN_t* StiKTNIterator::operator()()
{
    return mNode;
}

//prefix
inline StiKTNIterator& StiKTNIterator::operator-- ()
{
    mDir = !mDir;
    ++(*this);
    mDir = !mDir;
    return *this;
}
    

//postfix
inline StiKTNIterator StiKTNIterator::operator++(int)
{
    StiKTNIterator temp = *this;
    ++(*this);
    return temp;
}

//prefix
inline StiKTNIterator& StiKTNIterator::operator++ ()
{
  assert(mNode);
  if(!mDir) { //forward direction  

    mNode = static_cast<KTN_t*>(mNode->getNextNode());

  } else { //backward direction

    mNode = static_cast<KTN_t*>(mNode->getPrevNode());
  }

  return *this;
}

//postfix decrement
inline StiKTNIterator StiKTNIterator::operator--(int)
{
    StiKTNIterator temp = *this;
    --(*this);
    return temp;
}


inline StiKTNIterator  StiKTNIterator::begin(KTN_t* fist)
{
  return StiKTNIterator(fist,0);
}  

inline StiKTNIterator StiKTNIterator::rbegin(KTN_t* last)
{
  return StiKTNIterator(last,1);
}  
inline StiKTNIterator  StiKTNIterator::begin()
{
  assert(mNode);
  KTN_t*  fist = (KTN_t*)mNode->getFirstNode();
  return StiKTNIterator(fist,0);
}  

inline StiKTNIterator StiKTNIterator::rbegin()
{
  assert(mNode);
  KTN_t* last = (KTN_t*)mNode->getLastNode();
  return StiKTNIterator(last,1);
}  

#endif