Remove output.
This commit is contained in:
Holt59
parent
05c4f0da2a
commit
20a64255aa
@ -13,169 +13,182 @@ import org.insa.graph.RoadInformation;
|
|||||||
import org.insa.graph.RoadInformation.RoadType;
|
import org.insa.graph.RoadInformation.RoadType;
|
||||||
|
|
||||||
public class BinaryGraphReader extends BinaryReader implements GraphReader {
|
public class BinaryGraphReader extends BinaryReader implements GraphReader {
|
||||||
|
|
||||||
// Map version and magic number targeted for this reader.
|
|
||||||
private static final int VERSION = 4;
|
|
||||||
private static final int MAGIC_NUMBER = 0xbacaff;
|
|
||||||
|
|
||||||
/**
|
// Map version and magic number targeted for this reader.
|
||||||
* Convert a character to its corresponding road type.
|
private static final int VERSION = 4;
|
||||||
*
|
private static final int MAGIC_NUMBER = 0xbacaff;
|
||||||
* @param ch Character to convert.
|
|
||||||
*
|
|
||||||
* @return Road type corresponding to ch.
|
|
||||||
*
|
|
||||||
* @see http://wiki.openstreetmap.org/wiki/Highway_tag_usage.
|
|
||||||
*/
|
|
||||||
public static RoadType toRoadType(char ch) {
|
|
||||||
switch (ch) {
|
|
||||||
case 'a': return RoadType.MOTORWAY;
|
|
||||||
case 'b': return RoadType.TRUNK;
|
|
||||||
case 'c': return RoadType.PRIMARY;
|
|
||||||
case 'd': return RoadType.SECONDARY;
|
|
||||||
case 'e': return RoadType.MOTORWAY_LINK;
|
|
||||||
case 'f': return RoadType.TRUNK_LINK;
|
|
||||||
case 'g': return RoadType.PRIMARY_LINK;
|
|
||||||
case 'h': return RoadType.SECONDARY_LINK;
|
|
||||||
case 'i': return RoadType.TERTIARY;
|
|
||||||
case 'j': return RoadType.RESIDENTIAL;
|
|
||||||
case 'k': return RoadType.UNCLASSIFIED;
|
|
||||||
case 'l': return RoadType.ROAD;
|
|
||||||
case 'm': return RoadType.LIVING_STREET;
|
|
||||||
case 'n': return RoadType.SERVICE;
|
|
||||||
case 'o': return RoadType.ROUNDABOUT;
|
|
||||||
case 'z': return RoadType.COASTLINE;
|
|
||||||
}
|
|
||||||
return RoadType.UNCLASSIFIED;
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Create a new BinaryGraphReader using the given DataInputStream.
|
* Convert a character to its corresponding road type.
|
||||||
*
|
*
|
||||||
* @param dis
|
* @param ch Character to convert.
|
||||||
*/
|
*
|
||||||
public BinaryGraphReader(DataInputStream dis) {
|
* @return Road type corresponding to ch.
|
||||||
super(MAGIC_NUMBER, VERSION, dis);
|
*
|
||||||
}
|
* @see http://wiki.openstreetmap.org/wiki/Highway_tag_usage.
|
||||||
|
*/
|
||||||
|
public static RoadType toRoadType(char ch) {
|
||||||
|
switch (ch) {
|
||||||
|
case 'a':
|
||||||
|
return RoadType.MOTORWAY;
|
||||||
|
case 'b':
|
||||||
|
return RoadType.TRUNK;
|
||||||
|
case 'c':
|
||||||
|
return RoadType.PRIMARY;
|
||||||
|
case 'd':
|
||||||
|
return RoadType.SECONDARY;
|
||||||
|
case 'e':
|
||||||
|
return RoadType.MOTORWAY_LINK;
|
||||||
|
case 'f':
|
||||||
|
return RoadType.TRUNK_LINK;
|
||||||
|
case 'g':
|
||||||
|
return RoadType.PRIMARY_LINK;
|
||||||
|
case 'h':
|
||||||
|
return RoadType.SECONDARY_LINK;
|
||||||
|
case 'i':
|
||||||
|
return RoadType.TERTIARY;
|
||||||
|
case 'j':
|
||||||
|
return RoadType.RESIDENTIAL;
|
||||||
|
case 'k':
|
||||||
|
return RoadType.UNCLASSIFIED;
|
||||||
|
case 'l':
|
||||||
|
return RoadType.ROAD;
|
||||||
|
case 'm':
|
||||||
|
return RoadType.LIVING_STREET;
|
||||||
|
case 'n':
|
||||||
|
return RoadType.SERVICE;
|
||||||
|
case 'o':
|
||||||
|
return RoadType.ROUNDABOUT;
|
||||||
|
case 'z':
|
||||||
|
return RoadType.COASTLINE;
|
||||||
|
}
|
||||||
|
return RoadType.UNCLASSIFIED;
|
||||||
|
}
|
||||||
|
|
||||||
@Override
|
/**
|
||||||
public Graph read() throws IOException {
|
* Create a new BinaryGraphReader using the given DataInputStream.
|
||||||
|
*
|
||||||
System.out.println(getClass());
|
* @param dis
|
||||||
|
*/
|
||||||
// Read and check magic number and file version.
|
public BinaryGraphReader(DataInputStream dis) {
|
||||||
checkMagicNumberOrThrow(dis.readInt());
|
super(MAGIC_NUMBER, VERSION, dis);
|
||||||
checkVersionOrThrow(dis.readInt());
|
}
|
||||||
|
|
||||||
// Read map id.
|
|
||||||
int mapId = dis.readInt();
|
|
||||||
|
|
||||||
// Read zone.
|
|
||||||
int graphZone = dis.readInt();
|
|
||||||
|
|
||||||
// Number of descriptors and nodes.
|
@Override
|
||||||
int nbDesc = dis.readInt();
|
public Graph read() throws IOException {
|
||||||
int nbNodes = dis.readInt();
|
|
||||||
|
|
||||||
// Number of successors for each nodes.
|
|
||||||
int[] nbSuccessors = new int[nbNodes];
|
|
||||||
|
|
||||||
// Construct an array list with initial capacity of nbNodes.
|
// Read and check magic number and file version.
|
||||||
ArrayList<Node> nodes = new ArrayList<Node>(nbNodes);
|
checkMagicNumberOrThrow(dis.readInt());
|
||||||
|
checkVersionOrThrow(dis.readInt());
|
||||||
// Read nodes.
|
|
||||||
for (int node = 0; node < nbNodes; ++node) {
|
// Read map id.
|
||||||
float longitude = ((float)dis.readInt ()) / 1E6f;
|
int mapId = dis.readInt();
|
||||||
float latitude = ((float)dis.readInt ()) / 1E6f;
|
|
||||||
nbSuccessors[node] = dis.readUnsignedByte();
|
// Read zone.
|
||||||
nodes.add(new Node(node, new Point(longitude, latitude)));
|
int graphZone = dis.readInt();
|
||||||
}
|
|
||||||
|
// Number of descriptors and nodes.
|
||||||
// Check format.
|
int nbDesc = dis.readInt();
|
||||||
checkByteOrThrow(255);
|
int nbNodes = dis.readInt();
|
||||||
|
|
||||||
// Read descriptors.
|
// Number of successors for each nodes.
|
||||||
RoadInformation[] descs = new RoadInformation[nbDesc];
|
int[] nbSuccessors = new int[nbNodes];
|
||||||
|
|
||||||
// Read
|
// Construct an array list with initial capacity of nbNodes.
|
||||||
for (int descr = 0; descr < nbDesc; ++descr) {
|
ArrayList<Node> nodes = new ArrayList<Node>(nbNodes);
|
||||||
descs[descr] = readRoadInformation();
|
|
||||||
}
|
// Read nodes.
|
||||||
|
for (int node = 0; node < nbNodes; ++node) {
|
||||||
// Check format.
|
float longitude = ((float) dis.readInt()) / 1E6f;
|
||||||
checkByteOrThrow(254);
|
float latitude = ((float) dis.readInt()) / 1E6f;
|
||||||
|
nbSuccessors[node] = dis.readUnsignedByte();
|
||||||
// Read successors and convert to arcs.
|
nodes.add(new Node(node, new Point(longitude, latitude)));
|
||||||
for (int node = 0; node < nbNodes; ++node) {
|
}
|
||||||
for (int succ = 0; succ < nbSuccessors[node]; ++succ) {
|
|
||||||
|
// Check format.
|
||||||
// Read destination zone.
|
checkByteOrThrow(255);
|
||||||
int destZone = dis.readUnsignedByte();
|
|
||||||
|
// Read descriptors.
|
||||||
// Read target node number.
|
RoadInformation[] descs = new RoadInformation[nbDesc];
|
||||||
int destNode = this.read24bits();
|
|
||||||
|
// Read
|
||||||
// Read information number.
|
for (int descr = 0; descr < nbDesc; ++descr) {
|
||||||
int descrNum = this.read24bits();
|
descs[descr] = readRoadInformation();
|
||||||
|
}
|
||||||
// Length of the arc.
|
|
||||||
int length = dis.readUnsignedShort();
|
// Check format.
|
||||||
|
checkByteOrThrow(254);
|
||||||
// Number of segments.
|
|
||||||
int nbSegments = dis.readUnsignedShort();
|
// Read successors and convert to arcs.
|
||||||
|
for (int node = 0; node < nbNodes; ++node) {
|
||||||
|
for (int succ = 0; succ < nbSuccessors[node]; ++succ) {
|
||||||
|
|
||||||
|
// Read destination zone.
|
||||||
|
int destZone = dis.readUnsignedByte();
|
||||||
|
|
||||||
|
// Read target node number.
|
||||||
|
int destNode = this.read24bits();
|
||||||
|
|
||||||
|
// Read information number.
|
||||||
|
int descrNum = this.read24bits();
|
||||||
|
|
||||||
|
// Length of the arc.
|
||||||
|
int length = dis.readUnsignedShort();
|
||||||
|
|
||||||
|
// Number of segments.
|
||||||
|
int nbSegments = dis.readUnsignedShort();
|
||||||
|
|
||||||
|
// Chain of points corresponding to the segments.
|
||||||
|
ArrayList<Point> points = new ArrayList<Point>(nbSegments + 2);
|
||||||
|
points.add(nodes.get(node).getPoint());
|
||||||
|
|
||||||
|
for (int seg = 0; seg < nbSegments; ++seg) {
|
||||||
|
Point lastPoint = points.get(points.size() - 1);
|
||||||
|
|
||||||
|
float dlon = (dis.readShort()) / 2.0e5f;
|
||||||
|
float dlat = (dis.readShort()) / 2.0e5f;
|
||||||
|
|
||||||
|
points.add(new Point(lastPoint.getLongitude() + dlon, lastPoint.getLatitude() + dlat));
|
||||||
|
}
|
||||||
|
|
||||||
|
points.add(nodes.get(destNode).getPoint());
|
||||||
|
|
||||||
|
if (graphZone == destZone) {
|
||||||
|
|
||||||
|
RoadInformation info = descs[descrNum];
|
||||||
|
Node orig = nodes.get(node);
|
||||||
|
Node dest = nodes.get(destNode);
|
||||||
|
|
||||||
|
// Add successor to initial arc.
|
||||||
|
new Arc(orig, dest, length, info, points);
|
||||||
|
|
||||||
|
// And reverse arc if its a two-way road.
|
||||||
|
if (!info.isOneWay()) {
|
||||||
|
// Add without segments.
|
||||||
|
ArrayList<Point> rPoints = new ArrayList<Point>(points);
|
||||||
|
Collections.reverse(rPoints);
|
||||||
|
new Arc(dest, orig, length, info, rPoints);
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Check format.
|
||||||
|
checkByteOrThrow(253);
|
||||||
|
|
||||||
|
return new Graph(mapId, nodes);
|
||||||
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Read the next road information from the stream.
|
||||||
|
*
|
||||||
|
* @throws IOException
|
||||||
|
*/
|
||||||
|
private RoadInformation readRoadInformation() throws IOException {
|
||||||
|
char type = (char) dis.readUnsignedByte();
|
||||||
|
int x = dis.readUnsignedByte();
|
||||||
|
return new RoadInformation(toRoadType(type), (x & 0x80) > 0, (x & 0x7F) * 5, dis.readUTF());
|
||||||
|
}
|
||||||
|
|
||||||
// Chain of points corresponding to the segments.
|
|
||||||
ArrayList<Point> points = new ArrayList<Point>(nbSegments + 2);
|
|
||||||
points.add(nodes.get(node).getPoint());
|
|
||||||
|
|
||||||
for (int seg = 0; seg < nbSegments; ++seg) {
|
|
||||||
Point lastPoint = points.get(points.size() - 1);
|
|
||||||
|
|
||||||
float dlon = (dis.readShort()) / 2.0e5f;
|
|
||||||
float dlat = (dis.readShort()) / 2.0e5f;
|
|
||||||
|
|
||||||
points.add(new Point(lastPoint.getLongitude() + dlon,
|
|
||||||
lastPoint.getLatitude() + dlat));
|
|
||||||
}
|
|
||||||
|
|
||||||
points.add(nodes.get(destNode).getPoint());
|
|
||||||
|
|
||||||
if (graphZone == destZone) {
|
|
||||||
|
|
||||||
RoadInformation info = descs[descrNum];
|
|
||||||
Node orig = nodes.get(node);
|
|
||||||
Node dest = nodes.get(destNode);
|
|
||||||
|
|
||||||
// Add successor to initial arc.
|
|
||||||
new Arc(orig, dest, length, info, points);
|
|
||||||
|
|
||||||
// And reverse arc if its a two-way road.
|
|
||||||
if (!info.isOneWay()) {
|
|
||||||
// Add without segments.
|
|
||||||
ArrayList<Point> rPoints = new ArrayList<Point>(points);
|
|
||||||
Collections.reverse(rPoints);
|
|
||||||
new Arc(dest, orig, length, info, rPoints);
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Check format.
|
|
||||||
checkByteOrThrow(253);
|
|
||||||
|
|
||||||
return new Graph(mapId, nodes);
|
|
||||||
}
|
|
||||||
|
|
||||||
/**
|
|
||||||
* Read the next road information from the stream.
|
|
||||||
*
|
|
||||||
* @throws IOException
|
|
||||||
*/
|
|
||||||
private RoadInformation readRoadInformation() throws IOException {
|
|
||||||
char type = (char)dis.readUnsignedByte();
|
|
||||||
int x = dis.readUnsignedByte() ;
|
|
||||||
return new RoadInformation(toRoadType(type), (x & 0x80) > 0, (x & 0x7F) * 5, dis.readUTF());
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|||||||
Loading…
Reference in New Issue
Block a user