ben/brouter
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions 1

Reformat whole codebase using Android Studio

Browse source
This commit is contained in:
Manuel Fuhr 2022-07-11 06:30:17 +02:00
parent d5322667d5
commit c15913c1ab
161 changed files with 15124 additions and 18537 deletions
Download patch file Download diff file Expand all files Collapse all files

71
brouter-server/src/main/java/btools/server/Polygon.java
View file

@ -5,8 +5,7 @@ import java.io.IOException;
import java.util.ArrayList;
import java.util.StringTokenizer;
public class Polygon
{
public class Polygon {
private int[] ax;
private int[] ay;
@ -15,62 +14,53 @@ public class Polygon
private int maxx = Integer.MIN_VALUE;
private int maxy = Integer.MIN_VALUE;
public Polygon( BufferedReader br ) throws IOException
{
public Polygon(BufferedReader br) throws IOException {
ArrayList<String> lines = new ArrayList<String>();
for(;;)
{
for (; ; ) {
String line = br.readLine();
if ( line == null || "END".equals( line ) )
{
if (line == null || "END".equals(line)) {
break;
}
lines.add( line );
lines.add(line);
}
int n = lines.size();
ax = new int[n];
ay = new int[n];
for( int i=0; i<n; i++ )
{
for (int i = 0; i < n; i++) {
String line = lines.get(i);
StringTokenizer tk = new StringTokenizer( line );
double lon = Double.parseDouble( tk.nextToken() );
double lat = Double.parseDouble( tk.nextToken() );
int x = ax[i] = (int)(lon*1000000. + 180000000);
int y = ay[i] = (int)(lat*1000000. + 90000000);
if ( x < minx ) minx = x;
if ( y < miny ) miny = y;
if ( x > maxx ) maxx = x;
if ( y > maxy ) maxy = y;
StringTokenizer tk = new StringTokenizer(line);
double lon = Double.parseDouble(tk.nextToken());
double lat = Double.parseDouble(tk.nextToken());
int x = ax[i] = (int) (lon * 1000000. + 180000000);
int y = ay[i] = (int) (lat * 1000000. + 90000000);
if (x < minx) minx = x;
if (y < miny) miny = y;
if (x > maxx) maxx = x;
if (y > maxy) maxy = y;
}
}
public boolean isInPolygon( long id )
{
int x = (int) ( id >> 32 );
int y = (int) ( id & 0xffffffff );
if ( x < minx || x > maxx || y < miny || y > maxy )
{
public boolean isInPolygon(long id) {
int x = (int) (id >> 32);
int y = (int) (id & 0xffffffff);
if (x < minx || x > maxx || y < miny || y > maxy) {
return false;
}
int n = ax.length-1; // these are closed polygons
int n = ax.length - 1; // these are closed polygons
boolean inside = false;
int j = n - 1;
for (int i = 0 ;i < n ; j = i++)
{
if ( (ay[i] > y) != (ay[j] > y) )
{
for (int i = 0; i < n; j = i++) {
if ((ay[i] > y) != (ay[j] > y)) {
long v = ax[j] - ax[i];
v *= y - ay[i];
v /= ay[j] - ay[i];
if ( x <= v + ax[i])
{
if (x <= v + ax[i]) {
inside = !inside;
}
}
@ -78,10 +68,9 @@ public class Polygon
return inside;
}
public boolean isInBoundingBox( long id )
{
int x = (int) ( id >> 32 );
int y = (int) ( id & 0xffffffff );
public boolean isInBoundingBox(long id) {
int x = (int) (id >> 32);
int y = (int) (id & 0xffffffff);
return x >= minx && x <= maxx && y >= miny && y <= maxy;
}