awips2/edexOsgi/com.raytheon.edex.plugin.gfe/utility/common_static/base/gfe/vcmodule/iscmint.py
root 8e80217e59 Initial revision of AWIPS2 11.9.0-7p5
Former-commit-id: a02aeb236c [formerly 9f19e3f712] [formerly 06a8b51d6d [formerly 64fa9254b946eae7e61bbc3f513b7c3696c4f54f]]
Former-commit-id: 06a8b51d6d
Former-commit-id: 3360eb6c5f
2012-01-06 08:55:05 -06:00

94 lines
2.9 KiB
Python

# -*-python-*-
import time
from numpy import *
SCALAR = 'Scalar'
VECTOR = 'Vector'
WEATHER = 'Weather'
DISCRETE = 'Discrete'
YES = True
NO = False
class VCParm:
def splitTR(self, tr, inv):
for btr in inv:
if self._overlaps(btr, tr):
if self._containsTR(btr, tr):
return []
else:
splitlst = []
if not self._contains(btr, tr[0]):
splitlst = splitlst + self.splitTR((tr[0], btr[0]),
inv)
if not self._contains(btr, tr[1]):
splitlst = splitlst + self.splitTR((btr[1], tr[1]),
inv)
return splitlst
return [tr]
def tcmp(self, t1, t2):
return cmp(t1[0], t2[0])
def getInventory(self, MinT, MinT_ISC):
# all Fcst grids get included if they overlap an ISC grid
# list is returned in ascending time
rval = []
for tr in MinT:
lst = []
for itr in MinT_ISC:
if self._overlaps(tr, itr):
lst.append(itr)
if len(lst):
rval.append((tr, [tr], lst))
return rval
# returns the percentage of tr1 that overlaps tr2
def poverlap(self, tr1, tr2):
itr = self._intersect(tr1, tr2)
return (itr[1] - itr[0]) / float(tr1[1] - tr1[0])
def calcGrid(self, MinT, MinT_ISC):
# If getInventory() works right
# we either get 0 or 1 MinT grids.
# And if 0 then only 1 MinT_ISC
# [(intr, grid, mask), ...]
if len(MinT) == 0:
return MinT_ISC[0][1]
#max value for this parm
maxV = self.getWEInfo()[0][4]
rval = where(MinT_ISC[0][2], MinT_ISC[0][1], maxV)
for i in MinT_ISC:
rval = where(i[2], minimum(i[1], rval), rval)
return rval
def calcHistory(self, MinT_ISC):
rval = []
for t in MinT_ISC:
for i in t[1]:
rval.append(i)
return rval
def getWEInfo(self):
return (("MinT", SCALAR,"F","Minimum Temperature",120.0, -60.0, 0, NO),
("ISC", "V"), (3600, 3600, 0))
def _containsTR(self, tr1, tr2):
if tr1 == tr2:
return True
return self._contains(tr1, tr2[0]) and self._contains(tr1, tr2[1])
def _contains(self, timerange, time):
if timerange[1] - timerange[0]:
return ((time >= timerange[0]) and (time < timerange[1]))
return time == timerange[0]
def _overlaps(self, tr1, tr2):
if self._contains(tr2, tr1[0]) or self._contains(tr1, tr2[0]):
return True
return False
def _intersect(self, t1, t2):
if self._overlaps(t1, t2):
return (max(t1[0], t2[0]), min(t1[1], t2[1]))
return None