---

Map Class Reference

#include <map.h>

List of all members.

Public Methods
	Map (void)
	~Map ()
bool	load_map (char *)
void	show_map (void)
int	max_x (void)
int	max_y (void)
int	x (int node)
int	y (int node)
int	first_node (void)
int	num_nodes (void)
int	connected_to (int, int, int=-1)
int	num_connections (int, int=-1)
char *	get_name (int node)
int	next_short (int, int, bool, bool, bool)
bool	taxi (int node)
bool	bus (int node)
bool	subway (int node)
bool	taxi (int fromNode, int toNode)
bool	bus (int fromNode, int toNode)
bool	subway (int fromNode, int toNode)
vect	vehicle (int fromNode, int toNode)
Private Methods
void	initialize (int *array, int size)
void	get_field (int, mode)
Private Attributes
int	numNodes
int	maxX
int	maxY
MapNode *	nodes
ifstream	mapFile

---

Constructor & Destructor Documentation

Map::Map (  void    )  [inline]

Definition at line 42 of file map.h. References maxX, maxY, and numNodes. { numNodes= 0; nodes= NULL; maxX= 0; maxY= 0; }

Map::~Map (    )  [inline]

Definition at line 43 of file map.h. { delete [] nodes; }

---

Member Function Documentation

bool Map::bus (  int    fromNode, int    toNode )  [inline]

Definition at line 71 of file map.h. References Bus, and MapNode::is_link(). { return nodes[fromNode].is_link(toNode, Bus); }

bool Map::bus (  int    node )  [inline]

Definition at line 65 of file map.h. References Bus, and MapNode::is_link(). { return nodes[node].is_link(Bus); }

int Map::connected_to (  int   , int   , int    = -1 )

