You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@sis.apache.org by de...@apache.org on 2021/02/25 14:52:00 UTC
[sis] 02/04: Replace ≧ by ≥ and ≦ by ≤.
This is an automated email from the ASF dual-hosted git repository.
desruisseaux pushed a commit to branch geoapi-4.0
in repository https://gitbox.apache.org/repos/asf/sis.git
commit e9ad9cfd5efa5f1f5f1dd8206e0f965fb4d39579
Author: Martin Desruisseaux <ma...@geomatys.com>
AuthorDate: Thu Feb 25 11:26:02 2021 +0100
Replace ≧ by ≥ and ≦ by ≤.
---
.../org/apache/sis/coverage/grid/GridDerivation.java | 10 +++++-----
.../java/org/apache/sis/coverage/grid/GridExtent.java | 2 +-
.../java/org/apache/sis/filter/ComparisonFunction.java | 2 +-
.../java/org/apache/sis/metadata/TreeNodeChildren.java | 2 +-
.../java/org/apache/sis/geometry/GeneralEnvelope.java | 2 +-
.../sis/internal/referencing/WraparoundAdjustment.java | 4 ++--
.../org/apache/sis/referencing/GeodesicsOnEllipsoid.java | 16 ++++++++--------
.../operation/builder/ProjectedTransformTry.java | 4 ++--
.../apache/sis/referencing/GeodeticCalculatorTest.java | 2 +-
.../main/java/org/apache/sis/internal/util/Numerics.java | 2 +-
.../src/main/java/org/apache/sis/math/Fraction.java | 2 +-
.../src/main/java/org/apache/sis/math/Vector.java | 2 +-
.../main/java/org/apache/sis/measure/AngleFormat.java | 12 ++++++------
.../main/java/org/apache/sis/util/ArgumentChecks.java | 4 ++--
.../src/main/java/org/apache/sis/util/ArraysExt.java | 2 +-
.../main/java/org/apache/sis/internal/netcdf/Axis.java | 2 +-
.../org/apache/sis/internal/netcdf/RasterResource.java | 6 +++---
.../java/org/apache/sis/internal/netcdf/Variable.java | 2 +-
18 files changed, 39 insertions(+), 39 deletions(-)
diff --git a/core/sis-feature/src/main/java/org/apache/sis/coverage/grid/GridDerivation.java b/core/sis-feature/src/main/java/org/apache/sis/coverage/grid/GridDerivation.java
index ad9e95b..ea027ae 100644
--- a/core/sis-feature/src/main/java/org/apache/sis/coverage/grid/GridDerivation.java
+++ b/core/sis-feature/src/main/java/org/apache/sis/coverage/grid/GridDerivation.java
@@ -571,10 +571,10 @@ public class GridDerivation {
* The subsampling will be rounded in such a way that the difference in grid size is less than
* one half of cell. Demonstration:
*
- * e = Math.getExponent(span) → 2^e ≦ span
+ * e = Math.getExponent(span) → 2^e ≤ span
* a = e+1 → 2^a > span → 1/2^a < 1/span
* Δs = (s - round(s)) / 2^a
- * (s - round(s)) ≦ 0.5 → Δs ≦ 0.5/2^a < 0.5/span
+ * (s - round(s)) ≤ 0.5 → Δs ≤ 0.5/2^a < 0.5/span
* Δs < 0.5/span → Δs⋅span < 0.5 cell.
*/
if (resolution != null && resolution.length != 0) {
@@ -897,7 +897,7 @@ public class GridDerivation {
* • h₁ the high coordinate before subsampling
* • h₂ the high coordinates after subsampling
* • c a conversion factor from grid indices to "real world" coordinates
- * • s a subsampling ≧ 1
+ * • s a subsampling ≥ 1
*
* Then the envelope upper bounds x is:
*
@@ -908,9 +908,9 @@ public class GridDerivation {
*
* • x = (h₂ + f) × c⋅s where h₂ = floor(h₁/s) and f = ((h₁ mod s) + 1)/s
*
- * Because s ≧ 1, then f ≦ 1. But the f value actually used by GridExtent.toCRS(…) is hard-coded to 1
+ * Because s ≥ 1, then f ≤ 1. But the f value actually used by GridExtent.toCRS(…) is hard-coded to 1
* since it assumes that all cells are whole, i.e. it does not take in account that the last cell may
- * actually be fraction of a cell. Since 1 ≧ f, the computed envelope may be larger. This explains the
+ * actually be fraction of a cell. Since 1 ≥ f, the computed envelope may be larger. This explains the
* need for envelope clipping performed by GridGeometry constructor.
*/
final GridExtent extent = (scaledExtent != null) ? scaledExtent : baseExtent;
diff --git a/core/sis-feature/src/main/java/org/apache/sis/coverage/grid/GridExtent.java b/core/sis-feature/src/main/java/org/apache/sis/coverage/grid/GridExtent.java
index 40696b9..293a864 100644
--- a/core/sis-feature/src/main/java/org/apache/sis/coverage/grid/GridExtent.java
+++ b/core/sis-feature/src/main/java/org/apache/sis/coverage/grid/GridExtent.java
@@ -770,7 +770,7 @@ public class GridExtent implements GridEnvelope, LenientComparable, Serializable
/**
* Returns indices of all dimensions where this grid extent has a size greater than 1.
* This method can be used for getting the grid extent of a <var>s</var>-dimensional slice
- * in a <var>n</var>-dimensional cube where <var>s</var> ≦ <var>n</var>.
+ * in a <var>n</var>-dimensional cube where <var>s</var> ≤ <var>n</var>.
*
* <div class="note"><b>Example:</b>
* suppose that we want to get a two-dimensional slice <var>(y,z)</var> in a four-dimensional data cube <var>(x,y,z,t)</var>.
diff --git a/core/sis-feature/src/main/java/org/apache/sis/filter/ComparisonFunction.java b/core/sis-feature/src/main/java/org/apache/sis/filter/ComparisonFunction.java
index 4183774..6218eeb 100644
--- a/core/sis-feature/src/main/java/org/apache/sis/filter/ComparisonFunction.java
+++ b/core/sis-feature/src/main/java/org/apache/sis/filter/ComparisonFunction.java
@@ -49,7 +49,7 @@ import org.opengis.filter.FilterVisitor;
* Comparison operators between two values. Values are converted to the same type before comparison, using a widening
* conversion (for example from {@link Integer} to {@link Double}). If values can not be compared because they can not
* be converted to a common type, or because a value is null or NaN, then the comparison result if {@code false}.
- * A consequence of this rule is that the conditions {@literal A < B} and {@literal A ≧ B} may be false in same time.
+ * A consequence of this rule is that the conditions {@literal A < B} and {@literal A ≥ B} may be false in same time.
*
* <p>If one operand is a collection, all collection elements may be compared to the other value.
* Null elements in the collection (not to be confused with null operands) are ignored.
diff --git a/core/sis-metadata/src/main/java/org/apache/sis/metadata/TreeNodeChildren.java b/core/sis-metadata/src/main/java/org/apache/sis/metadata/TreeNodeChildren.java
index f4b0a24..0594b12 100644
--- a/core/sis-metadata/src/main/java/org/apache/sis/metadata/TreeNodeChildren.java
+++ b/core/sis-metadata/src/main/java/org/apache/sis/metadata/TreeNodeChildren.java
@@ -271,7 +271,7 @@ final class TreeNodeChildren extends AbstractCollection<TreeTable.Node> {
* We don't cache all elements in order to avoid yet more complex code, and this cover
* the majority of cases where the collection has only one element anyway.
*
- * Note: subIndex is ≧ 0 only if node is an instance of CollectionElement.
+ * Note: subIndex is ≥ 0 only if node is an instance of CollectionElement.
* A ClassCastException below would be a logical error in this class.
*/
if (node == null || ((TreeNode.CollectionElement) node).indexInList != subIndex) {
diff --git a/core/sis-referencing/src/main/java/org/apache/sis/geometry/GeneralEnvelope.java b/core/sis-referencing/src/main/java/org/apache/sis/geometry/GeneralEnvelope.java
index fed4233..e37aeb3 100644
--- a/core/sis-referencing/src/main/java/org/apache/sis/geometry/GeneralEnvelope.java
+++ b/core/sis-referencing/src/main/java/org/apache/sis/geometry/GeneralEnvelope.java
@@ -1078,7 +1078,7 @@ public class GeneralEnvelope extends ArrayEnvelope implements Cloneable, Seriali
}
/**
- * Ensures that <var>lower</var> ≦ <var>upper</var> for every dimensions.
+ * Ensures that <var>lower</var> ≤ <var>upper</var> for every dimensions.
* If a {@linkplain #getUpper(int) upper coordinate value} is less than a
* {@linkplain #getLower(int) lower coordinate value}, then there is a choice:
*
diff --git a/core/sis-referencing/src/main/java/org/apache/sis/internal/referencing/WraparoundAdjustment.java b/core/sis-referencing/src/main/java/org/apache/sis/internal/referencing/WraparoundAdjustment.java
index 016fb34..dcaa9cb 100644
--- a/core/sis-referencing/src/main/java/org/apache/sis/internal/referencing/WraparoundAdjustment.java
+++ b/core/sis-referencing/src/main/java/org/apache/sis/internal/referencing/WraparoundAdjustment.java
@@ -319,11 +319,11 @@ public final class WraparoundAdjustment {
* We need to add an integer amount of `period` to both sides in order to move the range
* inside the valid area. We need ⎣lowerToValidStart⎦ for reaching the point where:
*
- * (validStart - period) < (new lower) ≦ validStart
+ * (validStart - period) < (new lower) ≤ validStart
*
* But we may add more because there will be no intersection without following condition:
*
- * (new upper) ≧ validStart
+ * (new upper) ≥ validStart
*
* That second condition is met by ⎡upperToValidStart⎤. However adding more may cause the
* range to move the AOI completely on the right side of the domain of validity. We prevent
diff --git a/core/sis-referencing/src/main/java/org/apache/sis/referencing/GeodesicsOnEllipsoid.java b/core/sis-referencing/src/main/java/org/apache/sis/referencing/GeodesicsOnEllipsoid.java
index 2fb94d0..79da26f 100644
--- a/core/sis-referencing/src/main/java/org/apache/sis/referencing/GeodesicsOnEllipsoid.java
+++ b/core/sis-referencing/src/main/java/org/apache/sis/referencing/GeodesicsOnEllipsoid.java
@@ -568,10 +568,10 @@ class GeodesicsOnEllipsoid extends GeodeticCalculator {
/*
* The algorithm in this method requires the following canonical configuration:
*
- * Negative latitude of starting point: φ₁ ≦ 0
- * Ending point latitude smaller in magnitude: φ₁ ≦ φ₂ ≦ -φ₁
- * Positive longitude difference: 0 ≦ ∆λ ≦ π
- * (Consequence of above): 0 ≦ α₀ ≦ π/2
+ * Negative latitude of starting point: φ₁ ≤ 0
+ * Ending point latitude smaller in magnitude: φ₁ ≤ φ₂ ≤ -φ₁
+ * Positive longitude difference: 0 ≤ ∆λ ≤ π
+ * (Consequence of above): 0 ≤ α₀ ≤ π/2
*
* If the given points do not met above conditions, then we need to swap start and end points or to
* swap coordinate signs. We apply those changes on local variables only, not on the class fields.
@@ -606,7 +606,7 @@ class GeodesicsOnEllipsoid extends GeodeticCalculator {
* 3) Equatorial case: φ₁ = φ₂ = 0 but restricted to ∆λ ≤ (1-f)⋅π.
* 4) Meridional case: ∆λ = 0 or ∆λ = π (handled by general case in this method).
*/
- if (φ1 > -LATITUDE_THRESHOLD) { // Sufficient test because φ₁ ≦ 0 and |φ₂| ≦ φ₁
+ if (φ1 > -LATITUDE_THRESHOLD) { // Sufficient test because φ₁ ≤ 0 and |φ₂| ≤ φ₁
/*
* Points on equator but not nearly anti-podal. The geodesic is an arc on equator and the azimuths
* are α₁ = α₂ = ±90°. We need this special case because when φ = 0, the general case get sinβ = 0
@@ -646,7 +646,7 @@ class GeodesicsOnEllipsoid extends GeodeticCalculator {
final double β2 = atan2(sinβ2, cosβ2);
final double Δ1 = (1 - axisRatio) * PI * cosβ1; // Differ from Karney by a⋅cosβ₁ factor.
final double y = (β2 + β1) / (Δ1*cosβ1);
- final double x = (PI - Δλ) / Δ1; // Opposite sign of Karney. We have x ≧ 0.
+ final double x = (PI - Δλ) / Δ1; // Opposite sign of Karney. We have x ≥ 0.
final double x2 = x*x;
final double y2 = y*y;
if (STORE_LOCAL_VARIABLES) { // For comparing values with Karney table 4.
@@ -654,7 +654,7 @@ class GeodesicsOnEllipsoid extends GeodeticCalculator {
store("y", y);
}
if (y2 < 1E-12) { // Empirical threshold. See μ(…) for more information.
- α1 = (x2 > 1) ? PI/2 : atan(x / sqrt(1 - x2)); // (Karney 57) with opposite sign of x. Result in α₁ ≧ 0.
+ α1 = (x2 > 1) ? PI/2 : atan(x / sqrt(1 - x2)); // (Karney 57) with opposite sign of x. Result in α₁ ≥ 0.
} else {
final double μ = μ(x2, y2);
α1 = atan2(x*μ, (y*(1+μ))); // (Karney 56) with opposite sign of x.
@@ -762,7 +762,7 @@ class GeodesicsOnEllipsoid extends GeodeticCalculator {
* Special case for α₁ = π/2 and β₂ = ±β₁ (Karney's equation 47). We replace the β₂ = ±β₁
* condition by |β₂| - |β₁| ≈ 0. Assuming tan(θ) ≈ θ for small angles we take the tangent
* of above difference and use tan(β₂ - β₁) = (tanβ₂ - tanβ₁)/(1 + tanβ₂⋅tanβ₁) identity.
- * Note that tanβ₁ ≦ 0 and |tanβ₂| ≦ |tanβ₁| in this method.
+ * Note that tanβ₁ ≤ 0 and |tanβ₂| ≤ |tanβ₁| in this method.
*/
final double dΔλ_dα1;
if (abs(mcosα1) < LATITUDE_THRESHOLD && (-tanβ1 - abs(tanβ2)) < (1 + abs(tanβ1*tanβ2)) * LATITUDE_THRESHOLD) {
diff --git a/core/sis-referencing/src/main/java/org/apache/sis/referencing/operation/builder/ProjectedTransformTry.java b/core/sis-referencing/src/main/java/org/apache/sis/referencing/operation/builder/ProjectedTransformTry.java
index 7d55c78..64e6931 100644
--- a/core/sis-referencing/src/main/java/org/apache/sis/referencing/operation/builder/ProjectedTransformTry.java
+++ b/core/sis-referencing/src/main/java/org/apache/sis/referencing/operation/builder/ProjectedTransformTry.java
@@ -199,7 +199,7 @@ final class ProjectedTransformTry implements Comparable<ProjectedTransformTry>,
* Only arrays at indices given by {@link #projToGrid} will be read; the other arrays will be ignored.
* The coordinate operation result will be stored in arrays of size {@code [numDimensions][numPoints]}
* where {@code numDimensions} is the length of the {@link #projToGrid} array. Indices are as below,
- * with 0 ≦ <var>d</var> ≦ {@code numDimensions}:
+ * with 0 ≤ <var>d</var> ≤ {@code numDimensions}:
*
* <ol>
* <li>{@code results[d]} contains the coordinates in dimension <var>d</var>.</li>
@@ -214,7 +214,7 @@ final class ProjectedTransformTry implements Comparable<ProjectedTransformTry>,
* that queue, for recycling if this method is invoked again for another {@code ProjectedTransformTry} instance.
*
* @param coordinates the {@link LinearTransformBuilder#targets} arrays of coordinates to transform.
- * @param numPoints number of points to transform: {@code numPoints} ≦ {@code coordinates[i].length}.
+ * @param numPoints number of points to transform: {@code numPoints} ≤ {@code coordinates[i].length}.
* @param pool pre-allocated arrays of length {@code numPoints} that can be recycled.
* @return results of coordinate operations (see method javadoc), or {@code null} if an error occurred.
*/
diff --git a/core/sis-referencing/src/test/java/org/apache/sis/referencing/GeodeticCalculatorTest.java b/core/sis-referencing/src/test/java/org/apache/sis/referencing/GeodeticCalculatorTest.java
index e7b62eb..c07459b 100644
--- a/core/sis-referencing/src/test/java/org/apache/sis/referencing/GeodeticCalculatorTest.java
+++ b/core/sis-referencing/src/test/java/org/apache/sis/referencing/GeodeticCalculatorTest.java
@@ -365,7 +365,7 @@ public strictfp class GeodeticCalculatorTest extends TestCase {
assertEquals("Geodesic distance", expected.s12, geodesic, Formulas.LINEAR_TOLERANCE);
assertEquals("Starting azimuth", expected.azi1, c.getStartingAzimuth(), Formulas.ANGULAR_TOLERANCE);
assertEquals("Ending azimuth", expected.azi2, c.getEndingAzimuth(), Formulas.ANGULAR_TOLERANCE);
- assertTrue ("Rhumb ≧ geodesic", rhumbLine >= geodesic);
+ assertTrue ("Rhumb ≥ geodesic", rhumbLine >= geodesic);
if (VERBOSE) {
// Checks the geodesic path on only 10% of test data, because this computation is expensive.
if ((i % 10) == 0) {
diff --git a/core/sis-utility/src/main/java/org/apache/sis/internal/util/Numerics.java b/core/sis-utility/src/main/java/org/apache/sis/internal/util/Numerics.java
index 3f13f62..e8c1863 100644
--- a/core/sis-utility/src/main/java/org/apache/sis/internal/util/Numerics.java
+++ b/core/sis-utility/src/main/java/org/apache/sis/internal/util/Numerics.java
@@ -171,7 +171,7 @@ public final class Numerics extends Static {
* signed value -1 has the same bits pattern than the maximal possible value in unsigned integer representation).</p>
*
* @param bit the bit to set.
- * @return a mask with the given bit set, or 0 if the given argument is negative or ≧ {@value Long#SIZE}.
+ * @return a mask with the given bit set, or 0 if the given argument is negative or ≥ {@value Long#SIZE}.
*/
public static long bitmask(final int bit) {
return (bit >= 0 && bit < Long.SIZE) ? (1L << bit) : 0;
diff --git a/core/sis-utility/src/main/java/org/apache/sis/math/Fraction.java b/core/sis-utility/src/main/java/org/apache/sis/math/Fraction.java
index 99778b9..6e59a67 100644
--- a/core/sis-utility/src/main/java/org/apache/sis/math/Fraction.java
+++ b/core/sis-utility/src/main/java/org/apache/sis/math/Fraction.java
@@ -161,7 +161,7 @@ public final class Fraction extends Number implements Comparable<Fraction>, Seri
* The factor is:
* factor = Bⁿ
*
- * where n is the greatest integer such as factor ≦ toMaximalSignificand.
+ * where n is the greatest integer such as factor ≤ toMaximalSignificand.
*/
final double logMaxFactor = Math.log(toMaximalSignificand);
for (int i=1; i<MathFunctions.PRIMES_LENGTH_16_BITS; i++) {
diff --git a/core/sis-utility/src/main/java/org/apache/sis/math/Vector.java b/core/sis-utility/src/main/java/org/apache/sis/math/Vector.java
index d20bbf9..c0cf85c 100644
--- a/core/sis-utility/src/main/java/org/apache/sis/math/Vector.java
+++ b/core/sis-utility/src/main/java/org/apache/sis/math/Vector.java
@@ -734,7 +734,7 @@ search: for (;;) {
* the [0 … {@link #size()} - 1] range:
*
* <blockquote><code>{@linkplain Math#abs(double) abs}({@linkplain #doubleValue(int) doubleValue}(<var>i</var>)
- * - (doubleValue(0) + increment*<var>i</var>)) ≦ tolerance</code></blockquote>
+ * - (doubleValue(0) + increment*<var>i</var>)) ≤ tolerance</code></blockquote>
*
* The tolerance threshold can be zero if exact matches are desired.
* The return value (if non-null) is always a signed value,
diff --git a/core/sis-utility/src/main/java/org/apache/sis/measure/AngleFormat.java b/core/sis-utility/src/main/java/org/apache/sis/measure/AngleFormat.java
index 2e49157..ae628e4 100644
--- a/core/sis-utility/src/main/java/org/apache/sis/measure/AngleFormat.java
+++ b/core/sis-utility/src/main/java/org/apache/sis/measure/AngleFormat.java
@@ -816,12 +816,12 @@ public class AngleFormat extends Format implements Localized {
* <table class="sis">
* <caption>Selected fields for given precision</caption>
* <tr><th>Precision</th> <th>Fields</th></tr>
- * <tr><td>≧ 1°</td> <td>D°</td></tr>
- * <tr><td>≧ ⅒°</td> <td>D.d°</td></tr>
- * <tr><td>≧ 1′</td> <td>D°MM′</td></tr>
- * <tr><td>≧ ⅒′</td> <td>D°MM.m′</td></tr>
- * <tr><td>≧ 1″</td> <td>D°MM′SS″</td></tr>
- * <tr><td>≧ ⅒″</td> <td>D°MM′SS.s″</td></tr>
+ * <tr><td>≥ 1°</td> <td>D°</td></tr>
+ * <tr><td>≥ ⅒°</td> <td>D.d°</td></tr>
+ * <tr><td>≥ 1′</td> <td>D°MM′</td></tr>
+ * <tr><td>≥ ⅒′</td> <td>D°MM.m′</td></tr>
+ * <tr><td>≥ 1″</td> <td>D°MM′SS″</td></tr>
+ * <tr><td>≥ ⅒″</td> <td>D°MM′SS.s″</td></tr>
* <tr><td>other</td> <td>D°MM′SS.ss…″</td></tr>
* </table>
*
diff --git a/core/sis-utility/src/main/java/org/apache/sis/util/ArgumentChecks.java b/core/sis-utility/src/main/java/org/apache/sis/util/ArgumentChecks.java
index 020424b..c0fc5cc 100644
--- a/core/sis-utility/src/main/java/org/apache/sis/util/ArgumentChecks.java
+++ b/core/sis-utility/src/main/java/org/apache/sis/util/ArgumentChecks.java
@@ -218,7 +218,7 @@ public final class ArgumentChecks extends Static {
* arrays of spatiotemporal dimension indices, where dimensions can not be repeated.
*
* <p>Note that a successful call to {@code ensureNonEmpty(name, values, 0, max, true)} implies
- * 1 ≦ {@code values.length} ≦ {@code max}.</p>
+ * 1 ≤ {@code values.length} ≤ {@code max}.</p>
*
* @param name the name of the argument to be checked. Used only if an exception is thrown.
* @param values integer values to validate.
@@ -240,7 +240,7 @@ public final class ArgumentChecks extends Static {
if (values.length == 0) {
throw new IllegalArgumentException(Errors.format(Errors.Keys.EmptyArgument_1, name));
}
- long found = 0; // Cheap way to check for duplication when (max - min) ≦ 64.
+ long found = 0; // Cheap way to check for duplication when (max - min) ≤ 64.
BitSet more = null; // Used only if above cheap way is not sufficient.
for (int i=0; i<values.length; i++) {
final int index = values[i];
diff --git a/core/sis-utility/src/main/java/org/apache/sis/util/ArraysExt.java b/core/sis-utility/src/main/java/org/apache/sis/util/ArraysExt.java
index 5d924d0..4167311 100644
--- a/core/sis-utility/src/main/java/org/apache/sis/util/ArraysExt.java
+++ b/core/sis-utility/src/main/java/org/apache/sis/util/ArraysExt.java
@@ -1312,7 +1312,7 @@ public final class ArraysExt extends Static {
* <ul>
* <li>If {@code array} is {@code null}, then return {@code false}.</li>
* <li>Otherwise if {@code array} is empty, then return {@code true} for consistency with {@link #range}.</li>
- * <li>Otherwise for any index 0 ≦ <var>i</var> {@literal <} {@code array.length}, if {@code array[i]}
+ * <li>Otherwise for any index 0 ≤ <var>i</var> {@literal <} {@code array.length}, if {@code array[i]}
* is equal to {@code start + i} (computed as if no overflow occurs), then return {@code true}.</li>
* <li>Otherwise return {@code false}.</li>
* </ul>
diff --git a/storage/sis-netcdf/src/main/java/org/apache/sis/internal/netcdf/Axis.java b/storage/sis-netcdf/src/main/java/org/apache/sis/internal/netcdf/Axis.java
index 65020c0..a0f4901 100644
--- a/storage/sis-netcdf/src/main/java/org/apache/sis/internal/netcdf/Axis.java
+++ b/storage/sis-netcdf/src/main/java/org/apache/sis/internal/netcdf/Axis.java
@@ -113,7 +113,7 @@ public final class Axis extends NamedElement {
* metadata property.
*
* <p>A given {@link Grid} should not have two {@code Axis} instances with equal {@code gridDimensionIndices}.
- * When {@code gridDimensionIndices.length} ≧ 2 we may have two {@code Axis} instances with the same indices
+ * When {@code gridDimensionIndices.length} ≥ 2 we may have two {@code Axis} instances with the same indices
* in their {@code gridDimensionIndices} arrays, but those indices should be in different order.</p>
*
* <p>The array length should be equal to {@link Variable#getNumDimensions()}. However this {@code Axis} class
diff --git a/storage/sis-netcdf/src/main/java/org/apache/sis/internal/netcdf/RasterResource.java b/storage/sis-netcdf/src/main/java/org/apache/sis/internal/netcdf/RasterResource.java
index cbd9f76..decd8cf 100644
--- a/storage/sis-netcdf/src/main/java/org/apache/sis/internal/netcdf/RasterResource.java
+++ b/storage/sis-netcdf/src/main/java/org/apache/sis/internal/netcdf/RasterResource.java
@@ -127,7 +127,7 @@ public final class RasterResource extends AbstractGridResource implements Resour
/**
* The netCDF variables for each sample dimensions. The length of this array shall be equal to {@code ranges.length},
- * except if bands are stored as one variable dimension ({@link #bandDimension} ≧ 0) in which case the length shall
+ * except if bands are stored as one variable dimension ({@link #bandDimension} ≥ 0) in which case the length shall
* be exactly 1. Accesses to this array need to take in account that the length may be only 1. Example:
*
* {@preformat java
@@ -173,7 +173,7 @@ public final class RasterResource extends AbstractGridResource implements Resour
* @param name the name for the resource.
* @param grid the grid geometry (size, CRS…) of the {@linkplain #data} cube.
* @param bands the variables providing actual data. Shall contain at least one variable.
- * @param numBands the number of bands. Shall be {@code bands.size()} except if {@code bandsDimension} ≧ 0.
+ * @param numBands the number of bands. Shall be {@code bands.size()} except if {@code bandsDimension} ≥ 0.
* @param bandDim if one of {@link #data} dimension provides values for different bands, that dimension index. Otherwise -1.
* @param lock the lock to use in {@code synchronized(lock)} statements.
*/
@@ -416,7 +416,7 @@ public final class RasterResource extends AbstractGridResource implements Resour
/**
* Returns the variable at the given index. This method can be invoked when the caller has not verified
- * if we are in the special case where all bands are in the same variable ({@link #bandDimension} ≧ 0).
+ * if we are in the special case where all bands are in the same variable ({@link #bandDimension} ≥ 0).
*/
private Variable getVariable(final int i) {
return data[bandDimension >= 0 ? 0 : i];
diff --git a/storage/sis-netcdf/src/main/java/org/apache/sis/internal/netcdf/Variable.java b/storage/sis-netcdf/src/main/java/org/apache/sis/internal/netcdf/Variable.java
index 31c7a2d..07f6626 100644
--- a/storage/sis-netcdf/src/main/java/org/apache/sis/internal/netcdf/Variable.java
+++ b/storage/sis-netcdf/src/main/java/org/apache/sis/internal/netcdf/Variable.java
@@ -779,7 +779,7 @@ public abstract class Variable extends Node {
/**
* Returns the number of sample values between two bands.
- * This method is meaningful only if {@link #bandDimension} ≧ 0.
+ * This method is meaningful only if {@link #bandDimension} ≥ 0.
*/
final long getBandStride() throws IOException, DataStoreException {
long length = 1;