Mercurial > dive4elements > river
comparison flys-artifacts/src/main/java/de/intevation/flys/artifacts/model/WQ.java @ 1190:f514894ec2fd
merged flys-artifacts/2.5
| author | Thomas Arendsen Hein <thomas@intevation.de> |
|---|---|
| date | Fri, 28 Sep 2012 12:14:17 +0200 |
| parents | 821aaceb2776 |
| children | 03fbf1b30e72 |
comparison
equal
deleted
inserted
replaced
| 917:b48c36076e17 | 1190:f514894ec2fd |
|---|---|
| 1 package de.intevation.flys.artifacts.model; | |
| 2 | |
| 3 import gnu.trove.TDoubleArrayList; | |
| 4 | |
| 5 import java.util.Random; | |
| 6 | |
| 7 import org.apache.log4j.Logger; | |
| 8 | |
| 9 public class WQ | |
| 10 extends NamedObjectImpl | |
| 11 { | |
| 12 private static Logger logger = Logger.getLogger(WQ.class); | |
| 13 | |
| 14 // TODO: s/w/ws/g | |
| 15 protected TDoubleArrayList w; | |
| 16 | |
| 17 // TODO: s/q/qs/g | |
| 18 protected TDoubleArrayList q; | |
| 19 | |
| 20 public WQ() { | |
| 21 this(""); | |
| 22 } | |
| 23 | |
| 24 public WQ(String name) { | |
| 25 w = new TDoubleArrayList(); | |
| 26 q = new TDoubleArrayList(); | |
| 27 } | |
| 28 | |
| 29 public WQ(int capacity) { | |
| 30 this(capacity, ""); | |
| 31 } | |
| 32 | |
| 33 | |
| 34 public WQ(int capacity, String name) { | |
| 35 super(name); | |
| 36 w = new TDoubleArrayList(capacity); | |
| 37 q = new TDoubleArrayList(capacity); | |
| 38 } | |
| 39 | |
| 40 public WQ(double [] qs, double [] ws) { | |
| 41 this(qs, ws, ""); | |
| 42 } | |
| 43 | |
| 44 public WQ(double [] qs, double [] ws, String name) { | |
| 45 super(name); | |
| 46 w = new TDoubleArrayList(ws); | |
| 47 q = new TDoubleArrayList(qs); | |
| 48 } | |
| 49 | |
| 50 public void add(double w, double q) { | |
| 51 this.w.add(w); | |
| 52 this.q.add(q); | |
| 53 } | |
| 54 | |
| 55 public int size() { | |
| 56 return w.size(); | |
| 57 } | |
| 58 | |
| 59 public double getW(int idx) { | |
| 60 return w.getQuick(idx); | |
| 61 } | |
| 62 | |
| 63 public double getQ(int idx) { | |
| 64 return q.getQuick(idx); | |
| 65 } | |
| 66 | |
| 67 public double [] get(int idx) { | |
| 68 return get(idx, new double [2]); | |
| 69 } | |
| 70 | |
| 71 public double [] get(int idx, double [] dst) { | |
| 72 dst[0] = w.getQuick(idx); | |
| 73 dst[1] = q.getQuick(idx); | |
| 74 return dst; | |
| 75 } | |
| 76 | |
| 77 public double [] getWs() { | |
| 78 return w.toNativeArray(); | |
| 79 } | |
| 80 | |
| 81 public double [] getQs() { | |
| 82 return q.toNativeArray(); | |
| 83 } | |
| 84 | |
| 85 public static void removeNaNs(TDoubleArrayList [] arrays) { | |
| 86 | |
| 87 int dest = 0; | |
| 88 | |
| 89 int A = arrays.length; | |
| 90 int N = arrays[0].size(); | |
| 91 | |
| 92 OUTER: for (int i = 0; i < N; ++i) { | |
| 93 for (int j = 0; j < A; ++j) { | |
| 94 TDoubleArrayList a = arrays[j]; | |
| 95 double v = a.getQuick(i); | |
| 96 if (Double.isNaN(v)) { | |
| 97 continue OUTER; | |
| 98 } | |
| 99 a.setQuick(dest, v); | |
| 100 } | |
| 101 ++dest; | |
| 102 } | |
| 103 | |
| 104 if (dest < N) { | |
| 105 for (int i = 0; i < A; ++i) { | |
| 106 arrays[i].remove(dest, N-dest); | |
| 107 } | |
| 108 } | |
| 109 } | |
| 110 | |
| 111 public void removeNaNs() { | |
| 112 removeNaNs(new TDoubleArrayList [] { w, q }); | |
| 113 } | |
| 114 | |
| 115 public boolean guessWaterIncreasing() { | |
| 116 return guessWaterIncreasing(0.05f); | |
| 117 } | |
| 118 | |
| 119 public boolean guessWaterIncreasing(float factor) { | |
| 120 | |
| 121 int N = w.size(); | |
| 122 if (N < 2) return false; | |
| 123 | |
| 124 int samples = (int)(factor*N) + 1; | |
| 125 | |
| 126 int up = 0; | |
| 127 | |
| 128 Random rand = new Random(); | |
| 129 | |
| 130 for (int i = 0; i < samples; ++i) { | |
| 131 int pos2 = rand.nextInt(N-1) + 1; | |
| 132 if (pos2 == 0) continue; | |
| 133 int pos1 = rand.nextInt(pos2); | |
| 134 double w1 = w.getQuick(pos1); | |
| 135 double w2 = w.getQuick(pos2); | |
| 136 if (w2 > w1) ++up; | |
| 137 } | |
| 138 | |
| 139 return up > samples/2; | |
| 140 } | |
| 141 | |
| 142 public int [] longestIncreasingWRangeIndices() { | |
| 143 return longestIncreasingWRangeIndices(new int[2]); | |
| 144 } | |
| 145 | |
| 146 public int [] longestIncreasingWRangeIndices(int [] bounds) { | |
| 147 | |
| 148 int N = size(); | |
| 149 int start = 0; | |
| 150 int stop = 0; | |
| 151 | |
| 152 double lastW = Double.MAX_VALUE; | |
| 153 | |
| 154 for (int i = 0; i < N; ++i) { | |
| 155 double v = w.getQuick(i); | |
| 156 if (v <= lastW) { | |
| 157 if (stop-start > bounds[1]-bounds[0]) { | |
| 158 bounds[0] = start; | |
| 159 bounds[1] = stop; | |
| 160 if (logger.isDebugEnabled()) { | |
| 161 logger.debug("new range: " + | |
| 162 bounds[0] + " - " + bounds[1] + " (" + | |
| 163 w.getQuick(bounds[0]) + ", " + | |
| 164 w.getQuick(bounds[1]) + ")"); | |
| 165 | |
| 166 } | |
| 167 } | |
| 168 start = stop = i; | |
| 169 } | |
| 170 else { | |
| 171 stop = i; | |
| 172 } | |
| 173 lastW = v; | |
| 174 } | |
| 175 | |
| 176 if (stop-start > bounds[1]-bounds[0]) { | |
| 177 bounds[0] = start; | |
| 178 bounds[1] = stop; | |
| 179 if (logger.isDebugEnabled()) { | |
| 180 logger.debug("new range @end: " + | |
| 181 bounds[0] + " - " + bounds[1] + " (" + | |
| 182 w.getQuick(bounds[0]) + ", " + | |
| 183 w.getQuick(bounds[1]) + ")"); | |
| 184 | |
| 185 } | |
| 186 } | |
| 187 | |
| 188 return bounds; | |
| 189 } | |
| 190 } | |
| 191 // vim:set ts=4 sw=4 si et sta sts=4 fenc=utf8 : |