aboutsummaryrefslogtreecommitdiff
path: root/src/org
diff options
context:
space:
mode:
authorAnton Tananaev <anton.tananaev@gmail.com>2016-04-17 11:22:23 +1200
committerAnton Tananaev <anton.tananaev@gmail.com>2016-04-17 11:22:23 +1200
commitda095966b77c931c5e0f6209cc7ba33cd72a1953 (patch)
treef6f9d95e15f2125a0bf74587415cf417becdbe67 /src/org
parentf5b61271e37c87d7f598820553734e518d9599c1 (diff)
downloadtrackermap-server-da095966b77c931c5e0f6209cc7ba33cd72a1953.tar.gz
trackermap-server-da095966b77c931c5e0f6209cc7ba33cd72a1953.tar.bz2
trackermap-server-da095966b77c931c5e0f6209cc7ba33cd72a1953.zip
Fix static code analysis issues
Diffstat (limited to 'src/org')
-rw-r--r--src/org/traccar/database/DataManager.java1
-rw-r--r--src/org/traccar/helper/LocationTree.java10
2 files changed, 4 insertions, 7 deletions
diff --git a/src/org/traccar/database/DataManager.java b/src/org/traccar/database/DataManager.java
index d9a1439f2..7baa1df47 100644
--- a/src/org/traccar/database/DataManager.java
+++ b/src/org/traccar/database/DataManager.java
@@ -44,7 +44,6 @@ import org.traccar.helper.Log;
import org.traccar.model.Device;
import org.traccar.model.Group;
import org.traccar.model.GroupPermission;
-import org.traccar.model.MiscFormatter;
import org.traccar.model.DevicePermission;
import org.traccar.model.Position;
import org.traccar.model.Server;
diff --git a/src/org/traccar/helper/LocationTree.java b/src/org/traccar/helper/LocationTree.java
index 3c2d2ff92..5e16fc095 100644
--- a/src/org/traccar/helper/LocationTree.java
+++ b/src/org/traccar/helper/LocationTree.java
@@ -112,12 +112,10 @@ public class LocationTree {
if (current.squaredDistance(search) < best.squaredDistance(search)) {
best = current;
}
- if (other != null) {
- if (current.axisSquaredDistance(search, depth % 2) < best.squaredDistance(search)) {
- Item possibleBest = findNearest(other, search, depth + 1);
- if (possibleBest.squaredDistance(search) < best.squaredDistance(search)) {
- best = possibleBest;
- }
+ if (other != null && current.axisSquaredDistance(search, depth % 2) < best.squaredDistance(search)) {
+ Item possibleBest = findNearest(other, search, depth + 1);
+ if (possibleBest.squaredDistance(search) < best.squaredDistance(search)) {
+ best = possibleBest;
}
}