mirrors/serenity
1
0
Fork 0
mirror of https://github.com/SerenityOS/serenity.git synced 2025-01-23 09:51:57 -05:00
Code Issues Projects Releases Packages Wiki Activity

LibManual: Create subsections for subdirectories automatically

Browse source
This commit is contained in:
kleines Filmröllchen 2022-12-14 17:19:40 +01:00 • committed by Andrew Kaster
parent a9fe80550d
commit 3e67f14e58
1 changed files with 24 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

32
Userland/Libraries/LibManual/SectionNode.cpp
View file

@ -7,9 +7,11 @@
#include "SectionNode.h"
#include "PageNode.h"
#include "Path.h"
#include "SubsectionNode.h"
#include <AK/LexicalPath.h>
#include <AK/QuickSort.h>
#include <LibCore/DirIterator.h>
#include <LibCore/File.h>
namespace Manual {
@ -40,20 +42,34 @@ ErrorOr<void> SectionNode::reify_if_needed() const
return {};
m_reified = true;
Core::DirIterator dir_iter { TRY(path()).to_deprecated_string(), Core::DirIterator::Flags::SkipDots };
auto own_path = TRY(path());
Core::DirIterator dir_iter { own_path.to_deprecated_string(), Core::DirIterator::Flags::SkipDots };
struct Child {
NonnullRefPtr<Node> node;
String name_for_sorting;
};
Vector<Child> children;
Vector<String> page_names;
while (dir_iter.has_next()) {
LexicalPath lexical_path(dir_iter.next_path());
if (lexical_path.extension() != "md")
continue;
page_names.append(TRY(String::from_utf8(lexical_path.title())));
if (lexical_path.extension() != "md") {
if (Core::File::is_directory(LexicalPath::absolute_path(own_path.to_deprecated_string(), lexical_path.string()))) {
dbgln("Found subsection {}", lexical_path);
children.append({ .node = TRY(try_make_ref_counted<SubsectionNode>(*this, lexical_path.title())),
.name_for_sorting = TRY(String::from_utf8(lexical_path.title())) });
}
} else {
children.append({ .node = TRY(try_make_ref_counted<PageNode>(*this, TRY(String::from_utf8(lexical_path.title())))),
.name_for_sorting = TRY(String::from_utf8(lexical_path.title())) });
}
}
quick_sort(page_names);
quick_sort(children, [](auto const& a, auto const& b) { return a.name_for_sorting < b.name_for_sorting; });
for (auto& page_name : page_names)
m_children.append(TRY(try_make_ref_counted<PageNode>(*this, move(page_name))));
m_children.ensure_capacity(children.size());
for (auto child : children)
m_children.unchecked_append(move(child.node));
return {};
}