trunk/src/waysx.h

/***************************************
 $Header: /home/amb/CVS/routino/src/waysx.h,v 1.14 2009-07-12 09:01:48 amb Exp $

 A header file for the extended Ways structure.

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

#include <stdint.h>

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


/* Data structures */


/*+ An extended structure containing a single way. +*/
struct _WayX
{
 way_t    id;                   /*+ The way identifier. +*/

 char    *name;                 /*+ The name of the way. +*/

 Way     *way;                  /*+ A pointer to the real Way data. +*/
};


/*+ A structure containing a set of ways (memory format). +*/
struct _WaysX
{
 uint32_t sorted;               /*+ Is the data sorted? +*/

 int32_t  row;                  /*+ How many rows are allocated? +*/
 uint32_t col;                  /*+ How many columns are used in the last row? +*/

 WayX   **xdata;                /*+ The extended data for the Ways (unsorted). +*/

 uint32_t number;               /*+ How many entries are still useful? +*/

 WayX   **idata;                /*+ The extended data for the Ways (sorted by ID). +*/
 WayX   **ndata;                /*+ The extended data for the Ways (sorted by name and way properties). +*/

 int32_t  wrow;                 /*+ How many rows are allocated? +*/
 uint32_t wcol;                 /*+ How many columns are used in the last row? +*/

 Way    **wxdata;               /*+ The data for the Ways (unsorted). +*/
 Way    **wdata;                /*+ The data for the Ways (sorted like ndata and compacted). +*/

 char    *names;                /*+ The array containing all the names. +*/

 uint32_t length;               /*+ How long is the string of name entries? +*/
};


/* Functions */


WaysX *NewWayList(void);
void FreeWayList(WaysX *waysx);

void SaveWayList(WaysX *waysx,const char *filename);

WayX *FindWayX(WaysX* waysx,way_t id);

Way *AppendWay(WaysX* waysx,way_t id,const char *name);

void SortWayList(WaysX *waysx);

void CompactWays(WaysX* waysx);

index_t IndexWayInWaysX(WaysX *waysx,WayX *wayx);

#endif /* WAYSX_H */
1	/***************************************
2	$Header: /home/amb/CVS/routino/src/waysx.h,v 1.14 2009-07-12 09:01:48 amb Exp $
3
4	A header file for the extended Ways structure.
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 WAYSX_H
26	#define WAYSX_H /+ To stop multiple inclusions. +/
27
28	#include <stdint.h>
29
30	#include "typesx.h"
31	#include "types.h"
32
33
34	/* Data structures */
35
36
37	/+ An extended structure containing a single way. +/
38	struct _WayX
39	{
40	way_t id; /+ The way identifier. +/
41
42	char name; /+ The name of the way. +*/
43
44	Way way; /+ A pointer to the real Way data. +*/
45	};
46
47
48	/+ A structure containing a set of ways (memory format). +/
49	struct _WaysX
50	{
51	uint32_t sorted; /+ Is the data sorted? +/
52
53	int32_t row; /+ How many rows are allocated? +/
54	uint32_t col; /+ How many columns are used in the last row? +/
55
56	WayX *xdata; /+ The extended data for the Ways (unsorted). +*/
57
58	uint32_t number; /+ How many entries are still useful? +/
59
60	WayX *idata; /+ The extended data for the Ways (sorted by ID). +*/
61	WayX *ndata; /+ The extended data for the Ways (sorted by name and way properties). +*/
62
63	int32_t wrow; /+ How many rows are allocated? +/
64	uint32_t wcol; /+ How many columns are used in the last row? +/
65
66	Way *wxdata; /+ The data for the Ways (unsorted). +*/
67	Way *wdata; /+ The data for the Ways (sorted like ndata and compacted). +*/
68
69	char names; /+ The array containing all the names. +*/
70
71	uint32_t length; /+ How long is the string of name entries? +/
72	};
73
74
75	/* Functions */
76
77
78	WaysX *NewWayList(void);
79	void FreeWayList(WaysX *waysx);
80
81	void SaveWayList(WaysX waysx,const char filename);
82
83	WayX FindWayX(WaysX waysx,way_t id);
84
85	Way AppendWay(WaysX waysx,way_t id,const char *name);
86
87	void SortWayList(WaysX *waysx);
88
89	void CompactWays(WaysX* waysx);
90
91	index_t IndexWayInWaysX(WaysX waysx,WayX wayx);
92
93	#endif /* WAYSX_H */