Skip to content
Snippets Groups Projects
Commit dffb6e10 authored by tomrink's avatar tomrink
Browse files

snapshot...

parent 78084a92
No related branches found
No related tags found
No related merge requests found
...@@ -473,9 +473,9 @@ def run_best_fit_all(): ...@@ -473,9 +473,9 @@ def run_best_fit_all():
prd_dct = get_product_at_locs(m_d, ts, prd_files) prd_dct = get_product_at_locs(m_d, ts, prd_files)
out_list.append((bf_dct, prd_dct)) out_list.append((bf_dct, prd_dct))
amvs = get_amvs(amv_files, ts) # amvs = get_amvs(amv_files, ts)
bfs = run_best_fit_gfs(amvs, gfs_dir+gfs_files[k], amv_lat_idx=0, amv_lon_idx=1, amv_prs_idx=4, amv_spd_idx=5, amv_dir_idx=6) # bfs = run_best_fit_gfs(amvs, gfs_dir+gfs_files[k], amv_lat_idx=0, amv_lon_idx=1, amv_prs_idx=4, amv_spd_idx=5, amv_dir_idx=6)
out_list.append((amvs, np.array(bfs))) # out_list.append((amvs, np.array(bfs)))
return out_list return out_list
...@@ -1037,15 +1037,36 @@ def compare_amvs_bestfit_all(all_list, bin_size=200): ...@@ -1037,15 +1037,36 @@ def compare_amvs_bestfit_all(all_list, bin_size=200):
amvs_list = [] amvs_list = []
bfs_list = [] bfs_list = []
for dct in all_list: prd_list = []
keys = list(dct.keys()) for tup in all_list:
ab_dct = tup[0]
pr_dct = tup[1]
keys = list(ab_dct.keys())
for key in keys: for key in keys:
tup = dct.get(key) tup = ab_dct.get(key)
amvs_list.append(tup[0]) amvs_list.append(tup[0])
bfs_list.append(tup[1]) bfs_list.append(tup[1])
keys = list(pr_dct.keys())
for key in keys:
prd_list.append(pr_dct.get(key))
# amvs_list = []
# bfs_list = []
# for dct in all_list:
# keys = list(dct.keys())
# for key in keys:
# tup = dct.get(key)
# amvs_list.append(tup[0])
# bfs_list.append(tup[1])
amvs = np.concatenate(amvs_list) amvs = np.concatenate(amvs_list)
bfs = np.concatenate(bfs_list) bfs = np.concatenate(bfs_list)
prd = np.concatenate(prd_list)
print(amvs.shape, bfs.shape, prd.shape)
# for tup in all_list: # for tup in all_list:
# amvs_list.append(tup[0]) # amvs_list.append(tup[0])
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment