trunk/src/segments.h

/***************************************
 $Header: /home/amb/CVS/routino/src/segments.h,v 1.23 2009-02-01 17:11:08 amb Exp $

 A header file for the segments.
 ******************/ /******************
 Written by Andrew M. Bishop

 This file Copyright 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.
 ***************************************/


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

#include <stdint.h>

#include "types.h"
#include "nodes.h"
#include "profiles.h"


/* Data structures */


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

 Segment      segment;          /*+ The real segment data. +*/
}
 SegmentX;

/*+ A structure containing a set of segments (mmap format). +*/
typedef struct _Segments
{
 uint32_t number;               /*+ How many entries are used in total? +*/

 Segment *segments;             /*+ An array of segments. +*/

 void    *data;                 /*+ The memory mapped data. +*/
}
 Segments;

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

 SegmentX *xdata;              /*+ The extended segment data. +*/
}
 SegmentsX;


/* Functions in segments.c */


Segments *LoadSegmentList(const char *filename);

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

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

SegmentX *FindFirstSegment(SegmentsX* segmentsx,node_t node);
SegmentX *FindNextSegment(SegmentsX* segmentsx,SegmentX *segmentx);

Segment *NextSegment(Segments *segments,Segment *segment);

SegmentX *AppendSegment(SegmentsX *segmentsx,node_t node1,node_t node2,index_t way);

void SortSegmentList(SegmentsX *segmentsx);

void RemoveBadSegments(SegmentsX *segmentsx);

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

distance_t Distance(Node *node1,Node *node2);

duration_t Duration(Segment *segment,Way *way,Profile *profile);

#define LookupSegmentX(xxx,yyy) (&(xxx)->xdata[yyy])

#define IndexSegmentX(xxx,yyy)  ((yyy)-&(xxx)->xdata[0])


#endif /* SEGMENTS_H */
1	/***************************************
2	$Header: /home/amb/CVS/routino/src/segments.h,v 1.23 2009-02-01 17:11:08 amb Exp $
3
4	A header file for the segments.
5	****************/ /****************
6	Written by Andrew M. Bishop
7
8	This file Copyright 2009 Andrew M. Bishop
9	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	#ifndef SEGMENTS_H
16	#define SEGMENTS_H /+ To stop multiple inclusions. +/
17
18	#include <stdint.h>
19
20	#include "types.h"
21	#include "nodes.h"
22	#include "profiles.h"
23
24
25	/* Data structures */
26
27
28	/+ An extended structure used for processing. +/
29	typedef struct _SegmentX
30	{
31	node_t node1; /+ The starting node. +/
32	node_t node2; /+ The finishing node. +/
33
34	Segment segment; /+ The real segment data. +/
35	}
36	SegmentX;
37
38	/+ A structure containing a set of segments (mmap format). +/
39	typedef struct _Segments
40	{
41	uint32_t number; /+ How many entries are used in total? +/
42
43	Segment segments; /+ An array of segments. +*/
44
45	void data; /+ The memory mapped data. +*/
46	}
47	Segments;
48
49	/+ A structure containing a set of segments (memory format). +/
50	typedef struct _SegmentsX
51	{
52	uint32_t sorted; /+ Is the data sorted and therefore searchable? +/
53	uint32_t alloced; /+ How many entries are allocated? +/
54	uint32_t number; /+ How many entries are used? +/
55
56	SegmentX xdata; /+ The extended segment data. +*/
57	}
58	SegmentsX;
59
60
61	/* Functions in segments.c */
62
63
64	Segments LoadSegmentList(const char filename);
65
66	SegmentsX *NewSegmentList(void);
67	void FreeSegmentList(SegmentsX *segmentsx);
68
69	void SaveSegmentList(SegmentsX segmentsx,const char filename);
70
71	SegmentX FindFirstSegment(SegmentsX segmentsx,node_t node);
72	SegmentX FindNextSegment(SegmentsX segmentsx,SegmentX *segmentx);
73
74	Segment NextSegment(Segments segments,Segment *segment);
75
76	SegmentX AppendSegment(SegmentsX segmentsx,node_t node1,node_t node2,index_t way);
77
78	void SortSegmentList(SegmentsX *segmentsx);
79
80	void RemoveBadSegments(SegmentsX *segmentsx);
81
82	void MeasureSegments(SegmentsX segmentsx,NodesX nodesx);
83	void FixupSegments(SegmentsX* segmentsx,NodesX nodesx,SegmentsX supersegmentsx);
84
85	distance_t Distance(Node node1,Node node2);
86
87	duration_t Duration(Segment segment,Way way,Profile *profile);
88
89	#define LookupSegmentX(xxx,yyy) (&(xxx)->xdata[yyy])
90
91	#define IndexSegmentX(xxx,yyy) ((yyy)-&(xxx)->xdata[0])
92
93
94	#endif /* SEGMENTS_H */