1 package cz.cuni.amis.pogamut.base.utils.math;
2
3 import java.util.ArrayList;
4 import java.util.Collection;
5 import java.util.Collections;
6 import java.util.Comparator;
7 import java.util.LinkedList;
8 import java.util.List;
9
10 import cz.cuni.amis.pogamut.base3d.worldview.object.ILocated;
11 import cz.cuni.amis.pogamut.base3d.worldview.object.IViewable;
12 import cz.cuni.amis.pogamut.base3d.worldview.object.Location;
13 import cz.cuni.amis.utils.IFilter;
14 import cz.cuni.amis.utils.Tuple2;
15
16
17
18
19
20
21
22
23
24
25
26
27 public class DistanceUtils {
28
29
30
31
32
33
34
35
36
37
38
39
40
41 public static interface IBetterRelation<T> {
42
43 public boolean isBetterRelation(ILocated target, T examinedObject, double examinedObjectToTargetDistance, T currentBestCandidate, double currentBestObjectToTargetDistance);
44
45 }
46
47
48
49
50
51
52
53 public static class RelationCloser<T> implements IBetterRelation<T> {
54
55 @Override
56 public boolean isBetterRelation(ILocated target, T examinedObject, double examinedObjetToTargetDistance, T currentBestCandidate, double currentBestObjectToTargetDistance) {
57 return examinedObjetToTargetDistance < currentBestObjectToTargetDistance;
58 }
59
60 }
61
62 @SuppressWarnings("rawtypes")
63 public static final RelationCloser relationCloser = new RelationCloser();
64
65
66
67
68
69
70
71 public static class RelationFurther<T> implements IBetterRelation<T> {
72
73 @Override
74 public boolean isBetterRelation(ILocated target, T examinedObject, double examinedObjetToTargetDistance, T currentBestCandidate, double currentBestObjectToTargetDistance) {
75 return examinedObjetToTargetDistance > currentBestObjectToTargetDistance;
76 }
77
78 }
79
80 @SuppressWarnings("rawtypes")
81 public static final RelationFurther relationFurther = new RelationFurther();
82
83
84
85
86
87
88
89
90
91
92
93
94
95 public static interface IGetDistance<T> {
96
97 public double getDistance(T object, ILocated target);
98
99 }
100
101
102
103
104
105
106
107 public static class GetLocatedDistance3D<T extends ILocated> implements IGetDistance<T> {
108
109
110
111
112 @Override
113 public double getDistance(T object, ILocated target) {
114 if (object.getLocation() == null) return Double.MAX_VALUE;
115 return object.getLocation().getDistance(target.getLocation());
116 }
117
118 }
119
120
121
122
123 public static final GetLocatedDistance3D<ILocated> getLocatedDistance3D = new GetLocatedDistance3D<ILocated>();
124
125
126
127
128
129
130
131 public static class GetLocatedDistance2D<T extends ILocated> implements IGetDistance<T> {
132
133
134
135
136 @Override
137 public double getDistance(T object, ILocated target) {
138 if (object.getLocation() == null) return Double.MAX_VALUE;
139 return object.getLocation().getDistance2D(target.getLocation());
140 }
141
142 }
143
144
145
146
147 public static final GetLocatedDistance2D<ILocated> getLocatedDistance2D = new GetLocatedDistance2D<ILocated>();
148
149
150
151
152
153
154
155
156
157
158
159
160
161 public static interface IDistanceFilter<T> {
162
163
164
165
166
167
168
169 public boolean isAccepted(T object, ILocated target, double distanceToTarget);
170
171 }
172
173
174
175
176
177
178
179
180 public static final class AcceptAllDistanceFilter<T> implements IDistanceFilter<T> {
181
182 @Override
183 public boolean isAccepted(T object, ILocated target, double distanceToTarget) {
184 return true;
185 }
186
187 }
188
189
190
191
192 @SuppressWarnings("unchecked")
193 public static final AcceptAllDistanceFilter acceptAllDistanceFilter = new AcceptAllDistanceFilter();
194
195
196
197
198 public static final IDistanceFilter[] NO_FILTER = new IDistanceFilter[]{ acceptAllDistanceFilter };
199
200
201
202
203
204
205
206 public static class RangeDistanceFilter<T> implements IDistanceFilter<T> {
207
208 private double minDistance;
209 private double maxDistance;
210
211 public RangeDistanceFilter(double minDistance, double maxDistance) {
212 this.minDistance = minDistance;
213 this.maxDistance = maxDistance;
214 }
215
216 @Override
217 public boolean isAccepted(T object, ILocated target, double distanceToTarget) {
218 return minDistance <= distanceToTarget && distanceToTarget <= maxDistance;
219 }
220
221 }
222
223
224
225
226
227
228
229 public static class VisibleFilter<T extends IViewable> implements IDistanceFilter<T> {
230
231 @Override
232 public boolean isAccepted(T object, ILocated target, double distanceToTarget) {
233 return object.isVisible();
234 }
235
236 }
237
238
239
240
241 public static final VisibleFilter<IViewable> visibleFilter = new VisibleFilter<IViewable>();
242
243
244
245
246
247
248
249
250 public static class FilterAdapter<T> implements IDistanceFilter<T> {
251
252 private IFilter<T> filter;
253
254 public FilterAdapter(IFilter<T> filter) {
255 this.filter = filter;
256 }
257
258 @Override
259 public boolean isAccepted(T object, ILocated target, double distanceToTarget) {
260 return filter.isAccepted(object);
261 }
262
263 }
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290 public static <T> T getInBestRelation(Collection<T> locations, ILocated target, IGetDistance getDistance, IBetterRelation betterRelation, IDistanceFilter... filters) {
291 if (filters == null || (filters.length == 1 && filters[0] == acceptAllDistanceFilter)) {
292 return getInBestRelation(locations, target, getDistance, betterRelation);
293 }
294 if (filters == null) return null;
295 if (locations == null) return null;
296 if (target == null) return null;
297 if (target.getLocation() == null) return null;
298 if (getDistance == null) return null;
299 if (betterRelation == null) return null;
300
301 T nearest = null;
302 double minDistance = Double.MAX_VALUE;
303 double distance;
304
305 for(T location : locations) {
306 distance = getDistance.getDistance(location, target);
307
308 boolean accepted = true;
309 for (IDistanceFilter filter : filters) {
310 if (filter == null) continue;
311 if (filter.isAccepted(location, target, distance)) continue;
312 accepted = false;
313 break;
314 }
315
316 if (accepted) {
317 if (betterRelation.isBetterRelation(target, location, distance, nearest, minDistance)) {
318 minDistance = distance;
319 nearest = location;
320 }
321 }
322 }
323
324 return nearest;
325 }
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343 public static <T> T getInBestRelation(Collection<T> locations, ILocated target, IGetDistance getDistance, IBetterRelation betterRelation) {
344 if (locations == null) return null;
345 if (target == null) return null;
346 if (target.getLocation() == null) return null;
347 if (getDistance == null) return null;
348 if (betterRelation == null) return null;
349
350 T best = null;
351 double bestDistance = Double.MAX_VALUE;
352 double distance;
353
354 for(T location : locations) {
355 distance = getDistance.getDistance(location, target);
356
357 if (betterRelation.isBetterRelation(target, location, distance, best, bestDistance)) {
358 bestDistance = distance;
359 best = location;
360 }
361 }
362
363 return best;
364 }
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386 public static <T> T getInNthBestRelation(int nthBest, Collection<T> locations, ILocated target, IGetDistance getDistance, IBetterRelation betterRelation, IDistanceFilter... filters) {
387 if (nthBest < 1) return getInBestRelation(locations, target, getDistance, betterRelation, filters);
388 if (filters == null) return null;
389 if (locations == null) return null;
390 if (target == null) return null;
391 if (target.getLocation() == null) return null;
392 if (getDistance == null) return null;
393 if (betterRelation == null) return null;
394
395 List<Tuple2<T, Double>> best = new ArrayList<Tuple2<T, Double>>();
396
397 double distance;
398
399 for(T location : locations) {
400 distance = getDistance.getDistance(location, target);
401
402 boolean accepted = true;
403 for (IDistanceFilter filter : filters) {
404 if (filter == null) continue;
405 if (filter.isAccepted(location, target, distance)) continue;
406 accepted = false;
407 break;
408 }
409
410 if (accepted) {
411 int i = 0;
412 for (; i < best.size(); ++i) {
413 Tuple2<T, Double> candidate = best.get(i);
414 if (betterRelation.isBetterRelation(target, location, distance, candidate.getFirst(), candidate.getSecond())) {
415 break;
416 }
417 }
418 if (i < nthBest) {
419 if (i < best.size()) {
420 best.add(i, new Tuple2<T, Double>(location, distance));
421 } else {
422 best.add(new Tuple2<T, Double>(location, distance));
423 }
424 }
425 }
426 }
427
428 return best.size() == 0 ? null : best.get(best.size()-1).getFirst();
429 }
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448 public static <T> T getInNthBestRelation(int nthBest, Collection<T> locations, ILocated target, IGetDistance getDistance, IBetterRelation betterRelation) {
449 if (nthBest < 1) return getInBestRelation(locations, target, getDistance, betterRelation);
450 if (locations == null) return null;
451 if (target == null) return null;
452 if (target.getLocation() == null) return null;
453 if (getDistance == null) return null;
454 if (betterRelation == null) return null;
455
456 List<Tuple2<T, Double>> best = new ArrayList<Tuple2<T, Double>>();
457
458 double distance;
459
460 for(T location : locations) {
461 distance = getDistance.getDistance(location, target);
462
463 int i = 0;
464 for (; i < best.size(); ++i) {
465 Tuple2<T, Double> candidate = best.get(i);
466 if (betterRelation.isBetterRelation(target, location, distance, candidate.getFirst(), candidate.getSecond())) {
467 break;
468 }
469 }
470 if (i < nthBest) {
471 if (i < best.size()) {
472 best.add(i, new Tuple2<T, Double>(location, distance));
473 } else {
474 best.add(new Tuple2<T, Double>(location, distance));
475 }
476 }
477 }
478
479 return best.size() == 0 ? null : best.get(best.size()-1).getFirst();
480 }
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496 public static <T> T getNearest(Collection<T> locations, ILocated target, IGetDistance getDistance, IDistanceFilter... filters) {
497 return
498 getInBestRelation(
499 locations,
500 target,
501 getDistance,
502 relationCloser,
503 filters
504 );
505 }
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522 public static <T> T getNthNearest(int nthNearest, Collection<T> locations, ILocated target, IGetDistance getDistance, IDistanceFilter... filters) {
523 return
524 getInNthBestRelation(
525 nthNearest,
526 locations,
527 target,
528 getDistance,
529 relationCloser,
530 filters
531 );
532 }
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548 public static <T> T getFarthest(Collection<T> locations, ILocated target, IGetDistance getDistance, IDistanceFilter... filters) {
549 return
550 getInBestRelation(
551 locations,
552 target,
553 getDistance,
554 relationFurther,
555 filters
556 );
557 }
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574 public static <T> T getNthFarthest(int nthFarthest, Collection<T> locations, ILocated target, IGetDistance getDistance, IDistanceFilter... filters) {
575 return
576 getInNthBestRelation(
577 nthFarthest,
578 locations,
579 target,
580 getDistance,
581 relationFurther,
582 filters
583 );
584 }
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599 public static <T> T getNearest(Collection<T> locations, ILocated target, IGetDistance getDistance) {
600 return
601 getInBestRelation(
602 locations,
603 target,
604 getDistance,
605 relationCloser
606 );
607 }
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623 public static <T> T getNthNearest(int nthNearest, Collection<T> locations, ILocated target, IGetDistance getDistance) {
624 return
625 getInNthBestRelation(
626 nthNearest,
627 locations,
628 target,
629 getDistance,
630 relationCloser
631 );
632 }
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647 public static <T> T getFarthest(Collection<T> locations, ILocated target, IGetDistance getDistance) {
648 return
649 getInBestRelation(
650 locations,
651 target,
652 getDistance,
653 relationFurther
654 );
655 }
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671 public static <T> T getNthFarthest(int nthFarthest, Collection<T> locations, ILocated target, IGetDistance getDistance) {
672 return
673 getInNthBestRelation(
674 nthFarthest,
675 locations,
676 target,
677 getDistance,
678 relationFurther
679 );
680 }
681
682
683
684
685
686
687
688
689
690
691
692
693 public static <T extends ILocated> T getNearest(Collection<T> locations, ILocated target, IDistanceFilter... filters) {
694 return getNearest(locations, target, getLocatedDistance3D, filters);
695 }
696
697
698
699
700
701
702
703
704
705
706
707
708
709 public static <T extends ILocated> T getNthNearest(int nthNearest, Collection<T> locations, ILocated target, IDistanceFilter... filters) {
710 return getNthNearest(nthNearest, locations, target, getLocatedDistance3D, filters);
711 }
712
713
714
715
716
717
718
719
720
721
722
723
724 public static <T extends ILocated> T getFarthest(Collection<T> locations, ILocated target, IDistanceFilter... filters) {
725 return getFarthest(locations, target, getLocatedDistance3D, filters);
726 }
727
728
729
730
731
732
733
734
735
736
737
738
739
740 public static <T extends ILocated> T getNthFarthest(int nthFarthest, Collection<T> locations, ILocated target, IDistanceFilter... filters) {
741 return getNthFarthest(nthFarthest, locations, target, getLocatedDistance3D, filters);
742 }
743
744
745
746
747
748
749
750
751
752
753
754 public static <T extends ILocated> T getNearest(Collection<T> locations, ILocated target) {
755 return getNearest(locations, target, getLocatedDistance3D);
756 }
757
758
759
760
761
762
763
764
765
766
767
768
769 public static <T extends ILocated> T getNthNearest(int nthNearest, Collection<T> locations, ILocated target) {
770 return getNthNearest(nthNearest, locations, target, getLocatedDistance3D);
771 }
772
773
774
775
776
777
778
779
780
781
782
783 public static <T extends ILocated> T getFarthest(Collection<T> locations, ILocated target) {
784 return getFarthest(locations, target, getLocatedDistance3D);
785 }
786
787
788
789
790
791
792
793
794
795
796
797
798 public static <T extends ILocated> T getNthFarthest(int nthFarthest, Collection<T> locations, ILocated target) {
799 return getNthFarthest(nthFarthest, locations, target, getLocatedDistance3D);
800 }
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815 public static <T extends ILocated> T getNearest(Collection<T> locations, ILocated target, double maxDistance) {
816 return getNearest(locations, target, new RangeDistanceFilter<T>(0, maxDistance));
817 }
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833 public static <T extends ILocated> T getNthNearest(int nthNearest, Collection<T> locations, ILocated target, double maxDistance) {
834 return getNthNearest(nthNearest, locations, target, new RangeDistanceFilter<T>(0, maxDistance));
835 }
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850 public static <T extends ILocated> T getFarthest(Collection<T> locations, ILocated target, double maxDistance) {
851 return getFarthest(locations, target, new RangeDistanceFilter<T>(0, maxDistance));
852 }
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868 public static <T extends ILocated> T getNthFarthest(int nthFarthest, Collection<T> locations, ILocated target, double maxDistance) {
869 return getNthFarthest(nthFarthest, locations, target, new RangeDistanceFilter<T>(0, maxDistance));
870 }
871
872
873
874
875
876
877
878
879
880
881
882
883 public static <T extends ILocated> T getNearestFiltered(Collection<T> locations, ILocated target, IFilter filter) {
884 if (filter == null) {
885 return getNearest(locations, target);
886 }
887 return getNearest(locations, target, new FilterAdapter<T>(filter));
888 }
889
890
891
892
893
894
895
896
897
898
899
900
901
902 public static <T extends ILocated> T getNthNearestFiltered(int nthNearest, Collection<T> locations, ILocated target, IFilter filter) {
903 if (filter == null) {
904 return getNthNearest(nthNearest, locations, target);
905 }
906 return getNthNearest(nthNearest, locations, target, new FilterAdapter<T>(filter));
907 }
908
909
910
911
912
913
914
915
916
917
918
919
920 public static <T extends ILocated> T getFarthestFiltered(Collection<T> locations, ILocated target, IFilter filter) {
921 if (filter == null) {
922 return getFarthest(locations, target);
923 }
924 return getFarthest(locations, target, new FilterAdapter<T>(filter));
925 }
926
927
928
929
930
931
932
933
934
935
936
937
938
939 public static <T extends ILocated> T getNthFarthestFiltered(int nthFarthest, Collection<T> locations, ILocated target, IFilter filter) {
940 if (filter == null) {
941 return getNthFarthest(nthFarthest, locations, target);
942 }
943 return getNthFarthest(nthFarthest, locations, target, new FilterAdapter<T>(filter));
944 }
945
946
947
948
949
950
951
952
953
954
955
956 public static <T extends IViewable> T getNearestVisible(Collection<T> locations, ILocated target) {
957 return getNearest(locations, target, getLocatedDistance3D, visibleFilter);
958 }
959
960
961
962
963
964
965
966
967
968
969
970
971 public static <T extends IViewable> T getNthNearestVisible(int nthNearest, Collection<T> locations, ILocated target) {
972 return getNthNearest(nthNearest, locations, target, getLocatedDistance3D, visibleFilter);
973 }
974
975
976
977
978
979
980
981
982
983
984
985 public static <T extends IViewable> T getFarthestVisible(Collection<T> locations, ILocated target) {
986 return getFarthest(locations, target, getLocatedDistance3D, visibleFilter);
987 }
988
989
990
991
992
993
994
995
996
997
998
999
1000 public static <T extends IViewable> T getNthFarthestVisible(int nthFarthest, Collection<T> locations, ILocated target) {
1001 return getNthFarthest(nthFarthest, locations, target, getLocatedDistance3D, visibleFilter);
1002 }
1003
1004
1005
1006
1007
1008
1009
1010 private static class DistancesComparator implements Comparator<Tuple2<Object, Double>> {
1011
1012 @Override
1013 public int compare(Tuple2<Object, Double> o1, Tuple2<Object, Double> o2) {
1014 double result = o1.getSecond() - o2.getSecond();
1015 if (result < 0) return -1;
1016 if (result > 0) return 1;
1017 return 0;
1018 }
1019
1020 }
1021
1022 private static final DistancesComparator distancesComparator = new DistancesComparator();
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037 public static <T> List<T> getDistanceSorted(Collection<T> locations, ILocated target, IGetDistance getDistance) {
1038 if (locations == null) return null;
1039 if (target == null) return null;
1040 if (target.getLocation() == null) return null;
1041 if (getDistance == null) return null;
1042
1043 List<Tuple2<T, Double>> distances = new ArrayList<Tuple2<T, Double>>(locations.size());
1044
1045 for (T location : locations) {
1046 double distance = getDistance.getDistance(location, target);
1047 distances.add(new Tuple2<T, Double>(location, distance));
1048 }
1049
1050 Collections.sort((List)distances, (Comparator)distancesComparator);
1051
1052 List<T> result = new ArrayList<T>(distances.size());
1053
1054 for (Tuple2<T, Double> location : distances) {
1055 result.add(location.getFirst());
1056 }
1057
1058 return result;
1059 }
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074 public static <T> List<T> getDistanceSorted(Collection<T> locations, ILocated target, IGetDistance getDistance, IDistanceFilter... filters) {
1075 if (filters == null || filters.length == 0 || (filters.length == 1 && filters[0] instanceof AcceptAllDistanceFilter)) {
1076 return getDistanceSorted(locations, target, getDistance);
1077 }
1078 if (locations == null) return null;
1079 if (target == null) return null;
1080 if (getDistance == null) return null;
1081 Location targetLoc = target.getLocation();
1082 if (targetLoc == null) return null;
1083
1084 List<Tuple2<T, Double>> distances = new ArrayList<Tuple2<T, Double>>(locations.size());
1085
1086 for (T location : locations) {
1087 boolean accepted = true;
1088 double distance = getDistance.getDistance(location, targetLoc);
1089 for (IDistanceFilter filter : filters) {
1090 if (!filter.isAccepted(location, targetLoc, distance)) {
1091 accepted = false;
1092 break;
1093 }
1094 }
1095 if (!accepted) continue;
1096
1097 distances.add(new Tuple2<T, Double>(location, distance));
1098 }
1099
1100 Collections.sort((List)distances, (Comparator)distancesComparator);
1101
1102 List<T> result = new ArrayList<T>(distances.size());
1103
1104 for (Tuple2<T, Double> location : distances) {
1105 result.add(location.getFirst());
1106 }
1107
1108 return result;
1109 }
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122 public static <T extends ILocated> List<T> getDistanceSorted(Collection<T> locations, ILocated target, IDistanceFilter... filters) {
1123 return getDistanceSorted(locations, target, getLocatedDistance3D, filters);
1124 }
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136 public static <T extends ILocated> List<T> getDistanceSorted(Collection<T> locations, ILocated target) {
1137 return getDistanceSorted(locations, target, getLocatedDistance3D);
1138 }
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154 public static <T extends ILocated> List<T> getDistanceSorted(Collection<T> locations, ILocated target, double maxDistance) {
1155 return getDistanceSorted(locations, target, new RangeDistanceFilter<T>(0, maxDistance));
1156 }
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169 public static <T extends ILocated> List<T> getDistanceSortedFiltered(Collection<T> locations, ILocated target, IFilter filter) {
1170 if (filter == null) {
1171 return getDistanceSorted(locations, target);
1172 }
1173 return getDistanceSorted(locations, target, new FilterAdapter<T>(filter));
1174 }
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186 public static <T extends IViewable> List<T> getDistanceSortedVisible(Collection<T> locations, ILocated target) {
1187 return (List<T>) getDistanceSorted(locations, target, (IGetDistance)getLocatedDistance3D, (IDistanceFilter)visibleFilter);
1188 }
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210 @Deprecated
1211 public static <T> T getSecondNearest(Collection<T> locations, ILocated target, IGetDistance getDistance) {
1212 return getNthNearest(2, locations, target, getDistance);
1213 }
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227 @Deprecated
1228 public static <T> T getSecondNearest(Collection<T> locations, ILocated target, IGetDistance getDistance, IDistanceFilter... filters) {
1229 return getNthNearest(2, locations, target, getDistance, filters);
1230 }
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245 @Deprecated
1246 public static <T extends ILocated> T getSecondNearest(Collection<T> locations, ILocated target, IDistanceFilter... filters) {
1247 return getNthNearest(2, locations, target, filters);
1248 }
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262 @Deprecated
1263 public static <T extends ILocated> T getSecondNearest(Collection<T> locations, ILocated target) {
1264 return getNthNearest(2, locations, target);
1265 }
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282 @Deprecated
1283 public static <T extends ILocated> T getSecondNearest(Collection<T> locations, ILocated target, double maxDistance) {
1284 return getNthNearest(2, locations, target, new RangeDistanceFilter<T>(0, maxDistance));
1285 }
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300 @Deprecated
1301 public static <T extends ILocated> T getSecondNearestFiltered(Collection<T> locations, ILocated target, IFilter filter) {
1302 return getNthNearestFiltered(2, locations, target, filter);
1303 }
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317 @Deprecated
1318 public static <T extends IViewable> T getSecondNearestVisible(Collection<T> locations, ILocated target) {
1319 return getNthNearestVisible(2, locations, target);
1320 }
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339 public static <T extends ILocated> T getNearest2D(Collection<T> locations, ILocated target, IDistanceFilter... filters) {
1340 return getNearest(locations, target, getLocatedDistance2D, filters);
1341 }
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355 public static <T extends ILocated> T getNthNearest2D(int nthNearest, Collection<T> locations, ILocated target, IDistanceFilter... filters) {
1356 return getNthNearest(nthNearest, locations, target, getLocatedDistance2D, filters);
1357 }
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370 public static <T extends ILocated> T getFarthest2D(Collection<T> locations, ILocated target, IDistanceFilter... filters) {
1371 return getFarthest(locations, target, getLocatedDistance2D, filters);
1372 }
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386 public static <T extends ILocated> T getNthFarthest2D(int nthFarthest, Collection<T> locations, ILocated target, IDistanceFilter... filters) {
1387 return getNthFarthest(nthFarthest, locations, target, getLocatedDistance2D, filters);
1388 }
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400 public static <T extends ILocated> T getNearest2D(Collection<T> locations, ILocated target) {
1401 return getNearest(locations, target, getLocatedDistance2D);
1402 }
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415 public static <T extends ILocated> T getNthNearest2D(int nthNearest, Collection<T> locations, ILocated target) {
1416 return getNthNearest(nthNearest, locations, target, getLocatedDistance2D);
1417 }
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429 public static <T extends ILocated> T getFarthest2D(Collection<T> locations, ILocated target) {
1430 return getFarthest(locations, target, getLocatedDistance2D);
1431 }
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444 public static <T extends ILocated> T getNthFarthest2D(int nthFarthest, Collection<T> locations, ILocated target) {
1445 return getNthFarthest(nthFarthest, locations, target, getLocatedDistance2D);
1446 }
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461 public static <T extends ILocated> T getNearest2D(Collection<T> locations, ILocated target, double maxDistance) {
1462 return getNearest2D(locations, target, new RangeDistanceFilter<T>(0, maxDistance));
1463 }
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479 public static <T extends ILocated> T getNthNearest2D(int nthNearest, Collection<T> locations, ILocated target, double maxDistance) {
1480 return getNthNearest2D(nthNearest, locations, target, new RangeDistanceFilter<T>(0, maxDistance));
1481 }
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496 public static <T extends ILocated> T getFarthest2D(Collection<T> locations, ILocated target, double maxDistance) {
1497 return getFarthest2D(locations, target, new RangeDistanceFilter<T>(0, maxDistance));
1498 }
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514 public static <T extends ILocated> T getNthFarthest2D(int nthFarthest, Collection<T> locations, ILocated target, double maxDistance) {
1515 return getNthFarthest2D(nthFarthest, locations, target, new RangeDistanceFilter<T>(0, maxDistance));
1516 }
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529 public static <T extends ILocated> T getNearestFiltered2D(Collection<T> locations, ILocated target, IFilter filter) {
1530 if (filter == null) {
1531 return getNearest2D(locations, target);
1532 }
1533 return getNearest2D(locations, target, new FilterAdapter<T>(filter));
1534 }
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548 public static <T extends ILocated> T getNthNearestFiltered2D(int nthNearest, Collection<T> locations, ILocated target, IFilter filter) {
1549 if (filter == null) {
1550 return getNthNearest2D(nthNearest, locations, target);
1551 }
1552 return getNthNearest2D(nthNearest, locations, target, new FilterAdapter<T>(filter));
1553 }
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566 public static <T extends ILocated> T getFarthestFiltered2D(Collection<T> locations, ILocated target, IFilter filter) {
1567 if (filter == null) {
1568 return getFarthest2D(locations, target);
1569 }
1570 return getFarthest2D(locations, target, new FilterAdapter<T>(filter));
1571 }
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585 public static <T extends ILocated> T getNthFarthestFiltered2D(int nthFarthest, Collection<T> locations, ILocated target, IFilter filter) {
1586 if (filter == null) {
1587 return getNthFarthest2D(nthFarthest, locations, target);
1588 }
1589 return getNthFarthest2D(nthFarthest, locations, target, new FilterAdapter<T>(filter));
1590 }
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602 public static <T extends IViewable> T getNearestVisible2D(Collection<T> locations, ILocated target) {
1603 return getNearest(locations, target, getLocatedDistance2D, visibleFilter);
1604 }
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617 public static <T extends IViewable> T getNthNearestVisible2D(int nthNearest, Collection<T> locations, ILocated target) {
1618 return getNthNearest(nthNearest, locations, target, getLocatedDistance2D, visibleFilter);
1619 }
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631 public static <T extends IViewable> T getFarthestVisible2D(Collection<T> locations, ILocated target) {
1632 return getFarthest(locations, target, getLocatedDistance2D, visibleFilter);
1633 }
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646 public static <T extends IViewable> T getNthFarthestVisible2D(int nthFarthest, Collection<T> locations, ILocated target) {
1647 return getNthFarthest(nthFarthest, locations, target, getLocatedDistance2D, visibleFilter);
1648 }
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669 @Deprecated
1670 public static <T extends ILocated> T getSecondNearest2D(Collection<T> locations, ILocated target, IDistanceFilter... filters) {
1671 return getNthNearest2D(2, locations, target, filters);
1672 }
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686 @Deprecated
1687 public static <T extends ILocated> T getSecondNearest2D(Collection<T> locations, ILocated target) {
1688 return getNthNearest2D(2, locations, target);
1689 }
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706 @Deprecated
1707 public static <T extends ILocated> T getSecondNearest2D(Collection<T> locations, ILocated target, double maxDistance) {
1708 return getNthNearest2D(2, locations, target, maxDistance);
1709 }
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724 @Deprecated
1725 public static <T extends ILocated> T getSecondNearest2DFiltered(Collection<T> locations, ILocated target, IFilter<T> filter) {
1726 if (filter == null) {
1727 return getNthNearest2D(2, locations, target);
1728 }
1729 return getNthNearest2D(2, locations, target, new FilterAdapter<T>(filter));
1730 }
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744 @Deprecated
1745 public static <T extends IViewable> T getSecondNearest2DVisible(Collection<T> locations, ILocated target) {
1746 return getNthNearestVisible2D(2, locations, target);
1747 }
1748
1749 }