@@ -36,12 +36,12 @@ class SubArea {
3636
3737 private static final int SUB_AREAS_INITIAL_CAPACITY = 16250 ;
3838
39- private static final List <SubArea > SUB_AREAS = new ArrayList <>(SUB_AREAS_INITIAL_CAPACITY );
40- private static final TreeMap <Integer , ArrayList <SubArea >> LON_MAP = new TreeMap <>();
41- private static final TreeMap <Integer , ArrayList <SubArea >> LAT_MAP = new TreeMap <>();
39+ private static final List <SubArea > SUB_AREAS = new ArrayList <SubArea >(SUB_AREAS_INITIAL_CAPACITY );
40+ private static final TreeMap <Integer , ArrayList <SubArea >> LON_MAP = new TreeMap <Integer , ArrayList < SubArea > >();
41+ private static final TreeMap <Integer , ArrayList <SubArea >> LAT_MAP = new TreeMap <Integer , ArrayList < SubArea > >();
4242
43- private static final Range <Integer > LAT_BOUNDING_RANGE = new Range <>(Point .LAT_MICRODEG_MIN , Point .LAT_MICRODEG_MAX );
44- private static final Range <Integer > LON_BOUNDING_RANGE = new Range <>(Point .LON_MICRODEG_MIN , Point .LON_MICRODEG_MAX );
43+ private static final Range <Integer > LAT_BOUNDING_RANGE = new Range <Integer >(Point .LAT_MICRODEG_MIN , Point .LAT_MICRODEG_MAX );
44+ private static final Range <Integer > LON_BOUNDING_RANGE = new Range <Integer >(Point .LON_MICRODEG_MIN , Point .LON_MICRODEG_MAX );
4545
4646 static {
4747 LOG .info ("SubArea: Initialize sub-areas for {} territories" , Territory .values ().length );
@@ -115,7 +115,7 @@ static SubArea getArea(final int i) {
115115 @ SuppressWarnings ("unchecked" )
116116 @ Nonnull
117117 static List <SubArea > getAreasForPoint (@ Nonnull final Point point ) {
118- final ArrayList <ArrayList <SubArea >> areaLists = new ArrayList <>();
118+ final ArrayList <ArrayList <SubArea >> areaLists = new ArrayList <ArrayList < SubArea > >();
119119 ArrayList <SubArea > list ;
120120 list = LAT_MAP .get (point .getLatMicroDeg ());
121121
@@ -158,7 +158,7 @@ static List<SubArea> getAreasForPoint(@Nonnull final Point point) {
158158 areaLists .add (list );
159159 }
160160
161- final ArrayList <SubArea > result = new ArrayList <>();
161+ final ArrayList <SubArea > result = new ArrayList <SubArea >();
162162 list = areaLists .get (0 );
163163
164164 mainLoop :
@@ -208,8 +208,8 @@ private SubArea(final int i, @Nonnull final Territory territory, @Nullable final
208208 minMaxSetup (i );
209209 parentTerritory = territory ;
210210 subAreaID = i ;
211- boundedLonRange = new ArrayList <>();
212- boundedLatRange = new ArrayList <>();
211+ boundedLonRange = new ArrayList <Range < Integer > >();
212+ boundedLatRange = new ArrayList <Range < Integer > >();
213213
214214 // Mapcode areas are inclusive for the minimum bounds and exclusive for the maximum bounds
215215 // Trim max by 1, to address boundary cases.
@@ -246,7 +246,7 @@ private SubArea(final int i, @Nonnull final Territory territory, @Nullable final
246246 @ Nonnull
247247 private static ArrayList <Range <Integer >> normaliseRange (
248248 @ Nonnull final Range <Integer > range , @ Nonnull final Range <Integer > boundingRange ) {
249- final ArrayList <Range <Integer >> ranges = new ArrayList <>();
249+ final ArrayList <Range <Integer >> ranges = new ArrayList <Range < Integer > >();
250250
251251 Range <Integer > tempRange = range .constrain (boundingRange );
252252 if (tempRange != null ) {
@@ -255,7 +255,7 @@ private static ArrayList<Range<Integer>> normaliseRange(
255255
256256 Range <Integer > normalisingRange = range ;
257257 while (normalisingRange .getMin () < boundingRange .getMin ()) {
258- normalisingRange = new Range <>((normalisingRange .getMin () + boundingRange .getMax ())
258+ normalisingRange = new Range <Integer >((normalisingRange .getMin () + boundingRange .getMax ())
259259 - boundingRange .getMin (), (normalisingRange .getMax () + boundingRange .getMax ())
260260 - boundingRange .getMin ());
261261 tempRange = normalisingRange .constrain (boundingRange );
@@ -266,7 +266,7 @@ private static ArrayList<Range<Integer>> normaliseRange(
266266
267267 normalisingRange = range ;
268268 while (normalisingRange .getMax () > boundingRange .getMax ()) {
269- normalisingRange = new Range <>((normalisingRange .getMin () - boundingRange .getMax ())
269+ normalisingRange = new Range <Integer >((normalisingRange .getMin () - boundingRange .getMax ())
270270 + boundingRange .getMin (), (normalisingRange .getMax () - boundingRange .getMax ())
271271 + boundingRange .getMin ());
272272 tempRange = normalisingRange .constrain (boundingRange );
@@ -293,8 +293,8 @@ boolean containsPoint(@Nonnull final Point point) {
293293 @ Nonnull
294294 SubArea extendBounds (final int xExtension , final int yExtension ) {
295295 final SubArea result = new SubArea ();
296- result .latRange = new Range <>(this .getMinY () - yExtension , getMaxY () + yExtension );
297- result .lonRange = new Range <>(this .getMinX () - xExtension , getMaxX () + xExtension );
296+ result .latRange = new Range <Integer >(this .getMinY () - yExtension , getMaxY () + yExtension );
297+ result .lonRange = new Range <Integer >(this .getMinX () - xExtension , getMaxX () + xExtension );
298298 return result ;
299299 }
300300
@@ -327,11 +327,11 @@ private void minMaxSetup(final int arg) {
327327 i += 4 ;
328328 final int maxY = DataAccess .asLong (i );
329329
330- latRange = new Range <>(minY , maxY );
331- lonRange = new Range <>(minX , maxX );
330+ latRange = new Range <Integer >(minY , maxY );
331+ lonRange = new Range <Integer >(minX , maxX );
332332 }
333333
334334 private static Range <Integer > trimRange (final Range <Integer > range ) {
335- return new Range <>(range .getMin (), range .getMax () - 1 );
335+ return new Range <Integer >(range .getMin (), range .getMax () - 1 );
336336 }
337337}
0 commit comments