Fix some Lint issues

This commit is contained in:
Emux 2023-12-14 18:46:25 +02:00
parent bcf6a7f630
commit de70dec44a
No known key found for this signature in database
GPG key ID: 64ED9980896038C3
5 changed files with 6 additions and 1 deletions

View file

@ -51,7 +51,7 @@ public final class WaypointMatcherImpl implements WaypointMatcher {
} }
// sort result list // sort result list
comparator = new Comparator<>() { comparator = new Comparator<MatchedWaypoint>() {
@Override @Override
public int compare(MatchedWaypoint mw1, MatchedWaypoint mw2) { public int compare(MatchedWaypoint mw1, MatchedWaypoint mw2) {
int cmpDist = Double.compare(mw1.radius, mw2.radius); int cmpDist = Double.compare(mw1.radius, mw2.radius);

View file

@ -271,6 +271,7 @@ public class BRouterService extends Service {
} }
} }
@SuppressWarnings("deprecation")
private void logBundle(Bundle params) { private void logBundle(Bundle params) {
if (AppLogger.isLogging()) { if (AppLogger.isLogging()) {
for (String k : params.keySet()) { for (String k : params.keySet()) {

View file

@ -36,6 +36,7 @@ public class BRouterWorker {
public List<OsmNodeNamed> nogoPolygonsList; public List<OsmNodeNamed> nogoPolygonsList;
public String profileParams; public String profileParams;
@SuppressWarnings("deprecation")
public String getTrackFromParams(Bundle params) { public String getTrackFromParams(Bundle params) {
int engineMode = 0; int engineMode = 0;

View file

@ -224,6 +224,7 @@ public class CompactLongMap<V> {
// does sorted array "a" contain "id" ? // does sorted array "a" contain "id" ?
@SuppressWarnings("unchecked")
private boolean contains(int idx, long id, boolean doPut) { private boolean contains(int idx, long id, boolean doPut) {
long[] a = al[idx]; long[] a = al[idx];
int offset = a.length; int offset = a.length;
@ -243,6 +244,7 @@ public class CompactLongMap<V> {
return false; return false;
} }
@SuppressWarnings("unchecked")
protected void moveToFrozenArrays(long[] faid, List<V> flv) { protected void moveToFrozenArrays(long[] faid, List<V> flv) {
for (int i = 1; i < MAXLISTS; i++) { for (int i = 1; i < MAXLISTS; i++) {
pa[i] = 0; pa[i] = 0;

View file

@ -19,6 +19,7 @@ public final class SortedHeap<V> {
/** /**
* @return the lowest key value, or null if none * @return the lowest key value, or null if none
*/ */
@SuppressWarnings("unchecked")
public V popLowestKeyValue() { public V popLowestKeyValue() {
SortedBin bin = firstNonEmpty; SortedBin bin = firstNonEmpty;
if (firstNonEmpty == null) { if (firstNonEmpty == null) {