cellD3< T > Class Template Reference

Cell in 3D with 6 links. The meaning of the links is relative to the context. For example on meaning is to assign 0 to North, 1 to East, 2 to South, 3 to West, 4 to Front, 5 to Back. More...

#include <cellD3.h>

Collaboration diagram for cellD3< T >:

List of all members.

Public Member Functions
	cellD3 ()
	Construct with no links.
uintc	degree () const
	How many links to other cells exist?
uintc	niInv (T x) const
	Returns 6 if failed.
boolc	unvisited () const
	Has the node any links to other cells?
	operator stringc () const
	Serialize this object by writing it out as a string.
Public Attributes
T	ni [6]
	Neighbours.
T	id
	Id for this cell.

---

Detailed Description

template<typename T>
class cellD3< T >

Cell in 3D with 6 links. The meaning of the links is relative to the context. For example on meaning is to assign 0 to North, 1 to East, 2 to South, 3 to West, 4 to Front, 5 to Back.

However after graph simplification these may make no sense, as the structure is now a node graph.

Definition at line 19 of file cellD3.h.

---

Constructor & Destructor Documentation

template<typename T >

cellD3< T >::cellD3

(

)

[inline]

Construct with no links.

Definition at line 52 of file cellD3.h.

References cellD3< T >::ni.

{
  id=0;
  ni[0]=0;
  ni[1]=0;
  ni[2]=0;
  ni[3]=0;
  ni[4]=0;
  ni[5]=0;
}

---

Member Function Documentation

template<typename T >

uintc cellD3< T >::degree

(

)

const [inline]

How many links to other cells exist?

Definition at line 83 of file cellD3.h.

References cellD3< T >::ni.

Referenced by cellD3< T >::unvisited().

{
  uint count=0;
  if (ni[0])
    ++count;
  if (ni[1])
    ++count;
  if (ni[2])
    ++count;
  if (ni[3])
    ++count;
  if (ni[4])
    ++count;
  if (ni[5])
    ++count;

  return count;
}

template<typename T >

uintc cellD3< T >::niInv

(

T

x

)

const [inline]

Returns 6 if failed.

Definition at line 64 of file cellD3.h.

References cellD3< T >::ni.

{
  if (ni[0]==x)
    return 0;
  if (ni[1]==x)
    return 1;
  if (ni[2]==x)
    return 2;
  if (ni[3]==x)
    return 3;
  if (ni[4]==x)
    return 4;
  if (ni[5]==x)
    return 5;

  return 6;
}

template<typename T >

cellD3< T >::operator stringc

(

)

const [inline]

Serialize this object by writing it out as a string.

Definition at line 104 of file cellD3.h.

References cellD3< T >::id, and cellD3< T >::ni.

{
  string s;
  stringstream ss;
  ss << id;
  ss << " ";
  ss << ni[0];
  ss << " ";
  ss << ni[1];
  ss << " ";
  ss << ni[2];
  ss << " ";
  ss << ni[3];
  ss << " ";
  ss << ni[4];
  ss << " ";
  ss << ni[5];

  return ss.str();
}

template<typename T>

boolc cellD3< T >::unvisited

(

)

const [inline]

Has the node any links to other cells?

Definition at line 39 of file cellD3.h.

References cellD3< T >::degree().

    { return degree()==0; }

---

Member Data Documentation

template<typename T>

T cellD3< T >::id

Id for this cell.

Definition at line 27 of file cellD3.h.

Referenced by mazematrixD3< T >::add(), and cellD3< T >::operator stringc().

template<typename T>

T cellD3< T >::ni[6]

Neighbours.

Definition at line 24 of file cellD3.h.

Referenced by cellD3< T >::cellD3(), cellD3< T >::degree(), cellD3< T >::niInv(), and cellD3< T >::operator stringc().

---

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

• maze/cellD3.h