Check out the latest version of Routino: svn co http://routino.org/svn/trunk routino
Annotation of /trunk/src/fakes.h
Parent Directory
| 
Revision Log
Revision 1784 -
(hide annotations)
(download)
(as text)
Sat Aug 15 13:08:37 2015 UTC (9 years, 7 months ago) by amb
File MIME type: text/x-chdr
File size: 2018 byte(s)
Sat Aug 15 13:08:37 2015 UTC (9 years, 7 months ago) by amb
File MIME type: text/x-chdr
File size: 2018 byte(s)
Merge libroutino branch back into the trunk.
| 1 | amb | 533 | /*************************************** |
| 2 | Header file for fake node and segment function prototypes | ||
| 3 | |||
| 4 | Part of the Routino routing software. | ||
| 5 | ******************/ /****************** | ||
| 6 | amb | 1784 | This file Copyright 2008-2015 Andrew M. Bishop |
| 7 | amb | 533 | |
| 8 | 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 | ***************************************/ | ||
| 21 | |||
| 22 | |||
| 23 | #ifndef FAKES_H | ||
| 24 | #define FAKES_H /*+ To stop multiple inclusions. +*/ | ||
| 25 | |||
| 26 | #include "types.h" | ||
| 27 | |||
| 28 | |||
| 29 | amb | 680 | /* Macros */ |
| 30 | amb | 533 | |
| 31 | /*+ Return true if this is a fake node. +*/ | ||
| 32 | amb | 637 | #define IsFakeNode(xxx) ((xxx)>=NODE_FAKE && (xxx)!=NO_NODE) |
| 33 | amb | 533 | |
| 34 | /*+ Return true if this is a fake segment. +*/ | ||
| 35 | amb | 637 | #define IsFakeSegment(xxx) ((xxx)>=SEGMENT_FAKE && (xxx)!=NO_SEGMENT) |
| 36 | amb | 533 | |
| 37 | amb | 680 | |
| 38 | amb | 955 | /* Functions in fakes.c */ |
| 39 | amb | 680 | |
| 40 | amb | 1168 | index_t CreateFakes(Nodes *nodes,Segments *segments,int point,Segment *segmentp,index_t node1,index_t node2,distance_t dist1,distance_t dist2); |
| 41 | amb | 533 | |
| 42 | amb | 1565 | index_t CreateFakeNullSegment(Segments *segments,index_t node,index_t segment,int point); |
| 43 | |||
| 44 | amb | 1784 | void DeleteFakeNodes(void); |
| 45 | |||
| 46 | amb | 608 | void GetFakeLatLong(index_t fakenode, double *latitude,double *longitude); |
| 47 | amb | 533 | |
| 48 | amb | 608 | Segment *FirstFakeSegment(index_t fakenode); |
| 49 | amb | 1078 | Segment *NextFakeSegment(Segment *fakesegmentp,index_t fakenode); |
| 50 | amb | 608 | Segment *ExtraFakeSegment(index_t realnode,index_t fakenode); |
| 51 | amb | 533 | |
| 52 | Segment *LookupFakeSegment(index_t index); | ||
| 53 | amb | 1078 | index_t IndexFakeSegment(Segment *fakesegmentp); |
| 54 | amb | 608 | index_t IndexRealSegment(index_t fakesegment); |
| 55 | amb | 533 | |
| 56 | amb | 727 | int IsFakeUTurn(index_t fakesegment1,index_t fakesegment2); |
| 57 | amb | 533 | |
| 58 | #endif /* FAKES_H */ |