-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathMapcodeZone.java.html
More file actions
163 lines (141 loc) · 10.1 KB
/
MapcodeZone.java.html
File metadata and controls
163 lines (141 loc) · 10.1 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml" lang="en"><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"/><link rel="stylesheet" href="../jacoco-resources/report.css" type="text/css"/><link rel="shortcut icon" href="../jacoco-resources/report.gif" type="image/gif"/><title>MapcodeZone.java</title><link rel="stylesheet" href="../jacoco-resources/prettify.css" type="text/css"/><script type="text/javascript" src="../jacoco-resources/prettify.js"></script></head><body onload="window['PR_TAB_WIDTH']=4;prettyPrint()"><div class="breadcrumb" id="breadcrumb"><span class="info"><a href="../jacoco-sessions.html" class="el_session">Sessions</a></span><a href="../index.html" class="el_report">Mapcode Java Library</a> > <a href="index.source.html" class="el_package">com.mapcode</a> > <span class="el_source">MapcodeZone.java</span></div><h1>MapcodeZone.java</h1><pre class="source lang-java linenums">/*
* Copyright (C) 2014-2017, Stichting Mapcode Foundation (http://www.mapcode.com)
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.mapcode;
import javax.annotation.Nonnull;
// ----------------------------------------------------------------------------------------------
// Package private implementation class. For internal use within the Mapcode implementation only.
// ----------------------------------------------------------------------------------------------
/**
* Simple class to represent all the coordinates that would deliver a particular mapcode.
*/
<span class="pc bpc" id="L28" title="1 of 2 branches missed.">class MapcodeZone {</span>
// TODO: Explain why you need these fractions and how they work exactly.
// Longitudes in LonFractions ("1/3240 billionths").
private double lonFractionMin;
private double lonFractionMax;
// Latitudes in LatFractions ("1/810 billionths").
private double latFractionMin;
private double latFractionMax;
MapcodeZone(final double latFractionMin, final double latFractionMax,
<span class="fc" id="L40"> final double lonFractionMin, final double lonFractionMax) {</span>
<span class="fc" id="L41"> this.latFractionMin = latFractionMin;</span>
<span class="fc" id="L42"> this.latFractionMax = latFractionMax;</span>
<span class="fc" id="L43"> this.lonFractionMin = lonFractionMin;</span>
<span class="fc" id="L44"> this.lonFractionMax = lonFractionMax;</span>
<span class="fc" id="L45"> }</span>
MapcodeZone(@Nonnull final MapcodeZone mapcodeZone) {
<span class="fc" id="L48"> this(mapcodeZone.latFractionMin, mapcodeZone.latFractionMax, mapcodeZone.lonFractionMin, mapcodeZone.lonFractionMax);</span>
<span class="fc" id="L49"> }</span>
MapcodeZone() {
<span class="fc" id="L52"> this(0.0, 0.0, 0.0, 0.0);</span>
<span class="fc" id="L53"> }</span>
double getLonFractionMin() {
<span class="fc" id="L56"> return lonFractionMin;</span>
}
double getLonFractionMax() {
<span class="fc" id="L60"> return lonFractionMax;</span>
}
double getLatFractionMin() {
<span class="fc" id="L64"> return latFractionMin;</span>
}
double getLatFractionMax() {
<span class="fc" id="L68"> return latFractionMax;</span>
}
void setLonFractionMin(final double lonFractionMin) {
<span class="nc" id="L72"> this.lonFractionMin = lonFractionMin;</span>
<span class="nc" id="L73"> }</span>
void setLonFractionMax(final double lonFractionMax) {
<span class="fc" id="L76"> this.lonFractionMax = lonFractionMax;</span>
<span class="fc" id="L77"> }</span>
void setLatFractionMin(final double latFractionMin) {
<span class="fc" id="L80"> this.latFractionMin = latFractionMin;</span>
<span class="fc" id="L81"> }</span>
void setLatFractionMax(final double latFractionMax) {
<span class="fc" id="L84"> this.latFractionMax = latFractionMax;</span>
<span class="fc" id="L85"> }</span>
// TODO: Use of this method is unclear.
// Generate upper and lower limits based on x and y, and delta's.
void setFromFractions(final double latFraction, final double lonFraction,
final double latFractionDelta, final double lonFractionDelta) {
<span class="pc bpc" id="L91" title="2 of 4 branches missed."> assert (lonFractionDelta >= 0.0);</span>
<span class="pc bpc" id="L92" title="2 of 4 branches missed."> assert (latFractionDelta != 0.0);</span>
<span class="fc" id="L93"> lonFractionMin = lonFraction;</span>
<span class="fc" id="L94"> lonFractionMax = lonFraction + lonFractionDelta;</span>
<span class="fc bfc" id="L95" title="All 2 branches covered."> if (latFractionDelta < 0) {</span>
<span class="fc" id="L96"> latFractionMin = latFraction + 1 + latFractionDelta; // y + yDelta can NOT be represented.</span>
<span class="fc" id="L97"> latFractionMax = latFraction + 1; // y CAN be represented.</span>
} else {
<span class="fc" id="L99"> latFractionMin = latFraction;</span>
<span class="fc" id="L100"> latFractionMax = latFraction + latFractionDelta;</span>
}
<span class="fc" id="L102"> }</span>
boolean isEmpty() {
<span class="fc bfc" id="L105" title="All 4 branches covered."> return ((lonFractionMax <= lonFractionMin) || (latFractionMax <= latFractionMin));</span>
}
// TODO: Explain what this is (geo point of mapcode).
@Nonnull
Point getCenter() {
<span class="pc bpc" id="L111" title="1 of 2 branches missed."> if (isEmpty()) {</span>
<span class="nc" id="L112"> return Point.undefined();</span>
} else {
<span class="fc" id="L114"> final double latFrac = Math.floor((latFractionMin + latFractionMax) / 2.0);</span>
<span class="fc" id="L115"> final double lonFrac = Math.floor((lonFractionMin + lonFractionMax) / 2.0);</span>
<span class="fc" id="L116"> return Point.fromLatLonFractions(latFrac, lonFrac);</span>
}
}
// TODO: Explain when this is used. It clips a zone to an encompassing boundary.
// Returns a non-empty intersection of a mapcode zone and a territory area.
// Returns null if no such intersection exists.
@Nonnull
MapcodeZone restrictZoneTo(@Nonnull final Boundary area) {
<span class="fc" id="L125"> final MapcodeZone mapcodeZone = new MapcodeZone(latFractionMin, latFractionMax, lonFractionMin, lonFractionMax);</span>
<span class="fc" id="L126"> final double latMin = area.getLatMicroDegMin() * Point.LAT_MICRODEG_TO_FRACTIONS_FACTOR;</span>
<span class="fc bfc" id="L127" title="All 2 branches covered."> if (mapcodeZone.latFractionMin < latMin) {</span>
<span class="fc" id="L128"> mapcodeZone.latFractionMin = latMin;</span>
}
<span class="fc" id="L130"> final double latMax = area.getLatMicroDegMax() * Point.LAT_MICRODEG_TO_FRACTIONS_FACTOR;</span>
<span class="fc bfc" id="L131" title="All 2 branches covered."> if (mapcodeZone.latFractionMax > latMax) {</span>
<span class="fc" id="L132"> mapcodeZone.latFractionMax = latMax;</span>
}
<span class="fc bfc" id="L134" title="All 2 branches covered."> if (mapcodeZone.latFractionMin < mapcodeZone.latFractionMax) {</span>
<span class="fc" id="L135"> double lonMin = area.getLonMicroDegMin() * Point.LON_MICRODEG_TO_FRACTIONS_FACTOR;</span>
<span class="fc" id="L136"> double lonMax = area.getLonMicroDegMax() * Point.LON_MICRODEG_TO_FRACTIONS_FACTOR;</span>
<span class="fc bfc" id="L137" title="All 4 branches covered."> if ((lonMax < 0) && (mapcodeZone.lonFractionMin > 0)) {</span>
<span class="fc" id="L138"> lonMin += (Point.MICRO_DEG_360 * Point.LON_MICRODEG_TO_FRACTIONS_FACTOR);</span>
<span class="fc" id="L139"> lonMax += (Point.MICRO_DEG_360 * Point.LON_MICRODEG_TO_FRACTIONS_FACTOR);</span>
<span class="fc bfc" id="L140" title="All 4 branches covered."> } else if ((lonMin > 1) && (mapcodeZone.lonFractionMax < 0)) {</span>
<span class="fc" id="L141"> lonMin -= (Point.MICRO_DEG_360 * Point.LON_MICRODEG_TO_FRACTIONS_FACTOR);</span>
<span class="fc" id="L142"> lonMax -= (Point.MICRO_DEG_360 * Point.LON_MICRODEG_TO_FRACTIONS_FACTOR);</span>
}
<span class="fc bfc" id="L144" title="All 2 branches covered."> if (mapcodeZone.lonFractionMin < lonMin) {</span>
<span class="fc" id="L145"> mapcodeZone.lonFractionMin = lonMin;</span>
}
<span class="fc bfc" id="L147" title="All 2 branches covered."> if (mapcodeZone.lonFractionMax > lonMax) {</span>
<span class="fc" id="L148"> mapcodeZone.lonFractionMax = lonMax;</span>
}
}
<span class="fc" id="L151"> return mapcodeZone;</span>
}
@Nonnull
@Override
public String toString() {
<span class="nc bnc" id="L157" title="All 2 branches missed."> return isEmpty() ? "empty" : ("[" + (latFractionMin / Point.LAT_TO_FRACTIONS_FACTOR) + ", " +</span>
(latFractionMax / Point.LAT_TO_FRACTIONS_FACTOR) +
"), [" + (lonFractionMin / Point.LON_TO_FRACTIONS_FACTOR) + ", " +
(lonFractionMax / Point.LON_TO_FRACTIONS_FACTOR) + ')');
}
}
</pre><div class="footer"><span class="right">Created with <a href="http://www.jacoco.org/jacoco">JaCoCo</a> 0.8.1.201803210924</span></div></body></html>