trunk/src/filedumper.c

/***************************************
 $Header: /home/amb/CVS/routino/src/filedumper.c,v 1.2 2009-01-03 12:25:23 amb Exp $

 Memory file dumper.
 ******************/ /******************
 Written by Andrew M. Bishop

 This file Copyright 2008,2009 Andrew M. Bishop
 It may be distributed under the GNU Public License, version 2, or
 any higher version.  See section COPYING of the GNU Public license
 for conditions under which this file may be redistributed.
 ***************************************/


#include <stdio.h>
#include <stdlib.h>

#include "functions.h"
#include "types.h"


extern Nodes    *OSMNodes;
extern Ways     *OSMWays;
extern Segments *OSMSegments;


int main(int argc,char** argv)
{
 int i;
 Node    *node;
 Way     *way;
 Segment *segment;

 /* Check the nodes */

 LoadNodeList("data/nodes.mem");

 printf("Nodes\n");
 printf("-----\n");

 printf("sizeof(Node)=%d\n",sizeof(Node));
 printf("alloced=%d\n",OSMNodes->alloced);
 printf("number=%d\n",OSMNodes->number);

 // for(i=0;i<OSMNodes->number;i++)
 //    printf("%8d %7.3f %7.3f\n",OSMNodes->nodes[i].id,OSMNodes->nodes[i].latitude,OSMNodes->nodes[i].longitude);

 node=FindNode(OSMNodes->nodes[0].id-1);
 printf("%s find node %d = %d\n",node?"Did":"Didn't",OSMNodes->nodes[0].id-1,node?node->id:0);

 node=FindNode(OSMNodes->nodes[0].id);
 printf("%s find node %d = %d\n",node?"Did":"Didn't",OSMNodes->nodes[0].id,node?node->id:0);

 node=FindNode(OSMNodes->nodes[OSMNodes->number-1].id);
 printf("%s find node %d = %d\n",node?"Did":"Didn't",OSMNodes->nodes[OSMNodes->number-1].id,node?node->id:0);

 node=FindNode(OSMNodes->nodes[OSMNodes->number-1].id+1);
 printf("%s find node %d = %d\n",node?"Did":"Didn't",OSMNodes->nodes[OSMNodes->number-1].id+1,node?node->id:0);

 node=FindNode(296954441);
 printf("%s find node %d = %d\n",node?"Did":"Didn't",296954441,node?node->id:0);

 node=FindNode(296954440);
 printf("%s find node %d = %d\n",node?"Did":"Didn't",296954440,node?node->id:0);

 /* Check the ways */

 LoadWayList("data/ways.mem");

 printf("\n");
 printf("Ways\n");
 printf("----\n");

 printf("sizeof(Way)=%d\n",sizeof(Way));
 printf("alloced=%d\n",OSMWays->alloced);
 printf("number=%d\n",OSMWays->number);
 printf("strings=%d\n",OSMWays->number_str);

 // for(i=0;i<OSMWays->number;i++)
 //    printf("%8d %7.3f %7.3f\n",OSMWays->ways[i].id,OSMWays->ways[i].latitude,OSMWays->ways[i].longitude);

 way=FindWay(OSMWays->ways[0].id-1);
 printf("%s find way %d = %d\n",way?"Did":"Didn't",OSMWays->ways[0].id-1,way?way->id:0);

 way=FindWay(OSMWays->ways[0].id);
 printf("%s find way %d = %d\n",way?"Did":"Didn't",OSMWays->ways[0].id,way?way->id:0);

 way=FindWay(OSMWays->ways[OSMWays->number-1].id);
 printf("%s find way %d = %d\n",way?"Did":"Didn't",OSMWays->ways[OSMWays->number-1].id,way?way->id:0);

 way=FindWay(OSMWays->ways[OSMWays->number-1].id+1);
 printf("%s find way %d = %d\n",way?"Did":"Didn't",OSMWays->ways[OSMWays->number-1].id+1,way?way->id:0);

 way=FindWay(296954441);
 printf("%s find way %d = %d\n",way?"Did":"Didn't",296954441,way?way->id:0);

 way=FindWay(296954440);
 printf("%s find way %d = %d\n",way?"Did":"Didn't",296954440,way?way->id:0);

 /* Check the segments */

 LoadSegmentList("data/segments.mem");

 printf("\n");
 printf("Segments\n");
 printf("--------\n");

 printf("sizeof(Segment)=%d\n",sizeof(Segment));
 printf("alloced=%d\n",OSMSegments->alloced);
 printf("number=%d\n",OSMSegments->number);

 // for(i=0;i<OSMSegments->number;i++)
 //    printf("%8d %7.3f %7.3f\n",OSMSegments->segments[i].id,OSMSegments->segments[i].latitude,OSMSegments->segments[i].longitude);

 segment=FindFirstSegment(OSMSegments->segments[0].node1-1);
 printf("%s find segment %d = %d\n",segment?"Did":"Didn't",OSMSegments->segments[0].node1-1,segment?segment->node1:0);

 segment=FindFirstSegment(OSMSegments->segments[0].node1);
 printf("%s find segment %d = %d\n",segment?"Did":"Didn't",OSMSegments->segments[0].node1,segment?segment->node1:0);

 segment=FindFirstSegment(OSMSegments->segments[OSMSegments->number-1].node1);
 printf("%s find segment %d = %d\n",segment?"Did":"Didn't",OSMSegments->segments[OSMSegments->number-1].node1,segment?segment->node1:0);

 segment=FindFirstSegment(OSMSegments->segments[OSMSegments->number-1].node1+1);
 printf("%s find segment %d = %d\n",segment?"Did":"Didn't",OSMSegments->segments[OSMSegments->number-1].node1+1,segment?segment->node1:0);

 segment=FindFirstSegment(296954441);
 printf("%s find segment %d = %d\n",segment?"Did":"Didn't",296954441,segment?segment->node1:0);

 segment=FindFirstSegment(296954440);
 printf("%s find segment %d = %d\n",segment?"Did":"Didn't",296954440,segment?segment->node1:0);

 return(0);
}
1	amb	2	/***************************************
2	amb	6	$Header: /home/amb/CVS/routino/src/filedumper.c,v 1.2 2009-01-03 12:25:23 amb Exp $
3	amb	2
4			Memory file dumper.
5			****************/ /****************
6			Written by Andrew M. Bishop
7
8	amb	6	This file Copyright 2008,2009 Andrew M. Bishop
9	amb	2	It may be distributed under the GNU Public License, version 2, or
10			any higher version. See section COPYING of the GNU Public license
11			for conditions under which this file may be redistributed.
12			***************************************/
13
14
15			#include <stdio.h>
16			#include <stdlib.h>
17
18			#include "functions.h"
19			#include "types.h"
20
21
22	amb	6	extern Nodes *OSMNodes;
23			extern Ways *OSMWays;
24	amb	2	extern Segments *OSMSegments;
25
26
27			int main(int argc,char** argv)
28			{
29			int i;
30	amb	6	Node *node;
31			Way *way;
32	amb	2	Segment *segment;
33
34			/* Check the nodes */
35
36			LoadNodeList("data/nodes.mem");
37
38	amb	6	printf("Nodes\n");
39			printf("-----\n");
40
41			printf("sizeof(Node)=%d\n",sizeof(Node));
42	amb	2	printf("alloced=%d\n",OSMNodes->alloced);
43			printf("number=%d\n",OSMNodes->number);
44
45			// for(i=0;i<OSMNodes->number;i++)
46			// printf("%8d %7.3f %7.3f\n",OSMNodes->nodes[i].id,OSMNodes->nodes[i].latitude,OSMNodes->nodes[i].longitude);
47
48			node=FindNode(OSMNodes->nodes[0].id-1);
49			printf("%s find node %d = %d\n",node?"Did":"Didn't",OSMNodes->nodes[0].id-1,node?node->id:0);
50
51			node=FindNode(OSMNodes->nodes[0].id);
52			printf("%s find node %d = %d\n",node?"Did":"Didn't",OSMNodes->nodes[0].id,node?node->id:0);
53
54			node=FindNode(OSMNodes->nodes[OSMNodes->number-1].id);
55			printf("%s find node %d = %d\n",node?"Did":"Didn't",OSMNodes->nodes[OSMNodes->number-1].id,node?node->id:0);
56
57			node=FindNode(OSMNodes->nodes[OSMNodes->number-1].id+1);
58			printf("%s find node %d = %d\n",node?"Did":"Didn't",OSMNodes->nodes[OSMNodes->number-1].id+1,node?node->id:0);
59
60			node=FindNode(296954441);
61			printf("%s find node %d = %d\n",node?"Did":"Didn't",296954441,node?node->id:0);
62
63			node=FindNode(296954440);
64			printf("%s find node %d = %d\n",node?"Did":"Didn't",296954440,node?node->id:0);
65
66	amb	6	/* Check the ways */
67
68			LoadWayList("data/ways.mem");
69
70			printf("\n");
71			printf("Ways\n");
72			printf("----\n");
73
74			printf("sizeof(Way)=%d\n",sizeof(Way));
75			printf("alloced=%d\n",OSMWays->alloced);
76			printf("number=%d\n",OSMWays->number);
77			printf("strings=%d\n",OSMWays->number_str);
78
79			// for(i=0;i<OSMWays->number;i++)
80			// printf("%8d %7.3f %7.3f\n",OSMWays->ways[i].id,OSMWays->ways[i].latitude,OSMWays->ways[i].longitude);
81
82			way=FindWay(OSMWays->ways[0].id-1);
83			printf("%s find way %d = %d\n",way?"Did":"Didn't",OSMWays->ways[0].id-1,way?way->id:0);
84
85			way=FindWay(OSMWays->ways[0].id);
86			printf("%s find way %d = %d\n",way?"Did":"Didn't",OSMWays->ways[0].id,way?way->id:0);
87
88			way=FindWay(OSMWays->ways[OSMWays->number-1].id);
89			printf("%s find way %d = %d\n",way?"Did":"Didn't",OSMWays->ways[OSMWays->number-1].id,way?way->id:0);
90
91			way=FindWay(OSMWays->ways[OSMWays->number-1].id+1);
92			printf("%s find way %d = %d\n",way?"Did":"Didn't",OSMWays->ways[OSMWays->number-1].id+1,way?way->id:0);
93
94			way=FindWay(296954441);
95			printf("%s find way %d = %d\n",way?"Did":"Didn't",296954441,way?way->id:0);
96
97			way=FindWay(296954440);
98			printf("%s find way %d = %d\n",way?"Did":"Didn't",296954440,way?way->id:0);
99
100	amb	2	/* Check the segments */
101
102			LoadSegmentList("data/segments.mem");
103
104	amb	6	printf("\n");
105			printf("Segments\n");
106			printf("--------\n");
107
108			printf("sizeof(Segment)=%d\n",sizeof(Segment));
109	amb	2	printf("alloced=%d\n",OSMSegments->alloced);
110			printf("number=%d\n",OSMSegments->number);
111
112			// for(i=0;i<OSMSegments->number;i++)
113			// printf("%8d %7.3f %7.3f\n",OSMSegments->segments[i].id,OSMSegments->segments[i].latitude,OSMSegments->segments[i].longitude);
114
115			segment=FindFirstSegment(OSMSegments->segments[0].node1-1);
116			printf("%s find segment %d = %d\n",segment?"Did":"Didn't",OSMSegments->segments[0].node1-1,segment?segment->node1:0);
117
118			segment=FindFirstSegment(OSMSegments->segments[0].node1);
119			printf("%s find segment %d = %d\n",segment?"Did":"Didn't",OSMSegments->segments[0].node1,segment?segment->node1:0);
120
121			segment=FindFirstSegment(OSMSegments->segments[OSMSegments->number-1].node1);
122			printf("%s find segment %d = %d\n",segment?"Did":"Didn't",OSMSegments->segments[OSMSegments->number-1].node1,segment?segment->node1:0);
123
124			segment=FindFirstSegment(OSMSegments->segments[OSMSegments->number-1].node1+1);
125			printf("%s find segment %d = %d\n",segment?"Did":"Didn't",OSMSegments->segments[OSMSegments->number-1].node1+1,segment?segment->node1:0);
126
127			segment=FindFirstSegment(296954441);
128			printf("%s find segment %d = %d\n",segment?"Did":"Didn't",296954441,segment?segment->node1:0);
129
130			segment=FindFirstSegment(296954440);
131			printf("%s find segment %d = %d\n",segment?"Did":"Didn't",296954440,segment?segment->node1:0);
132
133			return(0);
134			}