Routino SVN Repository Browser

Check out the latest version of Routino: svn co http://routino.org/svn/trunk routino

ViewVC logotype

Contents of /trunk/src/nodesx.h

Parent Directory Parent Directory | Revision Log Revision Log


Revision 212 - (show annotations) (download) (as text)
Wed Jul 1 18:23:26 2009 UTC (15 years, 8 months ago) by amb
File MIME type: text/x-chdr
File size: 3044 byte(s)
Remove the Node structure from the NodeX structure to save memory.

1 /***************************************
2 $Header: /home/amb/CVS/routino/src/nodesx.h,v 1.6 2009-07-01 18:23:26 amb Exp $
3
4 A header file for the extended nodes.
5
6 Part of the Routino routing software.
7 ******************/ /******************
8 This file Copyright 2008,2009 Andrew M. Bishop
9
10 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 ***************************************/
23
24
25 #ifndef NODESX_H
26 #define NODESX_H /*+ To stop multiple inclusions. +*/
27
28 #include <stdint.h>
29
30 #include "typesx.h"
31 #include "types.h"
32 #include "nodes.h"
33
34
35 /* Data structures */
36
37
38 /*+ An extended structure used for processing. +*/
39 struct _NodeX
40 {
41 node_t id; /*+ The node identifier. +*/
42
43 float latitude; /*+ The node latitude. +*/
44 float longitude; /*+ The node longitude. +*/
45
46 uint8_t super; /*+ A marker for super nodes. +*/
47 };
48
49 /*+ A structure containing a set of nodes (memory format). +*/
50 struct _NodesX
51 {
52 uint32_t sorted; /*+ Is the data sorted and therefore searchable? +*/
53 uint32_t alloced; /*+ How many entries are allocated? +*/
54 uint32_t xnumber; /*+ How many entries are used from those allocated? +*/
55 uint32_t number; /*+ How many entries are still useful? +*/
56
57 float lat_min; /*+ The minimum latitude of the set of nodes. +*/
58 float lat_max; /*+ The maximum latitude of the set of nodes. +*/
59 float lon_min; /*+ The minimum longitude of the set of nodes. +*/
60 float lon_max; /*+ The maximum longitude of the set of nodes. +*/
61
62 NodeX *xdata; /*+ The extended node data (unsorted). +*/
63 NodeX **gdata; /*+ The extended node data (sorted geographically). +*/
64 NodeX **idata; /*+ The extended node data (sorted by ID). +*/
65
66 Node *ndata; /*+ The actual nodes (same order as idata). +*/
67 };
68
69
70 /* Functions */
71
72 NodesX *NewNodeList(void);
73
74 void SaveNodeList(NodesX *nodesx,const char *filename);
75
76 NodeX **FindNodeX(NodesX* nodesx,node_t id);
77
78 void AppendNode(NodesX* nodesx,node_t id,float latitude,float longitude);
79
80 void SortNodeList(NodesX *nodesx);
81
82 void SortNodeListGeographically(NodesX* nodesx);
83
84 void RemoveNonHighwayNodes(NodesX *nodesx,SegmentsX *segmentsx);
85
86 void CreateRealNodes(NodesX *nodesx,int iteration);
87
88 void IndexNodes(NodesX *nodesx,SegmentsX *segmentsx);
89
90
91 #endif /* NODESX_H */

Properties

Name Value
cvs:description Extended nodes header.