-
Notifications
You must be signed in to change notification settings - Fork 1
/
sources.py
581 lines (442 loc) · 17.9 KB
/
sources.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
import logging
from dataclasses import dataclass
from typing import List, Any, Dict
import toml
import numpy as np
import xarray as xr
import rioxarray as _
import pandas as pd
from pyproj.crs import CRS
from functools import cache
from pykdtree.kdtree import KDTree
from .vector import rotate_vectors
logger = logging.getLogger(__name__)
def setup_variable(var, target, time, dtype=np.float32, attrs=None):
"""
Set up variable
"""
time = np.atleast_1d(time)
if target.grid_id is None:
shape = (len(time), len(target.y), len(target.x))
dims = ('time', 'Y', 'X')
coords = {'time': time, 'Y': target.y, 'X': target.x}
else:
shape = (len(time), len(target.grid_id))
dims = ('time', 'grid_id')
coords = {'time': time, 'grid_id': target.grid_id}
vo = np.full(shape, np.nan, dtype=dtype)
vo = xr.DataArray(vo, dims=dims, coords=coords, attrs=attrs, name=var)
vo.attrs['grid_mapping'] = target.proj_name
return vo
class Dataset:
name: str
url: str
variables: Dict
ds: xr.Dataset
# name of x and y vars
x_v: str
y_v: str
x: np.ndarray
y: np.ndarray
kdtree: Any
def __init__(self, name, url, x, y, variables, proj4=None):
self.name = name
self.url = url
self.variables = variables
self.x_v = x
self.y_v = y
logger.info(
f'{self.name}: opening: {self.url} for variables: {self.variables}'
)
if '*' in url or type(url) is list:
self.ds = xr.decode_cf(
xr.open_mfdataset(
url,
decode_coords='all',
parallel=False,
# engine='hidefix',
chunks='auto'))
else:
self.ds = xr.decode_cf(xr.open_dataset(url, decode_coords='all'))
if x != 'X':
# self.ds = self.ds.rename_dims({self.x_v: 'X'})
self.ds = self.ds.rename_vars({self.x_v: 'X'})
if y != 'Y':
# self.ds = self.ds.rename_dims({self.y_v: 'Y'})
self.ds = self.ds.rename_vars({self.y_v: 'Y'})
self.x = self.ds['X'].values
self.y = self.ds['Y'].values
self.dx = np.median(np.diff(self.x))
self.dy = np.median(np.diff(self.y))
self.xmin, self.xmax = self.x.min(), self.x.max()
self.ymin, self.ymax = self.y.min(), self.y.max()
if not all(np.abs(np.diff(self.x) - self.dx) < 1e-3):
logger.error(
f'X coordinate not monotonic, max deviation from dx: {np.max(np.diff(self.x)-self.dx)}'
)
if not all(np.abs(np.diff(self.y) - self.dy) < 1e-3):
logger.error(
f'Y coordinate not monotonic, max deviation from dy: {np.max(np.diff(self.y)-self.dy)}'
)
logger.debug(
f'x: {self.x.shape} / {self.dx}, y: {self.y.shape} / {self.dy}')
logger.debug(
f'x: {self.x.min()} -> {self.x.max()}, y: {self.y.min()} -> {self.y.max()}'
)
dt = (self.ds.time.values[1] -
self.ds.time.values[0]) / np.timedelta64(1, 'h')
logger.info(
f'time: {self.ds.time.values[0]} -> {self.ds.time.values[-1]} (dt: {dt} h)'
)
if proj4 is not None:
self.crs = CRS.from_proj4(proj4)
else:
self.crs = self.ds.rio.crs
logger.debug(f'CRS: {self.crs}')
def __repr__(self):
return f'<Dataset ({self.name} / {self.url})>'
@cache
def __interpolate_nearest_valid_grid__(self, target, var: str, timei=-1, max_dist=100.e3):
"""
Find the closest point with a value regardless of how far away the point
is from a valid point. E.g. a point in the middle of land will get its
value from the closest ocean point.
"""
logger.debug(
f'Finding nearest valid grid points (with data) for _all_ target points in {var}..'
)
target_x, target_y, inbounds = self.__calculate_grid__(target)
sh = target_x.shape
# Find valid points in this dataset.
var = self.ds[var]
var = self.__reduce_dimensions__(var)
var = var.isel(
time=timei
) # XXX: This whole algorithm will fail if somehow the valid points change with the time dimension, and that is not accounted for.
valid = np.isfinite(var.values)
assert valid.any(
), "No points with a value in last timestep for entire {var.name}, probably trouble with input data file."
assert len(valid.shape) == 2
assert len(var.X.values.shape) == 1
assert len(var.Y.values.shape) == 1
yi, xi = np.nonzero(valid)
logger.debug(f'Valid points: {len(xi)} of {len(valid.ravel())}')
x = var.X.values[xi]
y = var.Y.values[yi]
# Build a KDTree with valid points, and move the target points to nearest.
t = KDTree(np.vstack((y, x)).T)
t_points = np.vstack((target_y.ravel(), target_x.ravel())).T
t_points = t_points.astype(x.dtype)
assert t_points.shape[1] == 2
dist, idx = t.query(t_points, k=1) # New targets.
t_xn = x[idx]
t_yn = y[idx]
# Indexes of nearest valid points.
assert xi.shape == x.shape
assert yi.shape == y.shape
ti_xn = xi[idx]
ti_yn = yi[idx]
assert t_points.shape[0] == target_x.ravel().shape[0]
assert t_points.shape[0] == t_yn.shape[0]
assert t_points.shape[0] == t_xn.shape[0]
t_xn.shape = sh
t_yn.shape = sh
ti_xn.shape = sh
ti_yn.shape = sh
assert t_xn.shape == t_yn.shape
assert ti_xn.shape == t_yn.shape
inbounds = dist<=max_dist
return t_xn, t_yn, ti_xn, ti_yn, inbounds
@cache
def __calculate_grid__(self, target):
logger.debug(f'Calculating grid for target: {target.xx.shape}..')
# Calculating the location of the target grid cells
# in this datasets coordinate system.
target_x, target_y = target.itransform(self.crs, target.xx.ravel(),
target.yy.ravel())
assert len(target_x) > 0
target_x.shape = target.xx.shape
target_y.shape = target.yy.shape
# Target coordinates within source domain
inbounds = (target_x >= self.xmin) & (target_x < self.xmax) & (
target_y >= self.ymin) & (target_y < self.ymax)
return target_x, target_y, inbounds
def __map_to_index__(self, x, y):
"""
Map x and y coordinate to index in X and Y.
"""
if len(x) == 0 and len(y) == 0:
return x, y
assert self.xmin == self.x.min()
assert self.ymin == self.y.min()
assert x.ravel().min() >= self.xmin
assert y.ravel().min() >= self.ymin
if self.dx > 0:
x = x - self.xmin
else:
x = x - self.xmax
if self.dy > 0:
y = y - self.ymin
else:
y = y - self.ymax
txi = np.round(x / self.dx).astype(int)
tyi = np.round(y / self.dy).astype(int)
assert txi.ravel().min() >= 0 and txi.ravel().max() <= len(self.x)
assert tyi.ravel().min() >= 0 and tyi.ravel().max() <= len(self.y)
return txi, tyi
def __reduce_dimensions__(self, var):
"""
Reduce the dimensions of a variable (i.e. select first ensemble member, surface elevation or depth.)
"""
logger.debug(f'Reducing dimensions for {var.name}..')
if 'depth' in var.dims:
var = var.sel(depth=0)
if 'height' in var.dims:
var = var.isel(height=0)
if 'height0' in var.dims:
var = var.isel(height0=0)
if 'height1' in var.dims:
var = var.isel(height1=0)
if 'height2' in var.dims:
var = var.isel(height2=0)
if 'height3' in var.dims:
var = var.isel(height3=0)
if 'height4' in var.dims:
var = var.isel(height4=0)
if 'height5' in var.dims:
var = var.isel(height5=0)
if 'height6' in var.dims:
var = var.isel(height6=0)
if 'height7' in var.dims:
var = var.isel(height7=0)
if 'ensemble_member' in var.dims:
var = var.isel(ensemble_member=0)
return var
def __time_nearest__(self, tp):
"""
Find nearest index of time points.
Args:
xp M vector of time stamps
Returns:
ti Vector of indices.
"""
time = self.ds.time.values
ti = np.abs(time[:,None] - tp[None,:])
assert ti.shape == (len(time), len(tp))
ti = np.argmin(ti, axis=0)
assert ti.shape == (len(tp),)
dt = (self.ds.time.values[1] -
self.ds.time.values[0]) / np.timedelta64(1, 'h')
dtii = np.max(np.abs(time[ti] - tp)) / np.timedelta64(1, 'h')
if dtii >= 2 * dt:
logger.error(f"Time points more than two time-steps away from target values: 2*{dt=} < max(dti)={dtii}.")
return ti
def regrid(self, var, target, time, always_nearest=False):
"""
Return values for the target grid.
"""
if not isinstance(time, pd.DatetimeIndex):
time = pd.to_datetime(time).to_datetime64()
time = np.atleast_1d(time)
logger.info(
f'Regridding {var.name} between {np.min(time)} and {np.max(time)}')
if np.min(time) > var.time[-1] or np.max(time) < var.time[0]:
logger.warning(
'Target time is outside the time span of this reader')
return None
# Calculate invalid time steps before selecting time.
invalid = (time > var.time.values.max()) | (time <
var.time.values.min())
if np.any(invalid):
logger.warning(f'Target-time [{np.sum(invalid)}/{len(invalid)} steps] is outside the time-domain of the dataset.')
logger.debug('Selecting time slice..')
ti = self.__time_nearest__(time[~invalid])
assert len(ti) == np.sum(~invalid)
var = var.isel(time=ti)
var = self.__reduce_dimensions__(var)
shape = list(var.shape)[:-2] + list(target.xx.shape)
shape = tuple(shape)
logger.debug(f'New shape: {shape} ({target.xx.shape=})')
vd = np.full(shape, np.nan, dtype=var.dtype)
if not always_nearest:
target_x, target_y, inbounds = self.__calculate_grid__(target)
tx, ty = self.__map_to_index__(target_x[inbounds],
target_y[inbounds])
if not any(inbounds.ravel()):
logger.warning('Target is outside the domain of this reader')
return None
# Extract block
x0 = np.min(tx)
x1 = np.max(tx) + 1
y0 = np.min(ty)
y1 = np.max(ty) + 1
# Shifted indices to block.
tx = tx - x0
ty = ty - y1
assert y1 > y0
assert x1 > x0
block = var.isel({
self.x_v: slice(x0, x1),
self.y_v: slice(y0, y1)
}).load()
logger.debug(f'Extracting values from block: {block.shape=}')
vd[..., inbounds] = block.values[..., ty.ravel(), tx.ravel()]
else:
# we must loop over time, because the valid grid cells may change in each time step (e.g. due to sea ice)
assert shape[0] == len(ti), "expected time dimension to be first"
logger.info(
f'Load block for {len(time)} time steps'
)
for tii in ti:
target_x, target_y, tx, ty, inbounds = self.__interpolate_nearest_valid_grid__(
target, var.name, tii)
if not any(inbounds.ravel()):
logger.warning('Target is outside the domain of this reader')
return None
# Extract block
x0 = np.min(tx)
x1 = np.max(tx) + 1
y0 = np.min(ty)
y1 = np.max(ty) + 1
# Shifted indices to block.
tx = tx - x0
ty = ty - y1
assert y1 > y0
assert x1 > x0
block = var.isel({
'time' : tii-ti[0],
self.x_v: slice(x0, x1),
self.y_v: slice(y0, y1)
}).load()
assert len(block.shape) == len(vd.shape)
logger.debug(f'Extracting values from block using nearest valid point: {block.shape=}')
vd[tii-ti[0], ..., inbounds] = block.values[..., ty.ravel(), tx.ravel()]
# Construct new variable and fill with data.
vo = setup_variable(var.name, target, time, var.dtype, var.attrs)
vo.values[~invalid, ...] = vd
vo.attrs['source'] = self.url
vo.attrs['source_name'] = self.name
return vo
def rotate_vectors(self, vx, vy, target):
x, y, _ = self.__calculate_grid__(target)
vox, voy = rotate_vectors(x, y, vx.values, vy.values, self.crs,
target.crs)
vx.values = vox
vy.values = voy
return vx, vy
def get_var(self, var):
"""
Return variable name for input variable.
"""
logger.debug(f'Looking for {var} in {self}')
return self.variables.get(var, None)
@dataclass
class Sources:
scalar_variables: List[str]
derived_variables: Dict
fallback: Dict
vector_magnitude_variables: Dict
datasets: List[Dataset]
def find_dataset_for_var(self, var):
"""
Find first dataset with variable.
"""
for d in self.datasets:
v = d.get_var(var)
if v is not None:
return (d, d.ds[v])
return (None, None)
def find_dataset_for_var_pair(self, var1, var2):
"""
Find first dataset with both variables.
"""
for d in self.datasets:
logger.debug(f'Looking for {var1} and {var2} in {d}')
var1 = d.get_var(var1)
var2 = d.get_var(var2)
if var1 is not None and var2 is not None:
return (d, d.ds[var1], d.ds[var2])
return (None, None, None)
def regrid(self, var, target, time, always_nearest=False):
"""
Search through datasets and try to cover the entire target grid with data.
"""
vo = None
for d in self.datasets:
v = d.get_var(var)
if v is not None:
logger.info(f'Found {var} in {d}..')
v = d.ds[v]
vod = d.regrid(v, target, time, always_nearest)
if vod is not None:
if vo is None:
vo = vod
else:
assert vo.shape == vod.shape
td = np.isnan(vo.values) & ~np.isnan(vod.values)
logger.info(
f'Merging {len(td[td])} values into output variable: {vo.shape}'
)
vo.values[td] = vod.values[td]
else:
logger.debug(f'{var} completely out of domain of {d}.')
if vo is not None and not np.isnan(vo).any():
logger.debug(f'{var} completely covered.')
break
if vo is None:
logger.debug(f'Variable {var} empty, filling with NaN.')
vo = setup_variable(var, target, time)
if var in self.fallback:
logger.debug(f'{var}: setting fallback to: {self.fallback[var]}')
vo.values[np.isnan(vo.values)] = self.fallback[var]
return vo
@staticmethod
def from_toml(file, dataset_filter=(), variable_filter=()):
logger.info(f'Loading sources from {file}')
d = toml.load(open(file))
datasets = []
for name, ds in d['datasets'].items():
if len(dataset_filter) > 0:
if not any(map(lambda f: f in name, dataset_filter)):
continue
dataset = Dataset(name=name, **ds)
datasets.append(dataset)
scalar_vars = d['scalar_variables']
derived_vars = d['derived_variables']
fallback = d.get('fallback', {})
vector_mag_vars = d['vector_magnitude_variables']
if len(variable_filter) > 0:
logger.debug(
f'Filtering scalar variables: {scalar_vars} | {variable_filter}'
)
scalar_vars = list(
filter(lambda v: any(map(lambda f: f in v, variable_filter)),
scalar_vars))
logger.debug(f'New scalar variables: {scalar_vars}.')
logger.debug(
f'Filtering vector variables: {vector_mag_vars.keys()} | {variable_filter}'
)
fvector_mag_vars = list(
filter(lambda v: any(map(lambda f: f in v, variable_filter)),
vector_mag_vars))
new_v_m = dict()
for k in fvector_mag_vars:
new_v_m[k] = vector_mag_vars[k]
vector_mag_vars = new_v_m
logger.debug(f'New vector variables: {vector_mag_vars}.')
logger.debug(
f'Filtering derived variables: {derived_vars.keys()} | {variable_filter}'
)
fderived_vars = list(
filter(lambda v: any(map(lambda f: f in v, variable_filter)),
derived_vars))
new_d_v = dict()
for k in fderived_vars:
new_d_v[k] = derived_vars[k]
derived_vars = new_d_v
logger.debug(f'New derived variables: {derived_vars}.')
return Sources(scalar_variables=scalar_vars,
vector_magnitude_variables=vector_mag_vars,
derived_variables=derived_vars,
datasets=datasets,
fallback=fallback)