Definition at line 113 of file map.c. References between(), MapNode::find_join(), MapNode::find_link(), FIRST, nodes, and numNodes. { if ( between(node, FIRST, numNodes) ) if ( join > -1 ) return nodes[node].find_join(link, join); else { return nodes[node].find_link(link); } else { cerr << "Node " << node << " out of range (" << FIRST << ".." << numNodes << ")\n"; return 0; // node 0 points to NULL } }

int Map::first_node (  void    )  [inline]

Definition at line 54 of file map.h. References FIRST. { return FIRST; }

void Map::get_field (  int   , mode    )  [private]

Definition at line 23 of file map.c. References FIELD, MapNode::get_join(), MapNode::get_link(), mapFile, mode, nodes, SUB1, and SUB2. Referenced by load_map(). { // Input a transportation field from the map file. char ch; int link; mapFile >> ch; if ( ch != FIELD ) { mapFile.putback(ch); while ( ch != FIELD ) { mapFile >> link >> ch; nodes[node].get_link(link, transportation); if ( ch == SUB1 ) { // if a subfield is found... while ( ch != SUB2 ) { // ...loop through the subfield until end mapFile >> link >> ch; nodes[node].get_join(link); } mapFile >> ch; // pattern always ")," or ");" } } } }

char* Map::get_name (  int    node )  [inline]

Definition at line 60 of file map.h. References MapNode::find_name(). { return nodes[node].find_name(node); }

void Map::initialize (  int *    array, int    size )  [private]

Definition at line 18 of file map.c. { for (int i= 0; i < size; i++) array[i]= 0; }

bool Map::load_map (  char *    )

Definition at line 67 of file map.c. References Bus, EOLN, FIRST, get_field(), MapNode::get_name(), mapFile, maxX, maxY, nodes, numNodes, Subway, Taxi, MapNode::x, and MapNode::y. Referenced by main(). { // Read in a map and construct a data representation const int BUFFER= 40; // size of the "node name" input buffer const char COMMENT= '/'; // lines beginning with COMMENT are ignored char text[BUFFER], ch; int nodeNum= 0; mapFile.open(mapName, ios::in); if ( !mapFile.fail() ) { mapFile >> numNodes; nodes= new MapNode[numNodes + FIRST]; // store the adjacency list here assert (nodes != 0); while ( nodeNum < numNodes ) { // ignore lines commented with COMMENT if (mapFile.peek() == COMMENT) while (mapFile.get() != EOLN) ; mapFile >> nodeNum >> ch; get_field(nodeNum, Taxi); get_field(nodeNum, Bus); get_field(nodeNum, Subway); mapFile >> nodes[nodeNum].x >> ch; if (nodes[nodeNum].x > maxX) maxX= nodes[nodeNum].x; mapFile >> nodes[nodeNum].y >> ch; if (nodes[nodeNum].y > maxY) maxY= nodes[nodeNum].y; ch= mapFile.get(); while (ch == ' ') ch= mapFile.get(); // ignore whitespace mapFile.putback(ch); // put the last read character back into the buffer mapFile.getline(text, BUFFER, EOLN); // input node name and... // ...store name in adjacency list nodes[nodeNum].get_name(text, mapFile.gcount()); } } mapFile.close(); return (bool) mapFile.good(); // return true if all file operations went well }

int Map::max_x (  void    )  [inline]

Definition at line 48 of file map.h. References maxX. { return maxX; }

int Map::max_y (  void    )  [inline]

Definition at line 49 of file map.h. References maxY. { return maxY; }

int Map::next_short (  int   , int   , bool   , bool   , bool    )

Definition at line 147 of file map.c. { // This would have been a function to return the next nearest // link in a path using Dijkstra's shortest path algorithm. // Design changes, however, have made this function obsolete. // A nearest-neighbor algorithm is used instead. We have // decided to implement this algorithm outside of the map // module. return 0; }

int Map::num_connections (  int   , int    = -1 )

Definition at line 131 of file map.c. References between(), FIRST, nodes, MapNode::num_joins(), MapNode::numLinks, and numNodes. { if ( between(node, FIRST, numNodes) ) if ( join > -1 ) return nodes[node].num_joins(join); else return nodes[node].numLinks; else { cerr << "Node " << node << " out of range (" << FIRST << ".." << numNodes << ")\n"; return 0; // node 0 points to NULL } }

int Map::num_nodes (  void    )  [inline]

Definition at line 55 of file map.h. References numNodes. { return numNodes; }

void Map::show_map (  void    )

Definition at line 54 of file map.c. References EOLN, FIRST, maxX, maxY, nodes, numNodes, and MapNode::show_node(). { // Show a tabular representation of the map for testing/debugging // purposes. for (int i= FIRST; i < numNodes; i++) { cout << "\nNODE #" << i << ": "; nodes[i].show_node(); } cout << "\nmax x: " << maxX << "\nmax y: " << maxY << EOLN; }

bool Map::subway (  int    fromNode, int    toNode )  [inline]

Definition at line 74 of file map.h. References MapNode::is_link(), and Subway. { return nodes[fromNode].is_link(toNode, Subway); }

bool Map::subway (  int    node )  [inline]

Definition at line 66 of file map.h. References MapNode::is_link(), and Subway. { return nodes[node].is_link(Subway); }

bool Map::taxi (  int    fromNode, int    toNode )  [inline]

Definition at line 68 of file map.h. References MapNode::is_link(), and Taxi. { return nodes[fromNode].is_link(toNode, Taxi); }

bool Map::taxi (  int    node )  [inline]

Definition at line 64 of file map.h. References MapNode::is_link(), and Taxi. { return nodes[node].is_link(Taxi); }

vect Map::vehicle (  int    fromNode, int    toNode )  [inline]

Definition at line 77 of file map.h. References MapNode::find_vector(), and vect. { return nodes[fromNode].find_vector(toNode); }

int Map::x (  int    node )  [inline]

Definition at line 51 of file map.h. References MapNode::x. { return nodes[node].x; }

int Map::y (  int    node )  [inline]

Definition at line 52 of file map.h. References MapNode::y. { return nodes[node].y; }

---

Member Data Documentation

ifstream Map::mapFile [private]

Definition at line 36 of file map.h. Referenced by get_field(), and load_map().

int Map::maxX [private]

Definition at line 31 of file map.h. Referenced by load_map(), Map(), max_x(), and show_map().

int Map::maxY [private]

Definition at line 31 of file map.h. Referenced by load_map(), Map(), max_y(), and show_map().

MapNode* Map::nodes [private]

Definition at line 35 of file map.h. Referenced by connected_to(), get_field(), load_map(), num_connections(), and show_map().

int Map::numNodes [private]

Definition at line 31 of file map.h. Referenced by connected_to(), load_map(), Map(), num_connections(), num_nodes(), and show_map().

---

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

• map.h
• map.c

---