0875c2d557
Known Bug: There are some minor rounding errors that affect the position of start and destination node by a few feet.
72 lines
2.0 KiB
C
72 lines
2.0 KiB
C
/*
|
|
open source routing machine
|
|
Copyright (C) Dennis Luxen, others 2010
|
|
|
|
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
|
|
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 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, write to the Free Software
|
|
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
or see http://www.gnu.org/licenses/agpl.txt.
|
|
*/
|
|
|
|
#ifndef GRIDEDGE_H_
|
|
#define GRIDEDGE_H_
|
|
|
|
struct GridEdgeData {
|
|
GridEdgeData(_Edge e, unsigned f, unsigned r) : edge(e), fileIndex(f), ramIndex(r) {}
|
|
GridEdgeData() {}
|
|
_Edge edge;
|
|
unsigned ramIndex;
|
|
unsigned fileIndex;
|
|
bool operator< ( const GridEdgeData& right ) const {
|
|
if(right.edge.start != edge.start)
|
|
return right.edge.start < edge.start;
|
|
if(right.edge.target != edge.target)
|
|
return right.edge.target < edge.target;
|
|
}
|
|
bool operator==( const GridEdgeData& right ) const {
|
|
return right.edge.start == edge.start && right.edge.target == edge.target;
|
|
}
|
|
};
|
|
|
|
struct CompareGridEdgeDataByFileIndex
|
|
{
|
|
bool operator () (const GridEdgeData & a, const GridEdgeData & b) const
|
|
{
|
|
return a.fileIndex < b.fileIndex;
|
|
}
|
|
};
|
|
|
|
struct CompareGridEdgeDataByRamIndex
|
|
{
|
|
typedef GridEdgeData value_type;
|
|
|
|
bool operator () (const GridEdgeData & a, const GridEdgeData & b) const
|
|
{
|
|
return a.ramIndex < b.ramIndex;
|
|
}
|
|
value_type max_value()
|
|
{
|
|
GridEdgeData e;
|
|
e.ramIndex = (1024*1024) - 1;
|
|
return e;
|
|
}
|
|
value_type min_value()
|
|
{
|
|
GridEdgeData e;
|
|
e.ramIndex = 0;
|
|
return e;
|
|
}
|
|
};
|
|
|
|
#endif /* GRIDEDGE_H_ */
|