ManualSectionNode.cpp 2.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566
  1. /*
  2. * Copyright (c) 2019-2020, Sergey Bugaev <bugaevc@serenityos.org>
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright notice, this
  9. * list of conditions and the following disclaimer.
  10. *
  11. * 2. Redistributions in binary form must reproduce the above copyright notice,
  12. * this list of conditions and the following disclaimer in the documentation
  13. * and/or other materials provided with the distribution.
  14. *
  15. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  16. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  18. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  19. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  20. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  21. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  22. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  23. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  24. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  25. */
  26. #include "ManualSectionNode.h"
  27. #include "ManualPageNode.h"
  28. #include <AK/LexicalPath.h>
  29. #include <AK/QuickSort.h>
  30. #include <AK/String.h>
  31. #include <LibCore/DirIterator.h>
  32. String ManualSectionNode::path() const
  33. {
  34. return String::format("/usr/share/man/man%s", m_section.characters());
  35. }
  36. void ManualSectionNode::reify_if_needed() const
  37. {
  38. if (m_reified)
  39. return;
  40. m_reified = true;
  41. Core::DirIterator dir_iter { path(), Core::DirIterator::Flags::SkipDots };
  42. Vector<String> page_names;
  43. while (dir_iter.has_next()) {
  44. LexicalPath lexical_path(dir_iter.next_path());
  45. if (lexical_path.extension() != "md")
  46. continue;
  47. page_names.append(lexical_path.title());
  48. }
  49. quick_sort(page_names);
  50. for (auto& page_name : page_names)
  51. m_children.append(make<ManualPageNode>(*this, move(page_name)));
  52. }
  53. void ManualSectionNode::set_open(bool open)
  54. {
  55. if (m_open == open)
  56. return;
  57. m_open = open;
  58. }