trunk/src/segmentsx.h

/***************************************
 $Header: /home/amb/CVS/routino/src/segmentsx.h,v 1.11 2009-07-01 18:23:26 amb Exp $

 A header file for the extended segments.

 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 SEGMENTSX_H
#define SEGMENTSX_H    /*+ To stop multiple inclusions. +*/

#include <stdint.h>

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


/* Data structures */


/*+ An extended structure used for processing. +*/
struct _SegmentX
{
 node_t     node1;              /*+ The id of the starting node. +*/
 node_t     node2;              /*+ The id of the finishing node. +*/

 way_t      way;                /*+ The id of the way. +*/

 distance_t distance;           /*+ The distance between the nodes. +*/
};


/*+ A structure containing a set of segments (memory format). +*/
struct _SegmentsX
{
 uint32_t   sorted;             /*+ Is the data sorted and therefore searchable? +*/
 uint32_t   alloced;            /*+ How many entries are allocated? +*/
 uint32_t   xnumber;            /*+ How many entries are used from those allocated? +*/
 uint32_t   number;             /*+ How many entries are still useful? +*/

 SegmentX  *xdata;              /*+ The extended segment data (unsorted). +*/
 SegmentX **ndata;              /*+ The extended segment data (sorted by node). +*/

 Segment   *sdata;              /*+ The segment data (same order as ndata). +*/
};


/* Functions */


SegmentsX *NewSegmentList(void);
void FreeSegmentList(SegmentsX *segmentsx);

void SaveSegmentList(SegmentsX *segmentsx,const char *filename);

SegmentX **FindFirstSegmentX(SegmentsX* segmentsx,node_t node);
SegmentX **FindNextSegmentX(SegmentsX* segmentsx,SegmentX **segmentx);

void AppendSegment(SegmentsX* segmentsx,way_t way,node_t node1,node_t node2,distance_t distance);

void SortSegmentList(SegmentsX *segmentsx);

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

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

void RotateSegments(SegmentsX* segmentsx);

void DeduplicateSegments(SegmentsX* segmentsx,WaysX *waysx);

void CreateRealSegments(SegmentsX *segmentsx,WaysX *waysx);

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

distance_t DistanceX(NodeX *nodex1,NodeX *nodex2);


#endif /* SEGMENTSX_H */
1	amb	110	/***************************************
2	amb	212	$Header: /home/amb/CVS/routino/src/segmentsx.h,v 1.11 2009-07-01 18:23:26 amb Exp $
3	amb	110
4			A header file for the extended segments.
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 SEGMENTSX_H
26			#define SEGMENTSX_H /+ To stop multiple inclusions. +/
27
28			#include <stdint.h>
29
30	amb	199	#include "typesx.h"
31	amb	110	#include "types.h"
32			#include "segments.h"
33
34
35			/* Data structures */
36
37
38			/+ An extended structure used for processing. +/
39			struct _SegmentX
40			{
41	amb	209	node_t node1; /+ The id of the starting node. +/
42			node_t node2; /+ The id of the finishing node. +/
43	amb	110
44	amb	209	way_t way; /+ The id of the way. +/
45	amb	203
46	amb	209	distance_t distance; /+ The distance between the nodes. +/
47	amb	110	};
48
49
50			/+ A structure containing a set of segments (memory format). +/
51			struct _SegmentsX
52			{
53			uint32_t sorted; /+ Is the data sorted and therefore searchable? +/
54			uint32_t alloced; /+ How many entries are allocated? +/
55	amb	128	uint32_t xnumber; /+ How many entries are used from those allocated? +/
56			uint32_t number; /+ How many entries are still useful? +/
57	amb	110
58	amb	210	SegmentX xdata; /+ The extended segment data (unsorted). +*/
59	amb	206	SegmentX *ndata; /+ The extended segment data (sorted by node). +*/
60	amb	209
61			Segment sdata; /+ The segment data (same order as ndata). +*/
62	amb	110	};
63
64
65			/* Functions */
66
67
68			SegmentsX *NewSegmentList(void);
69			void FreeSegmentList(SegmentsX *segmentsx);
70
71			void SaveSegmentList(SegmentsX segmentsx,const char filename);
72
73			SegmentX *FindFirstSegmentX(SegmentsX segmentsx,node_t node);
74			SegmentX *FindNextSegmentX(SegmentsX segmentsx,SegmentX **segmentx);
75
76	amb	209	void AppendSegment(SegmentsX* segmentsx,way_t way,node_t node1,node_t node2,distance_t distance);
77	amb	110
78			void SortSegmentList(SegmentsX *segmentsx);
79
80	amb	204	void RemoveBadSegments(NodesX nodesx,SegmentsX segmentsx);
81	amb	110
82			void MeasureSegments(SegmentsX segmentsx,NodesX nodesx);
83
84	amb	212	void RotateSegments(SegmentsX* segmentsx);
85	amb	110
86	amb	212	void DeduplicateSegments(SegmentsX* segmentsx,WaysX *waysx);
87	amb	110
88	amb	209	void CreateRealSegments(SegmentsX segmentsx,WaysX waysx);
89
90	amb	110	void IndexSegments(SegmentsX* segmentsx,NodesX *nodesx);
91
92			distance_t DistanceX(NodeX nodex1,NodeX nodex2);
93
94
95			#endif /* SEGMENTSX_H */