However, running this code even in optimized builds is significantly slower than what TreeSize can do (e.g.
Assuming I wanted to calculate a folder size efficiently in C++, I would for example use the following modern C++ code: size_t calculate_directory_size(const std::filesystem::path& directory, const size_t maximum_size)įor (std::filesystem::recursive_directory_iterator directory_iterator(directory) ĭirectory_iterator != std::filesystem::recursive_directory_iterator() ++directory_iterator) I'm wondering how they're doing this so fast. The program TreeSize Free can list folders inside a directory and sort them descendingly according to their file sizes to find the biggest folders/files for cleaning up your harddrive.
0 kommentar(er)
