01: /*
02: * The Unified Mapping Platform (JUMP) is an extensible, interactive GUI
03: * for visualizing and manipulating spatial features with geometry and attributes.
04: *
05: * Copyright (C) 2003 Vivid Solutions
06: *
07: * This program is free software; you can redistribute it and/or
08: * modify it under the terms of the GNU General Public License
09: * as published by the Free Software Foundation; either version 2
10: * of the License, or (at your option) any later version.
11: *
12: * This program is distributed in the hope that it will be useful,
13: * but WITHOUT ANY WARRANTY; without even the implied warranty of
14: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15: * GNU General Public License for more details.
16: *
17: * You should have received a copy of the GNU General Public License
18: * along with this program; if not, write to the Free Software
19: * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
20: *
21: * For more information, contact:
22: *
23: * Vivid Solutions
24: * Suite #1A
25: * 2328 Government Street
26: * Victoria BC V8T 5G5
27: * Canada
28: *
29: * (250)385-6040
30: * www.vividsolutions.com
31: */
32:
33: package com.vividsolutions.jump.util.feature;
34:
35: import java.util.List;
36:
37: import com.vividsolutions.jump.feature.Feature;
38: import com.vividsolutions.jump.feature.FeatureCollection;
39:
40: /**
41: * Computes Feature Statistics for a {@link FeatureCollection}.
42: */
43: public class FeatureStatistics {
44: public static double[] minMaxValue(FeatureCollection fc, String col) {
45: double[] minMax = new double[] { 0.0, 0.0 };
46: int adjDistanceIndex = -1;
47:
48: List features = fc.getFeatures();
49:
50: for (int i = 0; i < features.size(); i++) {
51: Feature f = (Feature) features.get(i);
52:
53: if (adjDistanceIndex == -1) {
54: adjDistanceIndex = f.getSchema().getAttributeIndex(col);
55: }
56:
57: double adjDistance = f.getDouble(adjDistanceIndex);
58:
59: if ((i == 0) || (adjDistance < minMax[0])) {
60: minMax[0] = adjDistance;
61: }
62:
63: if ((i == 0) || (adjDistance > minMax[1])) {
64: minMax[1] = adjDistance;
65: }
66: }
67:
68: return minMax;
69: }
70: }
|