trunk/src/nodesx.h

/***************************************
 $Header: /home/amb/CVS/routino/src/nodesx.h,v 1.16 2009-09-07 19:01:58 amb Exp $

 A header file for the extended nodes.

 Part of the Routino routing software.
 ******************/ /******************
 This file Copyright 2008,2009 Andrew M. Bishop

 This program is free software: you can redistribute it and/or modify
 it under the terms of the GNU Affero General Public License as published by
 the Free Software Foundation, either version 3 of the License, or
 (at your option) any later version.

 This program is distributed in the hope that it will be useful,
 but WITHOUT ANY WARRANTY; without even the implied warranty of
 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 GNU Affero General Public License for more details.

 You should have received a copy of the GNU Affero General Public License
 along with this program.  If not, see <http://www.gnu.org/licenses/>.
 ***************************************/


#ifndef NODESX_H
#define NODESX_H    /*+ To stop multiple inclusions. +*/

#include <stdint.h>

#include "typesx.h"
#include "types.h"


/* Data structures */


/*+ An extended structure used for processing. +*/
struct _NodeX
{
 node_t    id;                  /*+ The node identifier. +*/

 latlong_t latitude;            /*+ The node latitude. +*/
 latlong_t longitude;           /*+ The node longitude. +*/
};

/*+ A structure containing a set of nodes (memory format). +*/
struct _NodesX
{
 char     *filename;            /*+ The name of the temporary file. +*/
 int       fd;                  /*+ The file descriptor of the temporary file. +*/

 uint32_t  xnumber;             /*+ The number of unsorted extended nodes. +*/

 NodeX    *xdata;               /*+ The extended node data (sorted). +*/

 uint32_t  number;              /*+ How many entries are still useful? +*/

 node_t  *idata;                /*+ The extended node data (sorted by ID). +*/

 uint8_t  *super;               /*+ A marker for super nodes (same order as idata). +*/

 Node     *ndata;               /*+ The actual nodes (same order as idata). +*/

 index_t  *gdata;               /*+ The extended node data (sorted geographically). +*/

 uint32_t latbins;              /*+ The number of bins containing latitude. +*/
 uint32_t lonbins;              /*+ The number of bins containing longitude. +*/

 ll_bin_t latzero;              /*+ The bin number of the furthest south bin. +*/
 ll_bin_t lonzero;              /*+ The bin number of the furthest west bin. +*/

 index_t *offsets;              /*+ An array of offset to the first node in each bin. +*/
};


/* Functions */

NodesX *NewNodeList(void);
void FreeNodeList(NodesX *nodesx);

void SaveNodeList(NodesX *nodesx,const char *filename);

index_t IndexNodeX(NodesX* nodesx,node_t id);

void AppendNode(NodesX* nodesx,node_t id,double latitude,double longitude);

void InitialSortNodeList(NodesX *nodesx);
void ReSortNodeList(NodesX *nodesx);
void FinalSortNodeList(NodesX* nodesx);

void SortNodeListGeographically(NodesX* nodesx);

void RemoveNonHighwayNodes(NodesX *nodesx,SegmentsX *segmentsx);

void CreateRealNodes(NodesX *nodesx,int iteration);

void IndexNodes(NodesX *nodesx,SegmentsX *segmentsx);


#endif /* NODESX_H */
1	amb	110	/***************************************
2	amb	257	$Header: /home/amb/CVS/routino/src/nodesx.h,v 1.16 2009-09-07 19:01:58 amb Exp $
3	amb	110
4			A header file for the extended nodes.
5	amb	151
6			Part of the Routino routing software.
7	amb	110	****************/ /****************
8	amb	151	This file Copyright 2008,2009 Andrew M. Bishop
9	amb	110
10	amb	151	This program is free software: you can redistribute it and/or modify
11			it under the terms of the GNU Affero General Public License as published by
12			the Free Software Foundation, either version 3 of the License, or
13			(at your option) any later version.
14
15			This program is distributed in the hope that it will be useful,
16			but WITHOUT ANY WARRANTY; without even the implied warranty of
17			MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18			GNU Affero General Public License for more details.
19
20			You should have received a copy of the GNU Affero General Public License
21			along with this program. If not, see <http://www.gnu.org/licenses/>.
22	amb	110	***************************************/
23
24
25			#ifndef NODESX_H
26			#define NODESX_H /+ To stop multiple inclusions. +/
27
28			#include <stdint.h>
29
30	amb	199	#include "typesx.h"
31	amb	110	#include "types.h"
32
33
34			/* Data structures */
35
36
37			/+ An extended structure used for processing. +/
38			struct _NodeX
39			{
40	amb	219	node_t id; /+ The node identifier. +/
41	amb	199
42	amb	223	latlong_t latitude; /+ The node latitude. +/
43			latlong_t longitude; /+ The node longitude. +/
44	amb	110	};
45
46			/+ A structure containing a set of nodes (memory format). +/
47			struct _NodesX
48			{
49	amb	252	char filename; /+ The name of the temporary file. +*/
50			int fd; /+ The file descriptor of the temporary file. +/
51	amb	216
52	amb	252	uint32_t xnumber; /+ The number of unsorted extended nodes. +/
53	amb	249
54	amb	252	NodeX xdata; /+ The extended node data (sorted). +*/
55	amb	216
56	amb	219	uint32_t number; /+ How many entries are still useful? +/
57	amb	110
58	amb	252	node_t idata; /+ The extended node data (sorted by ID). +*/
59	amb	216
60	amb	249	uint8_t super; /+ A marker for super nodes (same order as idata). +*/
61
62	amb	219	Node ndata; /+ The actual nodes (same order as idata). +*/
63	amb	257
64			index_t gdata; /+ The extended node data (sorted geographically). +*/
65
66			uint32_t latbins; /+ The number of bins containing latitude. +/
67			uint32_t lonbins; /+ The number of bins containing longitude. +/
68
69			ll_bin_t latzero; /+ The bin number of the furthest south bin. +/
70			ll_bin_t lonzero; /+ The bin number of the furthest west bin. +/
71
72			index_t offsets; /+ An array of offset to the first node in each bin. +*/
73	amb	110	};
74
75
76			/* Functions */
77
78	amb	256	NodesX *NewNodeList(void);
79	amb	226	void FreeNodeList(NodesX *nodesx);
80	amb	110
81			void SaveNodeList(NodesX nodesx,const char filename);
82
83	amb	249	index_t IndexNodeX(NodesX* nodesx,node_t id);
84	amb	110
85	amb	219	void AppendNode(NodesX* nodesx,node_t id,double latitude,double longitude);
86	amb	110
87	amb	252	void InitialSortNodeList(NodesX *nodesx);
88			void ReSortNodeList(NodesX *nodesx);
89			void FinalSortNodeList(NodesX* nodesx);
90	amb	110
91	amb	212	void SortNodeListGeographically(NodesX* nodesx);
92
93	amb	110	void RemoveNonHighwayNodes(NodesX nodesx,SegmentsX segmentsx);
94
95	amb	212	void CreateRealNodes(NodesX *nodesx,int iteration);
96	amb	110
97	amb	209	void IndexNodes(NodesX nodesx,SegmentsX segmentsx);
98	amb	110
99
100			#endif /* NODESX_H */