-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfindmin.py
64 lines (56 loc) · 1.09 KB
/
findmin.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
import numpy as np
import netCDF4
import sys
ncfile = sys.argv[1]
nc = netCDF4.Dataset(ncfile, 'r')
v = nc.variables['vice'][70,:,:]
dims = v.shape
#vmin = v[0,0,0]
#imin = 0
#jmin = 0
#kmin = 0
#for k in range(dims[0]):
# for j in range(dims[1]):
# for i in range(dims[2]):
# if (v[k,j,i] < vmin):
# vmin = v[k,j,i]
# imin = i
# jmin = j
# kmin = k
#
#print(imin, jmin, kmin, vmin)
#
#vmax = v[0,0,0]
#imax = 0
#jmax = 0
#kmax = 0
#for k in range(dims[0]):
# for j in range(dims[1]):
# for i in range(dims[2]):
# if (v[k,j,i] > vmax):
# vmax = v[k,j,i]
# imax = i
# jmax = j
# kmax = k
#
#print(imax, jmax, kmax, vmax)
vmin = v[2,400]
imin = 0
jmin = 0
for j in range(dims[0]):
for i in range(dims[1]):
if (not np.isnan(v[j,i]) and v[j,i] < vmin):
vmin = v[j,i]
imin = i
jmin = j
print(imin, jmin, vmin)
vmax = v[2,400]
imax = 0
jmax = 0
for j in range(dims[0]):
for i in range(dims[1]):
if (not np.isnan(v[j,i]) and v[j,i] > vmax):
vmax = v[j,i]
imax = i
jmax = j
print(imax, jmax, vmax)