chn/nixos
1
0
Fork 0
mirror of https://github.com/CHN-beta/nixos.git synced 2024-10-23 05:18:44 +08:00
Code Issues Packages Projects Releases Wiki Activity

Revert "localPackages.hpcstat: no need to get size of directories if total size is less than 80% of disk size"

Browse Source 
This reverts commit 61afb76cfe.
This commit is contained in:
陈浩南 2024-06-08 16:03:52 +08:00
parent d51414e341
commit 861d56ac7a
1 changed files with 12 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
local/pkgs/hpcstat/src/disk.cpp
View File

@ -108,26 +108,23 @@ namespace hpcstat::disk
Usage usage;
if (auto size = get_size({})) usage.Total = *size; else return {};
if (auto date = get_date()) usage.Time = *date; else return {};
if (size / 800 * 100 > 80)
for (const auto& [dir, recursive] : Directories)
{
for (const auto& [dir, recursive] : Directories)
if (!std::filesystem::exists(*homedir + "/" + dir))
{ std::cerr << fmt::format("{} does not exist\n", *homedir + "/" + dir); continue; }
if (auto size = get_size(dir)) usage.Teacher.push_back({ dir, *size });
else return {};
if (recursive) for (const auto& subdir : get_subdir(dir))
{
if (!std::filesystem::exists(*homedir + "/" + dir))
{ std::cerr << fmt::format("{} does not exist\n", *homedir + "/" + dir); continue; }
if (auto size = get_size(dir)) usage.Teacher.push_back({ dir, *size });
if (auto size = get_size(dir + "/" + subdir); size)
usage.Student.push_back({ dir + "/" + subdir, *size });
else return {};
if (recursive) for (const auto& subdir : get_subdir(dir))
{
if (auto size = get_size(dir + "/" + subdir); size)
usage.Student.push_back({ dir + "/" + subdir, *size });
else return {};
}
}
std::sort(usage.Teacher.begin(), usage.Teacher.end(),
[](const auto& a, const auto& b) { return a.second > b.second; });
std::sort(usage.Student.begin(), usage.Student.end(),
[](const auto& a, const auto& b) { return a.second > b.second; });
}
std::sort(usage.Teacher.begin(), usage.Teacher.end(),
[](const auto& a, const auto& b) { return a.second > b.second; });
std::sort(usage.Student.begin(), usage.Student.end(),
[](const auto& a, const auto& b) { return a.second > b.second; });
return usage;
}
}