429 lines
11 KiB
Java
429 lines
11 KiB
Java
/**
|
|
* Container for an osm node (pre-pocessor version)
|
|
*
|
|
* @author ab
|
|
*/
|
|
package btools.mapcreator;
|
|
|
|
import java.io.IOException;
|
|
import java.util.ArrayList;
|
|
|
|
import btools.codec.MicroCache;
|
|
import btools.codec.MicroCache1;
|
|
import btools.codec.MicroCache2;
|
|
|
|
public class OsmNodeP extends OsmLinkP
|
|
{
|
|
public static final int SIGNLON_BITMASK = 0x80;
|
|
public static final int SIGNLAT_BITMASK = 0x40;
|
|
public static final int TRANSFERNODE_BITMASK = 0x20;
|
|
public static final int WRITEDESC_BITMASK = 0x10;
|
|
public static final int SKIPDETAILS_BITMASK = 0x08;
|
|
public static final int NODEDESC_BITMASK = 0x04;
|
|
|
|
/**
|
|
* The latitude
|
|
*/
|
|
public int ilat;
|
|
|
|
/**
|
|
* The longitude
|
|
*/
|
|
public int ilon;
|
|
|
|
/**
|
|
* The elevation
|
|
*/
|
|
public short selev;
|
|
|
|
public final static int NO_BRIDGE_BIT = 1;
|
|
public final static int NO_TUNNEL_BIT = 2;
|
|
public final static int BORDER_BIT = 4;
|
|
public final static int TRAFFIC_BIT = 8;
|
|
public final static int ANY_WAY_BIT = 16;
|
|
public final static int MULTI_WAY_BIT = 32;
|
|
|
|
public byte bits = 0;
|
|
|
|
// interface OsmPos
|
|
public int getILat()
|
|
{
|
|
return ilat;
|
|
}
|
|
|
|
public int getILon()
|
|
{
|
|
return ilon;
|
|
}
|
|
|
|
public short getSElev()
|
|
{
|
|
// if all bridge or all tunnel, elevation=no-data
|
|
return ( bits & NO_BRIDGE_BIT ) == 0 || ( bits & NO_TUNNEL_BIT ) == 0 ? Short.MIN_VALUE : selev;
|
|
}
|
|
|
|
public double getElev()
|
|
{
|
|
return selev / 4.;
|
|
}
|
|
|
|
// populate and return the inherited link, if available,
|
|
// else create a new one
|
|
public OsmLinkP createLink( OsmNodeP source )
|
|
{
|
|
if ( sourceNode == null && targetNode == null )
|
|
{
|
|
// inherited instance is available, use this
|
|
sourceNode = source;
|
|
targetNode = this;
|
|
source.addLink( this );
|
|
return this;
|
|
}
|
|
OsmLinkP link = new OsmLinkP( source, this );
|
|
addLink( link );
|
|
source.addLink( link );
|
|
return link;
|
|
}
|
|
|
|
// memory-squeezing-hack: OsmLinkP's "previous" also used as firstlink..
|
|
|
|
public void addLink( OsmLinkP link )
|
|
{
|
|
link.setNext( previous, this );
|
|
previous = link;
|
|
}
|
|
|
|
public OsmLinkP getFirstLink()
|
|
{
|
|
return sourceNode == null && targetNode == null ? previous : this;
|
|
}
|
|
|
|
public byte[] getNodeDecsription()
|
|
{
|
|
return null;
|
|
}
|
|
|
|
public void writeNodeData1( MicroCache1 mc ) throws IOException
|
|
{
|
|
mc.writeShort( getSElev() );
|
|
|
|
// hack: write node-desc as link tag (copy cycleway-bits)
|
|
byte[] nodeDescription = getNodeDecsription();
|
|
|
|
for ( OsmLinkP link0 = getFirstLink(); link0 != null; link0 = link0.getNext( this ) )
|
|
{
|
|
int ilonref = ilon;
|
|
int ilatref = ilat;
|
|
|
|
OsmLinkP link = link0;
|
|
OsmNodeP origin = this;
|
|
int skipDetailBit = link0.descriptionBitmap == null ? SKIPDETAILS_BITMASK : 0;
|
|
|
|
// first pass just to see if that link is consistent
|
|
while (link != null)
|
|
{
|
|
OsmNodeP target = link.getTarget( origin );
|
|
if ( !target.isTransferNode() )
|
|
{
|
|
break;
|
|
}
|
|
// next link is the one (of two), does does'nt point back
|
|
for ( link = target.getFirstLink(); link != null; link = link.getNext( target ) )
|
|
{
|
|
if ( link.getTarget( target ) != origin )
|
|
break;
|
|
}
|
|
origin = target;
|
|
}
|
|
if ( link == null )
|
|
continue; // dead end
|
|
|
|
if ( skipDetailBit == 0 )
|
|
{
|
|
link = link0;
|
|
origin = this;
|
|
}
|
|
byte[] lastDescription = null;
|
|
while (link != null)
|
|
{
|
|
if ( link.descriptionBitmap == null && skipDetailBit == 0 )
|
|
throw new IllegalArgumentException( "missing way description..." );
|
|
|
|
OsmNodeP target = link.getTarget( origin );
|
|
int tranferbit = target.isTransferNode() ? TRANSFERNODE_BITMASK : 0;
|
|
int nodedescbit = nodeDescription != null ? NODEDESC_BITMASK : 0;
|
|
|
|
int writedescbit = 0;
|
|
if ( skipDetailBit == 0 ) // check if description changed
|
|
{
|
|
int inverseBitByteIndex = 0;
|
|
boolean inverseDirection = link.isReverse( origin );
|
|
byte[] ab = link.descriptionBitmap;
|
|
int abLen = ab.length;
|
|
int lastLen = lastDescription == null ? 0 : lastDescription.length;
|
|
boolean equalsCurrent = abLen == lastLen;
|
|
if ( equalsCurrent )
|
|
{
|
|
for ( int i = 0; i < abLen; i++ )
|
|
{
|
|
byte b = ab[i];
|
|
if ( i == inverseBitByteIndex && inverseDirection )
|
|
b ^= 1;
|
|
if ( b != lastDescription[i] )
|
|
{
|
|
equalsCurrent = false;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
if ( !equalsCurrent )
|
|
{
|
|
writedescbit = WRITEDESC_BITMASK;
|
|
lastDescription = new byte[abLen];
|
|
System.arraycopy( ab, 0, lastDescription, 0, abLen );
|
|
if ( inverseDirection )
|
|
lastDescription[inverseBitByteIndex] ^= 1;
|
|
}
|
|
|
|
}
|
|
|
|
int bm = tranferbit | writedescbit | nodedescbit | skipDetailBit;
|
|
int dlon = target.ilon - ilonref;
|
|
int dlat = target.ilat - ilatref;
|
|
ilonref = target.ilon;
|
|
ilatref = target.ilat;
|
|
if ( dlon < 0 )
|
|
{
|
|
bm |= SIGNLON_BITMASK;
|
|
dlon = -dlon;
|
|
}
|
|
if ( dlat < 0 )
|
|
{
|
|
bm |= SIGNLAT_BITMASK;
|
|
dlat = -dlat;
|
|
}
|
|
mc.writeByte( bm );
|
|
|
|
mc.writeVarLengthUnsigned( dlon );
|
|
mc.writeVarLengthUnsigned( dlat );
|
|
|
|
if ( writedescbit != 0 )
|
|
{
|
|
// write the way description, code direction into the first bit
|
|
mc.writeByte( lastDescription.length );
|
|
mc.write( lastDescription );
|
|
}
|
|
if ( nodedescbit != 0 )
|
|
{
|
|
mc.writeByte( nodeDescription.length );
|
|
mc.write( nodeDescription );
|
|
nodeDescription = null;
|
|
}
|
|
|
|
link.descriptionBitmap = null; // mark link as written
|
|
|
|
if ( tranferbit == 0 )
|
|
{
|
|
break;
|
|
}
|
|
mc.writeVarLengthSigned( target.getSElev() - getSElev() );
|
|
// next link is the one (of two), does does'nt point back
|
|
for ( link = target.getFirstLink(); link != null; link = link.getNext( target ) )
|
|
{
|
|
if ( link.getTarget( target ) != origin )
|
|
break;
|
|
}
|
|
if ( link == null )
|
|
throw new RuntimeException( "follow-up link not found for transfer-node!" );
|
|
origin = target;
|
|
}
|
|
}
|
|
}
|
|
|
|
public void writeNodeData( MicroCache mc ) throws IOException
|
|
{
|
|
boolean valid = true;
|
|
if ( mc instanceof MicroCache1 )
|
|
{
|
|
writeNodeData1( (MicroCache1) mc );
|
|
}
|
|
else if ( mc instanceof MicroCache2 )
|
|
{
|
|
valid = writeNodeData2( (MicroCache2) mc );
|
|
}
|
|
else
|
|
throw new IllegalArgumentException( "unknown cache version: " + mc.getClass() );
|
|
if ( valid )
|
|
{
|
|
mc.finishNode( getIdFromPos() );
|
|
}
|
|
else
|
|
{
|
|
mc.discardNode();
|
|
}
|
|
}
|
|
|
|
public boolean writeNodeData2( MicroCache2 mc ) throws IOException
|
|
{
|
|
boolean hasLinks = false;
|
|
mc.writeShort( getSElev() );
|
|
mc.writeVarBytes( getNodeDecsription() );
|
|
|
|
// buffer internal reverse links
|
|
ArrayList<OsmNodeP> internalReverse = new ArrayList<OsmNodeP>();
|
|
|
|
for ( OsmLinkP link0 = getFirstLink(); link0 != null; link0 = link0.getNext( this ) )
|
|
{
|
|
OsmLinkP link = link0;
|
|
OsmNodeP origin = this;
|
|
OsmNodeP target = null;
|
|
|
|
// first pass just to see if that link is consistent
|
|
while (link != null)
|
|
{
|
|
target = link.getTarget( origin );
|
|
if ( !target.isTransferNode() )
|
|
{
|
|
break;
|
|
}
|
|
// next link is the one (of two), does does'nt point back
|
|
for ( link = target.getFirstLink(); link != null; link = link.getNext( target ) )
|
|
{
|
|
if ( link.getTarget( target ) != origin )
|
|
break;
|
|
}
|
|
|
|
if ( link != null && link.descriptionBitmap != link0.descriptionBitmap )
|
|
{
|
|
throw new IllegalArgumentException( "assertion failed: description change along transfer nodes" );
|
|
}
|
|
|
|
origin = target;
|
|
}
|
|
if ( link == null )
|
|
continue; // dead end
|
|
if ( target == this )
|
|
continue; // self-ref
|
|
hasLinks = true;
|
|
|
|
// internal reverse links later
|
|
boolean isReverse = link0.isReverse( this );
|
|
if ( isReverse )
|
|
{
|
|
if ( mc.isInternal( target.ilon, target.ilat ) )
|
|
{
|
|
internalReverse.add( target );
|
|
continue;
|
|
}
|
|
}
|
|
|
|
// write link data
|
|
int sizeoffset = mc.writeSizePlaceHolder();
|
|
mc.writeVarLengthSigned( target.ilon - ilon );
|
|
mc.writeVarLengthSigned( target.ilat - ilat );
|
|
mc.writeModeAndDesc( isReverse, link0.descriptionBitmap );
|
|
if ( !isReverse ) // write geometry for forward links only
|
|
{
|
|
link = link0;
|
|
origin = this;
|
|
while (link != null)
|
|
{
|
|
OsmNodeP tranferNode = link.getTarget( origin );
|
|
if ( !tranferNode.isTransferNode() )
|
|
{
|
|
break;
|
|
}
|
|
mc.writeVarLengthSigned( tranferNode.ilon - origin.ilon );
|
|
mc.writeVarLengthSigned( tranferNode.ilat - origin.ilat );
|
|
mc.writeVarLengthSigned( tranferNode.getSElev() - origin.getSElev() );
|
|
|
|
// next link is the one (of two), does does'nt point back
|
|
for ( link = tranferNode.getFirstLink(); link != null; link = link.getNext( tranferNode ) )
|
|
{
|
|
if ( link.getTarget( tranferNode ) != origin )
|
|
break;
|
|
}
|
|
if ( link == null )
|
|
throw new RuntimeException( "follow-up link not found for transfer-node!" );
|
|
origin = tranferNode;
|
|
}
|
|
}
|
|
mc.injectSize( sizeoffset );
|
|
}
|
|
|
|
while (internalReverse.size() > 0)
|
|
{
|
|
int nextIdx = 0;
|
|
if ( internalReverse.size() > 1 )
|
|
{
|
|
int max32 = Integer.MIN_VALUE;
|
|
for ( int i = 0; i < internalReverse.size(); i++ )
|
|
{
|
|
int id32 = mc.shrinkId( internalReverse.get( i ).getIdFromPos() );
|
|
if ( id32 > max32 )
|
|
{
|
|
max32 = id32;
|
|
nextIdx = i;
|
|
}
|
|
}
|
|
}
|
|
OsmNodeP target = internalReverse.remove( nextIdx );
|
|
int sizeoffset = mc.writeSizePlaceHolder();
|
|
mc.writeVarLengthSigned( target.ilon - ilon );
|
|
mc.writeVarLengthSigned( target.ilat - ilat );
|
|
mc.writeModeAndDesc( true, null );
|
|
mc.injectSize( sizeoffset );
|
|
}
|
|
return hasLinks;
|
|
}
|
|
|
|
public String toString2()
|
|
{
|
|
return ( ilon - 180000000 ) + "_" + ( ilat - 90000000 ) + "_" + ( selev / 4 );
|
|
}
|
|
|
|
public long getIdFromPos()
|
|
{
|
|
return ( (long) ilon ) << 32 | ilat;
|
|
}
|
|
|
|
public boolean isBorderNode()
|
|
{
|
|
return ( bits & BORDER_BIT ) != 0;
|
|
}
|
|
|
|
public boolean hasTraffic()
|
|
{
|
|
return ( bits & TRAFFIC_BIT ) != 0;
|
|
}
|
|
|
|
/**
|
|
* Not really count the ways, just detect if more than one
|
|
*/
|
|
public void incWayCount()
|
|
{
|
|
if ( ( bits & ANY_WAY_BIT ) != 0 )
|
|
{
|
|
bits |= MULTI_WAY_BIT;
|
|
}
|
|
bits |= ANY_WAY_BIT;
|
|
}
|
|
|
|
public boolean isTransferNode()
|
|
{
|
|
return ( bits & BORDER_BIT ) == 0 && ( bits & MULTI_WAY_BIT ) == 0 && _linkCnt() == 2;
|
|
}
|
|
|
|
private int _linkCnt()
|
|
{
|
|
int cnt = 0;
|
|
|
|
for ( OsmLinkP link = getFirstLink(); link != null; link = link.getNext( this ) )
|
|
{
|
|
cnt++;
|
|
}
|
|
return cnt;
|
|
}
|
|
|
|
}
|