TreeView.cpp 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582
  1. /*
  2. * Copyright (c) 2018-2020, Andreas Kling <kling@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 <LibGUI/Model.h>
  27. #include <LibGUI/Painter.h>
  28. #include <LibGUI/ScrollBar.h>
  29. #include <LibGUI/TreeView.h>
  30. #include <LibGfx/Bitmap.h>
  31. #include <LibGfx/Palette.h>
  32. //#define DEBUG_ITEM_RECTS
  33. namespace GUI {
  34. struct TreeView::MetadataForIndex {
  35. bool open { false };
  36. };
  37. TreeView::MetadataForIndex& TreeView::ensure_metadata_for_index(const ModelIndex& index) const
  38. {
  39. ASSERT(index.is_valid());
  40. auto it = m_view_metadata.find(index.internal_data());
  41. if (it != m_view_metadata.end())
  42. return *it->value;
  43. auto new_metadata = make<MetadataForIndex>();
  44. auto& new_metadata_ref = *new_metadata;
  45. m_view_metadata.set(index.internal_data(), move(new_metadata));
  46. return new_metadata_ref;
  47. }
  48. TreeView::TreeView()
  49. {
  50. set_fill_with_background_color(true);
  51. set_background_role(ColorRole::Base);
  52. set_foreground_role(ColorRole::BaseText);
  53. set_size_columns_to_fit_content(true);
  54. set_headers_visible(false);
  55. m_expand_bitmap = Gfx::Bitmap::load_from_file("/res/icons/treeview-expand.png");
  56. m_collapse_bitmap = Gfx::Bitmap::load_from_file("/res/icons/treeview-collapse.png");
  57. }
  58. TreeView::~TreeView()
  59. {
  60. }
  61. ModelIndex TreeView::index_at_event_position(const Gfx::Point& a_position, bool& is_toggle) const
  62. {
  63. auto position = a_position.translated(0, -header_height()).translated(horizontal_scrollbar().value() - frame_thickness(), vertical_scrollbar().value() - frame_thickness());
  64. is_toggle = false;
  65. if (!model())
  66. return {};
  67. ModelIndex result;
  68. traverse_in_paint_order([&](const ModelIndex& index, const Gfx::Rect& rect, const Gfx::Rect& toggle_rect, int) {
  69. if (toggle_rect.contains(position)) {
  70. result = index;
  71. is_toggle = true;
  72. return IterationDecision::Break;
  73. }
  74. if (rect.contains_vertically(position.y())) {
  75. result = index;
  76. return IterationDecision::Break;
  77. }
  78. return IterationDecision::Continue;
  79. });
  80. return result;
  81. }
  82. void TreeView::doubleclick_event(MouseEvent& event)
  83. {
  84. if (!model())
  85. return;
  86. auto& model = *this->model();
  87. bool is_toggle;
  88. auto index = index_at_event_position(event.position(), is_toggle);
  89. if (!index.is_valid())
  90. return;
  91. if (event.button() == MouseButton::Left) {
  92. if (selection().first() != index)
  93. selection().set(index);
  94. if (model.row_count(index))
  95. toggle_index(index);
  96. else
  97. activate(index);
  98. }
  99. }
  100. void TreeView::set_open_state_of_all_in_subtree(const ModelIndex& root, bool open)
  101. {
  102. if (root.is_valid())
  103. ensure_metadata_for_index(root).open = open;
  104. int row_count = model()->row_count(root);
  105. int column = model()->tree_column();
  106. for (int row = 0; row < row_count; ++row) {
  107. auto index = model()->index(row, column, root);
  108. set_open_state_of_all_in_subtree(index, open);
  109. }
  110. }
  111. void TreeView::expand_tree(const ModelIndex& root)
  112. {
  113. if (!model())
  114. return;
  115. set_open_state_of_all_in_subtree(root, true);
  116. update_column_sizes();
  117. update_content_size();
  118. update();
  119. }
  120. void TreeView::collapse_tree(const ModelIndex& root)
  121. {
  122. if (!model())
  123. return;
  124. set_open_state_of_all_in_subtree(root, false);
  125. update_column_sizes();
  126. update_content_size();
  127. update();
  128. }
  129. void TreeView::toggle_index(const ModelIndex& index)
  130. {
  131. ASSERT(model()->row_count(index));
  132. auto& metadata = ensure_metadata_for_index(index);
  133. metadata.open = !metadata.open;
  134. update_column_sizes();
  135. update_content_size();
  136. update();
  137. }
  138. template<typename Callback>
  139. void TreeView::traverse_in_paint_order(Callback callback) const
  140. {
  141. ASSERT(model());
  142. auto& model = *this->model();
  143. int indent_level = 1;
  144. int y_offset = 0;
  145. int tree_column_x_offset = this->tree_column_x_offset();
  146. Function<IterationDecision(const ModelIndex&)> traverse_index = [&](const ModelIndex& index) {
  147. int row_count_at_index = model.row_count(index);
  148. if (index.is_valid()) {
  149. auto& metadata = ensure_metadata_for_index(index);
  150. int x_offset = tree_column_x_offset + horizontal_padding() + indent_level * indent_width_in_pixels();
  151. auto node_text = model.data(index, Model::Role::Display).to_string();
  152. Gfx::Rect rect = {
  153. x_offset, y_offset,
  154. icon_size() + icon_spacing() + text_padding() + font().width(node_text) + text_padding(), item_height()
  155. };
  156. Gfx::Rect toggle_rect;
  157. if (row_count_at_index > 0) {
  158. int toggle_x = tree_column_x_offset + horizontal_padding() + (indent_width_in_pixels() * indent_level) - (icon_size() / 2) - 4;
  159. toggle_rect = { toggle_x, rect.y(), toggle_size(), toggle_size() };
  160. toggle_rect.center_vertically_within(rect);
  161. }
  162. if (callback(index, rect, toggle_rect, indent_level) == IterationDecision::Break)
  163. return IterationDecision::Break;
  164. y_offset += item_height();
  165. // NOTE: Skip traversing children if this index is closed!
  166. if (!metadata.open)
  167. return IterationDecision::Continue;
  168. }
  169. ++indent_level;
  170. int row_count = model.row_count(index);
  171. for (int i = 0; i < row_count; ++i) {
  172. if (traverse_index(model.index(i, model.tree_column(), index)) == IterationDecision::Break)
  173. return IterationDecision::Break;
  174. }
  175. --indent_level;
  176. return IterationDecision::Continue;
  177. };
  178. int root_count = model.row_count();
  179. for (int root_index = 0; root_index < root_count; ++root_index) {
  180. if (traverse_index(model.index(root_index, model.tree_column(), ModelIndex())) == IterationDecision::Break)
  181. break;
  182. }
  183. }
  184. void TreeView::paint_event(PaintEvent& event)
  185. {
  186. Frame::paint_event(event);
  187. Painter painter(*this);
  188. painter.add_clip_rect(frame_inner_rect());
  189. painter.add_clip_rect(event.rect());
  190. if (fill_with_background_color())
  191. painter.fill_rect(event.rect(), palette().color(background_role()));
  192. if (!model())
  193. return;
  194. auto& model = *this->model();
  195. painter.translate(frame_inner_rect().location());
  196. painter.translate(-horizontal_scrollbar().value(), -vertical_scrollbar().value());
  197. auto visible_content_rect = this->visible_content_rect();
  198. int tree_column = model.tree_column();
  199. int tree_column_x_offset = this->tree_column_x_offset();
  200. int y_offset = header_height();
  201. int painted_row_index = 0;
  202. traverse_in_paint_order([&](const ModelIndex& index, const Gfx::Rect& a_rect, const Gfx::Rect& a_toggle_rect, int indent_level) {
  203. if (!a_rect.intersects_vertically(visible_content_rect))
  204. return IterationDecision::Continue;
  205. auto rect = a_rect.translated(0, y_offset);
  206. auto toggle_rect = a_toggle_rect.translated(0, y_offset);
  207. #ifdef DEBUG_ITEM_RECTS
  208. painter.fill_rect(rect, Color::WarmGray);
  209. #endif
  210. bool is_selected_row = selection().contains(index);
  211. Color text_color = palette().color(foreground_role());
  212. if (is_selected_row)
  213. text_color = is_focused() ? palette().selection_text() : palette().inactive_selection_text();
  214. Color background_color;
  215. Color key_column_background_color;
  216. if (is_selected_row) {
  217. background_color = is_focused() ? palette().selection() : palette().inactive_selection();
  218. key_column_background_color = is_focused() ? palette().selection() : palette().inactive_selection();
  219. } else {
  220. if (alternating_row_colors() && (painted_row_index % 2)) {
  221. background_color = Color(220, 220, 220);
  222. key_column_background_color = Color(200, 200, 200);
  223. } else {
  224. background_color = palette().color(background_role());
  225. key_column_background_color = Color(220, 220, 220);
  226. }
  227. }
  228. int row_width = 0;
  229. for (int column_index = 0; column_index < model.column_count(); ++column_index) {
  230. if (is_column_hidden(column_index))
  231. continue;
  232. row_width += this->column_width(column_index) + horizontal_padding() * 2;
  233. }
  234. if (frame_inner_rect().width() > row_width) {
  235. row_width = frame_inner_rect().width();
  236. }
  237. Gfx::Rect row_rect { 0, rect.y(), row_width, rect.height() };
  238. painter.fill_rect(row_rect, background_color);
  239. int x_offset = 0;
  240. for (int column_index = 0; column_index < model.column_count(); ++column_index) {
  241. if (is_column_hidden(column_index))
  242. continue;
  243. auto column_metadata = model.column_metadata(column_index);
  244. int column_width = this->column_width(column_index);
  245. auto& font = column_metadata.font ? *column_metadata.font : this->font();
  246. painter.draw_rect(toggle_rect, text_color);
  247. if (column_index != tree_column) {
  248. Gfx::Rect cell_rect(horizontal_padding() + x_offset, rect.y(), column_width, item_height());
  249. auto cell_index = model.sibling(index.row(), column_index, index.parent());
  250. if (auto* delegate = column_data(column_index).cell_painting_delegate.ptr()) {
  251. delegate->paint(painter, cell_rect, palette(), model, cell_index);
  252. } else {
  253. auto data = model.data(cell_index);
  254. if (data.is_bitmap()) {
  255. painter.blit(cell_rect.location(), data.as_bitmap(), data.as_bitmap().rect());
  256. } else if (data.is_icon()) {
  257. if (auto bitmap = data.as_icon().bitmap_for_size(16))
  258. painter.blit(cell_rect.location(), *bitmap, bitmap->rect());
  259. } else {
  260. if (!is_selected_row)
  261. text_color = model.data(cell_index, Model::Role::ForegroundColor).to_color(palette().color(foreground_role()));
  262. painter.draw_text(cell_rect, data.to_string(), font, column_metadata.text_alignment, text_color, Gfx::TextElision::Right);
  263. }
  264. }
  265. } else {
  266. // It's the tree column!
  267. Gfx::Rect icon_rect = { rect.x(), rect.y(), icon_size(), icon_size() };
  268. auto icon = model.data(index, Model::Role::Icon);
  269. if (icon.is_icon()) {
  270. if (auto* bitmap = icon.as_icon().bitmap_for_size(icon_size())) {
  271. if (m_hovered_index.is_valid() && m_hovered_index.parent() == index.parent() && m_hovered_index.row() == index.row())
  272. painter.blit_brightened(icon_rect.location(), *bitmap, bitmap->rect());
  273. else
  274. painter.blit(icon_rect.location(), *bitmap, bitmap->rect());
  275. }
  276. }
  277. Gfx::Rect text_rect = {
  278. icon_rect.right() + 1 + icon_spacing(), rect.y(),
  279. rect.width() - icon_size() - icon_spacing(), rect.height()
  280. };
  281. auto node_text = model.data(index, Model::Role::Display).to_string();
  282. painter.draw_text(text_rect, node_text, Gfx::TextAlignment::Center, text_color);
  283. auto index_at_indent = index;
  284. for (int i = indent_level; i > 0; --i) {
  285. auto parent_of_index_at_indent = index_at_indent.parent();
  286. bool index_at_indent_is_last_in_parent = index_at_indent.row() == model.row_count(parent_of_index_at_indent) - 1;
  287. Gfx::Point a { tree_column_x_offset + horizontal_padding() + indent_width_in_pixels() * i - icon_size() / 2, rect.y() - 2 };
  288. Gfx::Point b { a.x(), a.y() + item_height() - 1 };
  289. if (index_at_indent_is_last_in_parent)
  290. b.set_y(rect.center().y());
  291. if (!(i != indent_level && index_at_indent_is_last_in_parent))
  292. painter.draw_line(a, b, Color::MidGray);
  293. if (i == indent_level) {
  294. Gfx::Point c { a.x(), rect.center().y() };
  295. Gfx::Point d { c.x() + icon_size() / 2, c.y() };
  296. painter.draw_line(c, d, Color::MidGray);
  297. }
  298. index_at_indent = parent_of_index_at_indent;
  299. }
  300. if (!toggle_rect.is_empty()) {
  301. auto& metadata = ensure_metadata_for_index(index);
  302. if (metadata.open)
  303. painter.blit(toggle_rect.location(), *m_collapse_bitmap, m_collapse_bitmap->rect());
  304. else
  305. painter.blit(toggle_rect.location(), *m_expand_bitmap, m_expand_bitmap->rect());
  306. }
  307. }
  308. x_offset += column_width + horizontal_padding() * 2;
  309. }
  310. return IterationDecision::Continue;
  311. });
  312. // Untranslate the painter vertically and do the column headers.
  313. painter.translate(0, vertical_scrollbar().value());
  314. paint_headers(painter);
  315. }
  316. void TreeView::scroll_into_view(const ModelIndex& a_index, Orientation orientation)
  317. {
  318. if (!a_index.is_valid())
  319. return;
  320. Gfx::Rect found_rect;
  321. traverse_in_paint_order([&](const ModelIndex& index, const Gfx::Rect& rect, const Gfx::Rect&, int) {
  322. if (index == a_index) {
  323. found_rect = rect;
  324. return IterationDecision::Break;
  325. }
  326. return IterationDecision::Continue;
  327. });
  328. ScrollableWidget::scroll_into_view(found_rect, orientation);
  329. }
  330. void TreeView::did_update_model(unsigned flags)
  331. {
  332. m_view_metadata.clear();
  333. AbstractTableView::did_update_model(flags);
  334. }
  335. void TreeView::did_update_selection()
  336. {
  337. AbstractView::did_update_selection();
  338. ASSERT(model());
  339. auto index = selection().first();
  340. if (!index.is_valid())
  341. return;
  342. #if 0
  343. bool opened_any = false;
  344. for (auto current = index; current.is_valid(); current = current.parent()) {
  345. auto& metadata_for_ancestor = ensure_metadata_for_index(current);
  346. if (!metadata_for_ancestor.open) {
  347. metadata_for_ancestor.open = true;
  348. opened_any = true;
  349. }
  350. }
  351. if (opened_any)
  352. update_content_size();
  353. update();
  354. #endif
  355. if (activates_on_selection())
  356. activate(index);
  357. }
  358. void TreeView::keydown_event(KeyEvent& event)
  359. {
  360. if (!model())
  361. return;
  362. auto cursor_index = selection().first();
  363. if (event.key() == KeyCode::Key_Space) {
  364. if (model()->row_count(cursor_index))
  365. toggle_index(cursor_index);
  366. return;
  367. }
  368. if (event.key() == KeyCode::Key_Up) {
  369. ModelIndex previous_index;
  370. ModelIndex found_index;
  371. traverse_in_paint_order([&](const ModelIndex& index, const Gfx::Rect&, const Gfx::Rect&, int) {
  372. if (index == cursor_index) {
  373. found_index = previous_index;
  374. return IterationDecision::Break;
  375. }
  376. previous_index = index;
  377. return IterationDecision::Continue;
  378. });
  379. if (found_index.is_valid()) {
  380. selection().set(found_index);
  381. scroll_into_view(selection().first(), Orientation::Vertical);
  382. update();
  383. }
  384. return;
  385. }
  386. if (event.key() == KeyCode::Key_Down) {
  387. ModelIndex previous_index;
  388. ModelIndex found_index;
  389. traverse_in_paint_order([&](const ModelIndex& index, const Gfx::Rect&, const Gfx::Rect&, int) {
  390. if (previous_index == cursor_index) {
  391. found_index = index;
  392. return IterationDecision::Break;
  393. }
  394. previous_index = index;
  395. return IterationDecision::Continue;
  396. });
  397. if (found_index.is_valid()) {
  398. selection().set(found_index);
  399. scroll_into_view(selection().first(), Orientation::Vertical);
  400. update();
  401. }
  402. return;
  403. }
  404. auto open_tree_node = [&](bool open, MetadataForIndex& metadata) {
  405. metadata.open = open;
  406. update_column_sizes();
  407. update_content_size();
  408. update();
  409. };
  410. if (event.key() == KeyCode::Key_Left) {
  411. if (cursor_index.is_valid() && model()->row_count(cursor_index)) {
  412. if (event.alt()) {
  413. collapse_tree(cursor_index);
  414. return;
  415. }
  416. auto& metadata = ensure_metadata_for_index(cursor_index);
  417. if (metadata.open) {
  418. open_tree_node(false, metadata);
  419. return;
  420. }
  421. }
  422. if (cursor_index.is_valid() && cursor_index.parent().is_valid()) {
  423. selection().set(cursor_index.parent());
  424. scroll_into_view(selection().first(), Orientation::Vertical);
  425. return;
  426. }
  427. }
  428. if (event.key() == KeyCode::Key_Right) {
  429. if (cursor_index.is_valid() && model()->row_count(cursor_index)) {
  430. if (event.alt()) {
  431. expand_tree(cursor_index);
  432. return;
  433. }
  434. auto& metadata = ensure_metadata_for_index(cursor_index);
  435. if (!metadata.open) {
  436. open_tree_node(true, metadata);
  437. return;
  438. }
  439. selection().set(model()->index(0, model()->tree_column(), cursor_index));
  440. scroll_into_view(selection().first(), Orientation::Vertical);
  441. return;
  442. }
  443. }
  444. if (event.key() == KeyCode::Key_Return) {
  445. if (cursor_index.is_valid() && model()->row_count(cursor_index)) {
  446. auto& metadata = ensure_metadata_for_index(cursor_index);
  447. open_tree_node(!metadata.open, metadata);
  448. return;
  449. }
  450. }
  451. }
  452. int TreeView::item_count() const
  453. {
  454. int count = 0;
  455. traverse_in_paint_order([&](const ModelIndex&, const Gfx::Rect&, const Gfx::Rect&, int) {
  456. ++count;
  457. return IterationDecision::Continue;
  458. });
  459. return count;
  460. }
  461. void TreeView::update_column_sizes()
  462. {
  463. if (!size_columns_to_fit_content())
  464. return;
  465. if (!model())
  466. return;
  467. auto& model = *this->model();
  468. int column_count = model.column_count();
  469. int row_count = model.row_count();
  470. int tree_column = model.tree_column();
  471. int tree_column_x_offset = 0;
  472. for (int column = 0; column < column_count; ++column) {
  473. if (column == tree_column)
  474. continue;
  475. if (is_column_hidden(column))
  476. continue;
  477. int header_width = header_font().width(model.column_name(column));
  478. int column_width = header_width;
  479. for (int row = 0; row < row_count; ++row) {
  480. auto cell_data = model.data(model.index(row, column));
  481. int cell_width = 0;
  482. if (cell_data.is_bitmap()) {
  483. cell_width = cell_data.as_bitmap().width();
  484. } else {
  485. cell_width = font().width(cell_data.to_string());
  486. }
  487. column_width = max(column_width, cell_width);
  488. }
  489. auto& column_data = this->column_data(column);
  490. column_data.width = max(column_data.width, column_width);
  491. column_data.has_initialized_width = true;
  492. if (column < tree_column)
  493. tree_column_x_offset += column_width;
  494. }
  495. int tree_column_header_width = header_font().width(model.column_name(tree_column));
  496. int tree_column_width = tree_column_header_width;
  497. traverse_in_paint_order([&](const ModelIndex&, const Gfx::Rect& rect, const Gfx::Rect&, int) {
  498. tree_column_width = max(rect.right() - tree_column_x_offset, tree_column_width);
  499. return IterationDecision::Continue;
  500. });
  501. auto& column_data = this->column_data(tree_column);
  502. column_data.width = max(column_data.width, tree_column_width);
  503. column_data.has_initialized_width = true;
  504. }
  505. int TreeView::tree_column_x_offset() const
  506. {
  507. int tree_column = model()->tree_column();
  508. int offset = 0;
  509. for (int i = 0; i < tree_column; ++i) {
  510. if (!is_column_hidden(i)) {
  511. offset += column_width(i);
  512. offset += horizontal_padding();
  513. }
  514. }
  515. return offset;
  516. }
  517. }