private void findBounds() { if (lonMinMax != null) return; lonEdge = lonCoord.getEdges(); latEdge = latCoord.getEdges(); // assume missing values have been converted to NaNs latMinMax = MAMath.getMinMax(latEdge); lonMinMax = MAMath.getMinMax(lonEdge); if (debug) System.out.printf("Bounds (%d %d): lat= (%f,%f) lon = (%f,%f) %n", nrows, ncols, latMinMax.min, latMinMax.max, lonMinMax.min, lonMinMax.max); }
private void init() { try { Array data = read(); minmax = MAMath.getMinMax(data); } catch (IOException ioe) { log.error("Error reading coordinate values ", ioe); throw new IllegalStateException(ioe); } }
private void init() { try { Array data = read(); minmax = MAMath.getMinMax(data); } catch (IOException ioe) { log.error("Error reading coordinate values ", ioe); throw new IllegalStateException(ioe); } }
private void findBounds() { if (lonMinMax != null) return; lonEdge = lonCoord.getXEdges(); latEdge = latCoord.getYEdges(); // assume missing values have been converted to NaNs latMinMax = MAMath.getMinMax(latEdge); lonMinMax = MAMath.getMinMax(lonEdge); if (debug) System.out.printf("Bounds (%d %d): lat= (%f,%f) lon = (%f,%f) %n", nrows, ncols, latMinMax.min, latMinMax.max, lonMinMax.min, lonMinMax.max); }
private void findBounds() { if (lonMinMax != null) return; lonEdge = lonCoord.getEdges(); latEdge = latCoord.getEdges(); // assume missing values have been converted to NaNs latMinMax = MAMath.getMinMax(latEdge); lonMinMax = MAMath.getMinMax(lonEdge); if (debug) System.out.printf("Bounds (%d %d): lat= (%f,%f) lon = (%f,%f) %n", nrows, ncols, latMinMax.min, latMinMax.max, lonMinMax.min, lonMinMax.max); }
private void init() { try { Array data = read(); minmax = MAMath.getMinMax(data); } catch (IOException ioe) { log.error("Error reading coordinate values ", ioe); throw new IllegalStateException(ioe); } }
private void findBounds() { if (lonMinMax != null) return; lonEdge = lonCoord.getXEdges(); latEdge = latCoord.getYEdges(); // assume missing values have been converted to NaNs latMinMax = MAMath.getMinMax(latEdge); lonMinMax = MAMath.getMinMax(lonEdge); if (debug) System.out.printf("Bounds (%d %d): lat= (%f,%f) lon = (%f,%f) %n", nrows, ncols, latMinMax.min, latMinMax.max, lonMinMax.min, lonMinMax.max); }
public MAMath.MinMax getMinMaxData(float[] data) { int[] shape = new int[1]; shape[0] = data.length; Array a = Array.factory(DataType.FLOAT, shape, data); return MAMath.getMinMax(a); }
public MAMath.MinMax getMinMaxData( float[] data) { int[] shape = new int[1]; shape[0] = data.length; Array a = Array.factory( DataType.FLOAT.getPrimitiveClassType(), shape, data); return MAMath.getMinMax( a); } int getGateDimsIndex(int cell, Dimension [] dList, int numSensor)
public MAMath.MinMax getMinMaxData( float[] data) { int[] shape = new int[1]; shape[0] = data.length; Array a = Array.factory( DataType.FLOAT.getPrimitiveClassType(), shape, data); return MAMath.getMinMax( a); } int getGateDimsIndex(int cell, Dimension [] dList, int numSensor)
Edges() { latEdge = (ArrayDouble.D2) latAxis2D.getCoordBoundsAsArray(); lonEdge = (ArrayDouble.D2) lonAxis2D.getCoordBoundsAsArray(); // assume missing values have been converted to NaNs latMinMax = MAMath.getMinMax(latEdge); lonMinMax = MAMath.getMinMax(lonEdge); // normalize to [minLon,minLon+360] int nlons = (int) lonEdge.getSize(); for (int i = 0; i < nlons; i++) { double nonVal = lonEdge.getDouble(i); lonEdge.setDouble(i, LatLonPointImpl.lonNormalFrom(nonVal, lonMinMax.min)); } if (debug) System.out.printf("Bounds (%d %d): lat= (%f,%f) lon = (%f,%f) %n", nrows, ncols, latMinMax.min, latMinMax.max, lonMinMax.min, lonMinMax.max); }
public static MAMath.MinMax getMinMaxSkipMissingData(Array a, IsMissingEvaluator eval) { if (!eval.hasMissing()) return MAMath.getMinMax(a); IndexIterator iter = a.getIndexIterator(); double max = -Double.MAX_VALUE; double min = Double.MAX_VALUE; while (iter.hasNext()) { double val = iter.getDoubleNext(); if (eval.isMissing(val)) continue; if (val > max) max = val; if (val < min) min = val; } return new MAMath.MinMax(min, max); }
public static MAMath.MinMax getMinMaxSkipMissingData(Array a, IsMissingEvaluator eval) { if (eval == null || !eval.hasMissing()) return MAMath.getMinMax(a); IndexIterator iter = a.getIndexIterator(); double max = -Double.MAX_VALUE; double min = Double.MAX_VALUE; while (iter.hasNext()) { double val = iter.getDoubleNext(); if (eval.isMissing(val)) continue; if (val > max) max = val; if (val < min) min = val; } return new MAMath.MinMax(min, max); }
public static MAMath.MinMax getMinMaxSkipMissingData(Array a, IsMissingEvaluator eval) { if (!eval.hasMissing()) return MAMath.getMinMax(a); IndexIterator iter = a.getIndexIterator(); double max = -Double.MAX_VALUE; double min = Double.MAX_VALUE; while (iter.hasNext()) { double val = iter.getDoubleNext(); if (eval.isMissing(val)) continue; if (val > max) max = val; if (val < min) min = val; } return new MAMath.MinMax(min, max); }
MAMath.MinMax minmax = MAMath.getMinMax( timeData);
MAMath.MinMax minmax = MAMath.getMinMax( timeData);
MAMath.MinMax minmax = MAMath.getMinMax( timeData);
MAMath.MinMax minmax = MAMath.getMinMax( timeData);
MAMath.MinMax minmax = MAMath.getMinMax( timeData);