TreeViewModel.cpp 2.7 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283
  1. /*
  2. * Copyright (c) 2022, Linus Groh <linusg@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <LibGUI/TreeViewModel.h>
  7. namespace GUI {
  8. ModelIndex TreeViewModel::index(int row, int column, ModelIndex const& parent) const
  9. {
  10. if (!parent.is_valid()) {
  11. if (static_cast<size_t>(row) >= m_nodes.size())
  12. return {};
  13. return create_index(row, column, &m_nodes[row]);
  14. }
  15. auto const& parent_node = *static_cast<Node const*>(parent.internal_data());
  16. if (static_cast<size_t>(row) >= parent_node.child_nodes().size())
  17. return {};
  18. auto const* child = &parent_node.child_nodes()[row];
  19. return create_index(row, column, child);
  20. }
  21. ModelIndex TreeViewModel::parent_index(ModelIndex const& index) const
  22. {
  23. if (!index.is_valid())
  24. return {};
  25. auto const& child_node = *static_cast<Node const*>(index.internal_data());
  26. auto const* parent_node = child_node.parent_node();
  27. if (parent_node == nullptr)
  28. return {};
  29. if (parent_node->parent_node() == nullptr) {
  30. for (size_t row = 0; row < m_nodes.size(); row++)
  31. if (m_nodes.ptr_at(row).ptr() == parent_node)
  32. return create_index(static_cast<int>(row), 0, parent_node);
  33. VERIFY_NOT_REACHED();
  34. }
  35. for (size_t row = 0; row < parent_node->parent_node()->child_nodes().size(); row++) {
  36. auto const* child_node_at_row = parent_node->parent_node()->child_nodes().ptr_at(row).ptr();
  37. if (child_node_at_row == parent_node)
  38. return create_index(static_cast<int>(row), 0, parent_node);
  39. }
  40. VERIFY_NOT_REACHED();
  41. }
  42. int TreeViewModel::row_count(ModelIndex const& index) const
  43. {
  44. if (!index.is_valid())
  45. return static_cast<int>(m_nodes.size());
  46. auto const& node = *static_cast<Node const*>(index.internal_data());
  47. return static_cast<int>(node.child_nodes().size());
  48. }
  49. Variant TreeViewModel::data(ModelIndex const& index, ModelRole role) const
  50. {
  51. auto const& node = *static_cast<Node const*>(index.internal_data());
  52. switch (role) {
  53. case ModelRole::Display:
  54. return node.text();
  55. case ModelRole::Icon:
  56. if (node.icon().has_value())
  57. return *node.icon();
  58. return {};
  59. default:
  60. return {};
  61. }
  62. }
  63. Optional<ModelIndex> TreeViewModel::index_for_node(Node const& node, ModelIndex const& parent) const
  64. {
  65. for (int row = 0; row < row_count(parent); ++row) {
  66. auto row_index = this->index(row, 0);
  67. auto const* row_node = static_cast<TreeViewModel::Node const*>(row_index.internal_data());
  68. if (&node == row_node)
  69. return row_index;
  70. if (auto index = index_for_node(node, row_index); index.has_value())
  71. return index;
  72. }
  73. return {};
  74. }
  75. }