SyncronousAutomaton< T > Class Template Reference

The SyncronousAutomaton is almost the same that the Automaton class but with the elements to accomplish synchronicity. More...

#include <SyncronousAutomaton.h>

List of all members.

Public Member Functions

 SyncronousAutomaton (T *gridPointer, T *gridTPlusOnePointer, int Dsizes[], int dimesions)
 The constructor.
 SyncronousAutomaton (const SyncronousAutomaton &a)
 The copy-constructor:.
SyncronousAutomatonoperator= (const SyncronousAutomaton &a)
 Overwrite the = operator to avoid problems when you forget initialize whit the constructor.
void setMap ()
 ToDo:.
void getMap ()
 ToDo:.
void setNeighborhood ()
 ToDo:.
void getNeighborhood ()
 ToDo:.
void iterateOverTheSatesArray (int index=0)
void nextStep ()
 ToDo:.
void createNode ()
 ToDo:.
void getNodePointer (std::vector< int > position)
void getNodePointer (int position[])
 ToDo:.
void getNodePointer ()
 ToDo:.

Public Attributes

T * copyPointerToNodes
 ToDo:.
T * pointerToNodesTPlusOne
 ToDo:.
T * copyPointerToNodesTPlusOne
 ToDo:.
T * copyPointerToNodes2
 this is used in createNode method
T * copyPointerToNodesTPlusOne2
 ToDo:.
std::vector< T * > neighbors
 ToDo:.
std::vector< SyncronousNodegraph
 ToDo:.
int dimSizes [maxDimensions]
 ToDo:.
int copyDimSizes [maxDimensions]
 ToDo:.
int dimension
 ToDo:.
int indexHood
Mapmap
Topologytopology
 ToDo:.
Neighborhoodneighborhood
 ToDo:.
int states
 ToDo:.

Static Public Attributes

static const int maxDimensions = 100

Classes

struct  SyncronousNode
 This structure represent a vertex in synchronous graph with all is properties. More...


Detailed Description

template<class T>
class SyncronousAutomaton< T >

The SyncronousAutomaton is almost the same that the Automaton class but with the elements to accomplish synchronicity.

This class have all the characteristics that Automaton class, the only difference is the modification in the SyncronousNode structure, and in the dynamics of the methods to set the pointers and modify the values of the base element matrix copy to accomplish the synchronization.


Member Function Documentation

template<class T>
void SyncronousAutomaton< T >::getNodePointer ( std::vector< int >  position  ) 

If you want to access any element in the multi-dimensional array, the states array; use the pointer to the first element and advance the pointer to the position array of the element to acces

template<class T>
void SyncronousAutomaton< T >::iterateOverTheSatesArray ( int  index = 0  ) 

In this function are created all the neigbor's, and and set the pointers to the states matrix, the structure of the net is glue by union structures, they consist of one pointer to a cell (the center cell), and the index (index of a vector or array container) of the pointer's list, list of pointers to the elements in the game board, the pointers represent neighbor's of the center cells, the index represents the start, and end of a neighborhood of a the center cell of the union


Member Data Documentation

template<class T>
int SyncronousAutomaton< T >::indexHood

this int value is to "remember where starts, and finish" some neighborhood in the vertex's vector

template<class T>
Map* SyncronousAutomaton< T >::map

the map is the objet who correlate the topology of the graph, and the creation of the neighborhood's(the vertex of the graphs)

template<class T>
const int SyncronousAutomaton< T >::maxDimensions = 100 [static]

this array's represents the dimensionality of the Automaton (the size of the array's dimension's)the number of the i element in the array represent the number of "cell's" in the i dimension


The documentation for this class was generated from the following file:
Generated on Thu Aug 17 00:04:37 2006 for Cagecpp by  doxygen 1.4.7