package btools.mapcreator;

import java.io.DataInputStream;
import java.io.EOFException;
import java.io.File;

import btools.expressions.BExpressionContext;
import btools.util.CompactLongSet;
import btools.util.DenseLongMap;
import btools.util.FrozenLongSet;
import btools.util.TinyDenseLongMap;

/**
 * WayCutter does 2 step in map-processing:
 *
 * - cut the way file into 45*30 - pieces
 * - enrich ways with relation information
 *
 * @author ab
 */
public class WayCutter extends MapCreatorBase
{
  private CompactLongSet cyclewayset;
  private DenseLongMap tileIndexMap;
  private BExpressionContext expctxReport;
  private BExpressionContext expctxCheck;

  public static void main(String[] args) throws Exception
  {
    System.out.println("*** WayCutter: Soft-Cut way-data into tiles");
    if (args.length != 7)
    {
      System.out.println("usage: java WayCutter <node-tiles-in> <way-file-in> <way-tiles-out> <relation-file> <lookup-file> <report-profile> <check-profile>" );

      return;
    }
    new WayCutter().process( new File( args[0] ), new File( args[1] ), new File( args[2] ), new File( args[3] ), new File( args[4] ), new File( args[5] ), new File( args[6] ) );
  }

  public void process( File nodeTilesIn, File wayFileIn, File wayTilesOut, File relationFileIn, File lookupFile, File reportProfile, File checkProfile ) throws Exception
  {
    this.outTileDir = wayTilesOut;

    // read lookup + profile for relation access-check
    expctxReport = new BExpressionContext("way");
    expctxReport.readMetaData( lookupFile );
    expctxReport.parseFile( reportProfile, "global" );
    expctxCheck = new BExpressionContext("way");
    expctxCheck.readMetaData( lookupFile );
    expctxCheck.parseFile( checkProfile, "global" );
    
    // *** read the relation file into a set (currently cycleway processing only)
    cyclewayset = new CompactLongSet();
    DataInputStream dis = createInStream( relationFileIn );
    try
    {
      for(;;)
      {
        long rid = readId( dis );
        String network = dis.readUTF();
        boolean goodNetwork = "lcn".equals( network ) || "rcn".equals( network ) || "ncn".equals( network ) || "icn".equals( network );
        	
        for(;;)
        {
          long wid = readId( dis );
          if ( wid == -1 ) break;
          if ( goodNetwork && !cyclewayset.contains( wid ) ) cyclewayset.add( wid );
        }
      }
    }
    catch( EOFException eof )
    {
      dis.close();
    }
    
    cyclewayset = new FrozenLongSet( cyclewayset );
    System.out.println( "marked cycleways: " + cyclewayset.size() );


    // *** read all nodes into tileIndexMap
    tileIndexMap = Boolean.getBoolean( "useDenseMaps" ) ? new DenseLongMap( 6 ) : new TinyDenseLongMap();
    new NodeIterator( this, false ).processDir( nodeTilesIn, ".tlf" );

    // *** finally process the way-file, cutting into pieces
    new WayIterator( this, true ).processFile( wayFileIn );
    closeTileOutStreams();
  }

  @Override
  public void nextNode( NodeData n ) throws Exception
  {
    tileIndexMap.put( n.nid, getTileIndex( n.ilon, n.ilat ) );
  }

  @Override
  public void nextWay( WayData data ) throws Exception
  {
    // propagate the cycleway-bit
    if ( cyclewayset.contains( data.wid ) )
    {
      // check access and log a warning for conflicts
      expctxCheck.evaluate( data.description, null );
      boolean ok = expctxCheck.getCostfactor() < 10000.;
      expctxReport.evaluate( data.description, null );
      boolean warn = expctxReport.getCostfactor() >= 10000.;
      if ( warn )
      {
        System.out.println( "** relation access conflict for wid = " + data.wid + " tags:" + expctxReport.getKeyValueDescription( data.description ) + " (ok=" + ok + ")"  );
      }
    	
      if ( ok )
      {
        data.description |= 2;
      }
    }

    long waytileset = 0;
    int nnodes = data.nodes.size();

    // determine the tile-index for each node
    for (int i=0; i<nnodes; i++ )
    {
      int tileIndex = tileIndexMap.getInt( data.nodes.get(i) );
      if ( tileIndex != -1 )
      {
        waytileset |= ( 1L << tileIndex );
      }
    }

    // now write way to all tiles hit
    for( int tileIndex=0; tileIndex<54; tileIndex++ )
    {
      if ( ( waytileset & ( 1L << tileIndex ) ) == 0 )
      {
        continue;
      }
      data.writeTo( getOutStreamForTile( tileIndex ) );
    }
  }

  private int getTileIndex( int ilon, int ilat )
  {
     int lon = ilon / 45000000;
     int lat = ilat / 30000000;
     if ( lon < 0 || lon > 7 || lat < 0 || lat > 5 ) throw new IllegalArgumentException( "illegal pos: " + ilon + "," + ilat );
     return lon*6 + lat;
  }

  protected String getNameForTile( int tileIndex )
  {
    int lon = (tileIndex / 6 ) * 45 - 180;
    int lat = (tileIndex % 6 ) * 30 - 90;
    String slon = lon < 0 ? "W" + (-lon) : "E" + lon;
    String slat = lat < 0 ? "S" + (-lat) : "N" + lat;
    return slon + "_" + slat + ".wtl";
  }

}