Check out the latest version of Routino: svn co http://routino.org/svn/trunk routino
Annotation of /trunk/src/segmentsx.h
Parent Directory
|
Revision Log
Revision 228 -
(hide annotations)
(download)
(as text)
Sun Jul 12 09:01:48 2009 UTC (15 years, 8 months ago) by amb
File MIME type: text/x-chdr
File size: 2965 byte(s)
Sun Jul 12 09:01:48 2009 UTC (15 years, 8 months ago) by amb
File MIME type: text/x-chdr
File size: 2965 byte(s)
Tidy up and fix comments and include files.
1 | amb | 110 | /*************************************** |
2 | amb | 228 | $Header: /home/amb/CVS/routino/src/segmentsx.h,v 1.13 2009-07-12 09:01:48 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 | |||
33 | |||
34 | /* Data structures */ | ||
35 | |||
36 | |||
37 | /*+ An extended structure used for processing. +*/ | ||
38 | struct _SegmentX | ||
39 | { | ||
40 | amb | 209 | node_t node1; /*+ The id of the starting node. +*/ |
41 | node_t node2; /*+ The id of the finishing node. +*/ | ||
42 | amb | 110 | |
43 | amb | 209 | way_t way; /*+ The id of the way. +*/ |
44 | amb | 203 | |
45 | amb | 209 | distance_t distance; /*+ The distance between the nodes. +*/ |
46 | amb | 110 | }; |
47 | |||
48 | |||
49 | /*+ A structure containing a set of segments (memory format). +*/ | ||
50 | struct _SegmentsX | ||
51 | { | ||
52 | uint32_t sorted; /*+ Is the data sorted and therefore searchable? +*/ | ||
53 | amb | 216 | |
54 | int32_t row; /*+ How many rows are allocated? +*/ | ||
55 | uint32_t col; /*+ How many columns are used in the last row? +*/ | ||
56 | |||
57 | SegmentX **xdata; /*+ The extended segment data (unsorted). +*/ | ||
58 | |||
59 | amb | 128 | uint32_t number; /*+ How many entries are still useful? +*/ |
60 | amb | 110 | |
61 | amb | 206 | SegmentX **ndata; /*+ The extended segment data (sorted by node). +*/ |
62 | amb | 209 | |
63 | Segment *sdata; /*+ The segment data (same order as ndata). +*/ | ||
64 | amb | 110 | }; |
65 | |||
66 | |||
67 | /* Functions */ | ||
68 | |||
69 | |||
70 | SegmentsX *NewSegmentList(void); | ||
71 | void FreeSegmentList(SegmentsX *segmentsx); | ||
72 | |||
73 | void SaveSegmentList(SegmentsX *segmentsx,const char *filename); | ||
74 | |||
75 | SegmentX **FindFirstSegmentX(SegmentsX* segmentsx,node_t node); | ||
76 | SegmentX **FindNextSegmentX(SegmentsX* segmentsx,SegmentX **segmentx); | ||
77 | |||
78 | amb | 209 | void AppendSegment(SegmentsX* segmentsx,way_t way,node_t node1,node_t node2,distance_t distance); |
79 | amb | 110 | |
80 | void SortSegmentList(SegmentsX *segmentsx); | ||
81 | |||
82 | amb | 204 | void RemoveBadSegments(NodesX *nodesx,SegmentsX *segmentsx); |
83 | amb | 110 | |
84 | void MeasureSegments(SegmentsX *segmentsx,NodesX *nodesx); | ||
85 | |||
86 | amb | 212 | void RotateSegments(SegmentsX* segmentsx); |
87 | amb | 110 | |
88 | amb | 212 | void DeduplicateSegments(SegmentsX* segmentsx,WaysX *waysx); |
89 | amb | 110 | |
90 | amb | 209 | void CreateRealSegments(SegmentsX *segmentsx,WaysX *waysx); |
91 | |||
92 | amb | 110 | void IndexSegments(SegmentsX* segmentsx,NodesX *nodesx); |
93 | |||
94 | |||
95 | #endif /* SEGMENTSX_H */ |
Properties
Name | Value |
---|---|
cvs:description | Extended segments header. |