trunk/src/ways.c

/***************************************
 Way data type functions.

 Part of the Routino routing software.
 ******************/ /******************
 This file Copyright 2008-2011 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/>.
 ***************************************/


#include <stdlib.h>

#include "ways.h"

#include "files.h"


/*++++++++++++++++++++++++++++++++++++++
  Load in a way list from a file.

  Ways *LoadWayList Returns the way list.

  const char *filename The name of the file to load.
  ++++++++++++++++++++++++++++++++++++++*/

Ways *LoadWayList(const char *filename)
{
 Ways *ways;

 ways=(Ways*)malloc(sizeof(Ways));

#if !SLIM

 ways->data=MapFile(filename);

 /* Copy the WaysFile structure from the loaded data */

 ways->file=*((WaysFile*)ways->data);

 /* Set the pointers in the Ways structure. */

 ways->ways =(Way *)(ways->data+sizeof(WaysFile));
 ways->names=(char*)(ways->data+sizeof(WaysFile)+ways->file.number*sizeof(Way));

#else

 ways->fd=ReOpenFile(filename);

 /* Copy the WaysFile header structure from the loaded data */

 ReadFile(ways->fd,&ways->file,sizeof(WaysFile));

 ways->incache[0]=NO_WAY;
 ways->incache[1]=NO_WAY;

 ways->namesoffset=sizeof(WaysFile)+ways->file.number*sizeof(Way);

 ways->nincache=~0;
 ways->ncached=NULL;

#endif

 return(ways);
}


/*++++++++++++++++++++++++++++++++++++++
  Return 0 if the two ways are the same (in respect of their types and limits),
           otherwise return positive or negative to allow sorting.

  int WaysCompare Returns a comparison.

  Way *way1 The first way.

  Way *way2 The second way.
  ++++++++++++++++++++++++++++++++++++++*/

int WaysCompare(Way *way1,Way *way2)
{
 if(way1==way2)
    return(0);

 if(way1->type!=way2->type)
    return((int)way1->type - (int)way2->type);

 if(way1->allow!=way2->allow)
    return((int)way1->allow - (int)way2->allow);

 if(way1->props!=way2->props)
    return((int)way1->props - (int)way2->props);

 if(way1->speed!=way2->speed)
    return((int)way1->speed - (int)way2->speed);

 if(way1->weight!=way2->weight)
    return((int)way1->weight - (int)way2->weight);

 if(way1->height!=way2->height)
    return((int)way1->height - (int)way2->height);

 if(way1->width!=way2->width)
    return((int)way1->width - (int)way2->width);

 if(way1->length!=way2->length)
    return((int)way1->length - (int)way2->length);

 return(0);
}
1	amb	7	/***************************************
2			Way data type functions.
3	amb	157
4			Part of the Routino routing software.
5	amb	7	****************/ /****************
6	amb	681	This file Copyright 2008-2011 Andrew M. Bishop
7	amb	7
8	amb	157	This program is free software: you can redistribute it and/or modify
9			it under the terms of the GNU Affero General Public License as published by
10			the Free Software Foundation, either version 3 of the License, or
11			(at your option) any later version.
12
13			This program is distributed in the hope that it will be useful,
14			but WITHOUT ANY WARRANTY; without even the implied warranty of
15			MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16			GNU Affero General Public License for more details.
17
18			You should have received a copy of the GNU Affero General Public License
19			along with this program. If not, see <http://www.gnu.org/licenses/>.
20	amb	7	***************************************/
21
22
23			#include <stdlib.h>
24
25	amb	20	#include "ways.h"
26	amb	7
27	amb	449	#include "files.h"
28	amb	7
29	amb	449
30	amb	7	/*++++++++++++++++++++++++++++++++++++++
31	amb	20	Load in a way list from a file.
32
33	amb	681	Ways *LoadWayList Returns the way list.
34	amb	20
35			const char *filename The name of the file to load.
36			++++++++++++++++++++++++++++++++++++++*/
37
38			Ways LoadWayList(const char filename)
39			{
40	amb	87	Ways *ways;
41
42			ways=(Ways*)malloc(sizeof(Ways));
43
44	amb	460	#if !SLIM
45	amb	87
46	amb	460	ways->data=MapFile(filename);
47	amb	87
48	amb	460	/* Copy the WaysFile structure from the loaded data */
49	amb	87
50	amb	460	ways->file=((WaysFile)ways->data);
51	amb	87
52	amb	460	/* Set the pointers in the Ways structure. */
53	amb	87
54	amb	460	ways->ways =(Way *)(ways->data+sizeof(WaysFile));
55			ways->names=(char)(ways->data+sizeof(WaysFile)+ways->file.numbersizeof(Way));
56
57			#else
58
59			ways->fd=ReOpenFile(filename);
60
61			/* Copy the WaysFile header structure from the loaded data */
62
63			ReadFile(ways->fd,&ways->file,sizeof(WaysFile));
64
65	amb	564	ways->incache[0]=NO_WAY;
66			ways->incache[1]=NO_WAY;
67
68	amb	460	ways->namesoffset=sizeof(WaysFile)+ways->file.number*sizeof(Way);
69
70			ways->nincache=~0;
71			ways->ncached=NULL;
72
73			#endif
74
75	amb	87	return(ways);
76	amb	20	}
77
78
79			/*++++++++++++++++++++++++++++++++++++++
80	amb	201	Return 0 if the two ways are the same (in respect of their types and limits),
81			otherwise return positive or negative to allow sorting.
82	amb	181
83	amb	201	int WaysCompare Returns a comparison.
84	amb	181
85			Way *way1 The first way.
86
87			Way *way2 The second way.
88			++++++++++++++++++++++++++++++++++++++*/
89
90	amb	201	int WaysCompare(Way way1,Way way2)
91	amb	181	{
92			if(way1==way2)
93	amb	201	return(0);
94	amb	181
95	amb	201	if(way1->type!=way2->type)
96			return((int)way1->type - (int)way2->type);
97	amb	181
98	amb	201	if(way1->allow!=way2->allow)
99			return((int)way1->allow - (int)way2->allow);
100
101	amb	298	if(way1->props!=way2->props)
102			return((int)way1->props - (int)way2->props);
103
104	amb	201	if(way1->speed!=way2->speed)
105			return((int)way1->speed - (int)way2->speed);
106
107			if(way1->weight!=way2->weight)
108			return((int)way1->weight - (int)way2->weight);
109
110			if(way1->height!=way2->height)
111			return((int)way1->height - (int)way2->height);
112
113			if(way1->width!=way2->width)
114			return((int)way1->width - (int)way2->width);
115
116			if(way1->length!=way2->length)
117			return((int)way1->length - (int)way2->length);
118
119	amb	181	return(0);
120			}