def dst_dir_report(jobs, dstdirs, width, prefix=''):
tab = tt.Texttable()
dir2oldphase = manager.dstdirs_to_furthest_phase(jobs)
dir2newphase = manager.dstdirs_to_youngest_phase(jobs)
headings = ['dst', 'plots', 'GBfree', 'inbnd phases', 'pri']
tab.header(headings)
tab.set_cols_dtype('t' * len(headings))
for d in sorted(dstdirs):
# TODO: This logic is replicated in archive.py's priority computation,
# maybe by moving more of the logic in to directory.py
eldest_ph = dir2oldphase.get(d, job.Phase(0, 0))
phases = job.job_phases_for_dstdir(d, jobs)
dir_plots = plot_util.list_k32_plots(d)
gb_free = int(plot_util.df_b(d) / plot_util.GB)
n_plots = len(dir_plots)
priority = archive.compute_priority(eldest_ph, gb_free, n_plots)
row = [
abbr_path(d, prefix), n_plots, gb_free,
phases_str(phases, 5), priority
]
tab.add_row(row)
tab.set_max_width(width)
tab.set_deco(tt.Texttable.BORDER | tt.Texttable.HEADER)
tab.set_deco(0) # No borders
return tab.draw()
def test_compute_priority():
assert (archive.compute_priority(
(3, 1), 1000, 10) > archive.compute_priority((3, 6), 1000, 10))
def test_compute_priority() -> None:
assert (archive.compute_priority(job.Phase(major=3, minor=1), 1000, 10) >
archive.compute_priority(job.Phase(major=3, minor=6), 1000, 10))
