mazematrixmapD2< T, W > Class Template Reference

Build a map relative to a cell. More...

#include <mazematrixmapD2.h>

Inheritance diagram for mazematrixmapD2< T, W >:

Collaboration diagram for mazematrixmapD2< T, W >:

List of all members.

Public Types
typedef map< T, point2< W > >	mapping
typedef mapping::iterator	mappingiterator
Public Member Functions
void	relativeto (T i)
	Create a new map from ith cell as zero (0,0).
void	eval ()
	Build the map, called after reset(i);.
void	changeSet (W dx_, W dy_)
	Set the change relative to positive x and positive y axes.
	mazematrixmapD2 (mazematrixD2< T > &mz_, W dx_, W dy_)
	Constructor.
void	reset ()
	Reset the iterator.
T	currentIndex ()
	Access the current index.
cellD2< T > &	currentCell ()
	Access the current cell.
point2< W > &	currentPosition ()
	Access the current position.
boolc	operator! ()
	Is this iterator valid?
void	operator++ ()
	Increment iterator.
boolc	add (T id)
	The id must already be in the map ipt.
Public Attributes
mapping	ipt
	Index to point mapping.
mappingiterator	iter
	Actual iterator used.
T	zeroindex
	Origin cell.
mazematrixD2< T > &	mz
	Data structure which a map relative to a cell is created.
W	dx
	Change in x.
W	dy
	Change in y.

---

Detailed Description

template<typename T, typename W>
class mazematrixmapD2< T, W >

Build a map relative to a cell.

This is an iterator, where the cells neighbours are interpreted from top in a clockwise direction. The change is added and subtracted when a link is transversed.

Two types of iteration - map iteration and movement.

Definition at line 22 of file mazematrixmapD2.h.

---

Member Typedef Documentation

template<typename T, typename W>

typedef map< T, point2<W> > mazematrixmapD2< T, W >::mapping

Definition at line 26 of file mazematrixmapD2.h.

template<typename T, typename W>

typedef mapping::iterator mazematrixmapD2< T, W >::mappingiterator

Definition at line 27 of file mazematrixmapD2.h.

---

Constructor & Destructor Documentation

template<typename T, typename W>

mazematrixmapD2< T, W >::mazematrixmapD2	(	mazematrixD2< T > &	mz_,
		W	dx_,
		W	dy_
	)			[inline]

Constructor.

Definition at line 55 of file mazematrixmapD2.h.

    : zeroindex(0), mz(mz_)
    { changeSet(dx_,dy_); }

---

Member Function Documentation

template<typename T, typename W >

boolc mazematrixmapD2< T, W >::add

(

T

id

)

[inline]

The id must already be in the map ipt.

Definition at line 143 of file mazematrixmapD2.h.

References mazematrixmapD2< T, W >::dx, mazematrixmapD2< T, W >::dy, mazematrixmapD2< T, W >::ipt, mazematrixmapD2< T, W >::iter, mazematrixmapD2< T, W >::mz, cellD2< T >::ni, point2< T >::x, and point2< T >::y.

{
  assert(id!=0);
  assert(id<mz.vi.size());

  if (id==0)
    return false;
  if (id >= mz.vi.size())
    return false;

  iter = ipt.find(id); 

  assert(iter!=ipt.end());
  if (iter==ipt.end())
    return false;
  
  point2<W> k((*iter).second);

  // Assume uniqueness of cells. 

  mappingiterator i2;
  cellD2<T> & x(mz.vi[id]);

  if (x.ni[0]!=0)
  {
    i2=ipt.find(x.ni[0]);
    if (i2==ipt.end())
    {
      ipt.insert( make_pair(x.ni[0],point2<W>(k.x,k.y+dy)) );
    }
  }

  if (x.ni[2]!=0)
  {
    i2=ipt.find(x.ni[2]);
    if (i2==ipt.end())
    {
      ipt.insert( make_pair(x.ni[2],point2<W>(k.x,k.y-dy)) );
    }
  }

  if (x.ni[1]!=0)
  {
    i2=ipt.find(x.ni[1]);
    if (i2==ipt.end())
    {
      ipt.insert( make_pair(x.ni[1],point2<W>(k.x+dx,k.y)) );
    }
  }

  if (x.ni[3]!=0)
  {
    i2=ipt.find(x.ni[3]);
    if (i2==ipt.end())
    {
      ipt.insert( make_pair(x.ni[3],point2<W>(k.x-dx,k.y)) );
    }
  }

  return true;
}

template<typename T, typename W>

void mazematrixmapD2< T, W >::changeSet	(	W	dx_,
		W	dy_
	)			[inline]

Set the change relative to positive x and positive y axes.

Definition at line 51 of file mazematrixmapD2.h.

Referenced by mazematrixmapD2< uint, int >::mazematrixmapD2().

    { dx=dx_; dy=dy_; }

template<typename T, typename W>

cellD2<T>& mazematrixmapD2< T, W >::currentCell

(

)

[inline]

Access the current cell.

Definition at line 67 of file mazematrixmapD2.h.

Referenced by mazematrixmapD2< T, W >::eval().

    { return mz.vi[(*iter).first]; }

template<typename T, typename W>

T mazematrixmapD2< T, W >::currentIndex

(

)

[inline]

Access the current index.

Definition at line 64 of file mazematrixmapD2.h.

Referenced by maze001::constructgraphics(), and mazedisp01::draw().

    { return (*iter).first; }

template<typename T, typename W>

point2<W>& mazematrixmapD2< T, W >::currentPosition

(

)

[inline]

Access the current position.

Definition at line 70 of file mazematrixmapD2.h.

Referenced by maze001::constructgraphics(), and mazedisp01::draw().

    { return (*iter).second; }

template<typename T , typename W >

void mazematrixmapD2< T, W >::eval

(

)

[inline]

Build the map, called after reset(i);.

Definition at line 102 of file mazematrixmapD2.h.

References mazematrixmapD2< T, W >::currentCell(), cellD2< T >::id, mazematrixmapD2< T, W >::ipt, mazematrixmapD2< T, W >::iter, and mazematrixmapD2< T, W >::mz.

Referenced by mazedisp01::draw(), and maze001::maze001().

{
  iter = ipt.begin();
  cellD2<T>& x(currentCell());

  deque<T> process;
  process.push_back(x.id);
/*
  for (uint k=0; k<4; ++k)
  {
    if (x.ni[k]!=0)
      process.push_back(x.ni[k]);
  }
*/

  T id;
  for ( ; ! process.empty(); )
  {
    id = process.front();
//cout << SHOW(id) << endl;
    process.pop_front();

    assert(id < mz.vi.size());

    cellD2<T>& x2(mz.vi[id]);

    for (uint k=0; k<4; ++k)
    {
      if (x2.ni[k]!=0)
      {
        if (ipt.find(x2.ni[k])==ipt.end())
          process.push_back(x2.ni[k]);
      }
    }

    add(id);
  }
  
}

template<typename T, typename W>

boolc mazematrixmapD2< T, W >::operator!

(

)

[inline]

Is this iterator valid?

Definition at line 74 of file mazematrixmapD2.h.

    { return iter != ipt.end(); } 

template<typename T, typename W>

void mazematrixmapD2< T, W >::operator++

(

)

[inline]

Increment iterator.

Definition at line 77 of file mazematrixmapD2.h.

    { ++iter; }

template<typename T, typename W >

void mazematrixmapD2< T, W >::relativeto

(

T

i

)

[inline]

Create a new map from ith cell as zero (0,0).

Definition at line 91 of file mazematrixmapD2.h.

References mazematrixmapD2< T, W >::ipt, mazematrixmapD2< T, W >::mz, and mazematrixmapD2< T, W >::zeroindex.

Referenced by mazedisp01::draw(), and maze001::maze001().

{
  ipt.clear();
  assert(i<mz.vi.size());
  cellD2<T> & x = mz.vi[i];
  ipt.insert( make_pair(x.id,point2<W>(0,0)) ); 

  zeroindex=i;
}

template<typename T, typename W>

void mazematrixmapD2< T, W >::reset

(

)

[inline]

Reset the iterator.

Definition at line 60 of file mazematrixmapD2.h.

Referenced by maze001::constructgraphics(), and mazedisp01::draw().

    { iter=ipt.begin(); }

---

Member Data Documentation

template<typename T, typename W>

W mazematrixmapD2< T, W >::dx

Change in x.

Definition at line 40 of file mazematrixmapD2.h.

Referenced by mazematrixmapD2< T, W >::add(), and mazematrixmapD2< uint, int >::changeSet().

template<typename T, typename W>

W mazematrixmapD2< T, W >::dy

Change in y.

Definition at line 42 of file mazematrixmapD2.h.

Referenced by mazematrixmapD2< T, W >::add(), and mazematrixmapD2< uint, int >::changeSet().

template<typename T, typename W>

mapping mazematrixmapD2< T, W >::ipt

Index to point mapping.

Definition at line 30 of file mazematrixmapD2.h.

Referenced by mazematrixmapD2< T, W >::add(), mazematrixmapD2< T, W >::eval(), mazematrixmapD2< uint, int >::operator!(), mazematrixmapD2< T, W >::relativeto(), and mazematrixmapD2< uint, int >::reset().

template<typename T, typename W>

mappingiterator mazematrixmapD2< T, W >::iter

Actual iterator used.

Definition at line 32 of file mazematrixmapD2.h.

Referenced by mazematrixmapD2< T, W >::add(), mazematrixmapD2< T, W >::eval(), mazematrixmapD2< uint, int >::operator!(), mazematrixmapD2< uint, int >::operator++(), and mazematrixmapD2< uint, int >::reset().

template<typename T, typename W>

mazematrixD2<T>& mazematrixmapD2< T, W >::mz

Data structure which a map relative to a cell is created.

Definition at line 37 of file mazematrixmapD2.h.

Referenced by mazematrixmapD2< T, W >::add(), mazematrixmapD2< uint, int >::currentCell(), mazematrixmapD2< T, W >::eval(), and mazematrixmapD2< T, W >::relativeto().

template<typename T, typename W>

T mazematrixmapD2< T, W >::zeroindex

Origin cell.

Definition at line 34 of file mazematrixmapD2.h.

Referenced by mazematrixmapD2< T, W >::relativeto().

---

The documentation for this class was generated from the following file:

• maze/mazematrixmapD2.h