TreeView.cpp 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736
  1. /*
  2. * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
  3. *
  4. * SPDX-License-Identifier: BSD-2-Clause
  5. */
  6. #include <AK/Debug.h>
  7. #include <LibGUI/HeaderView.h>
  8. #include <LibGUI/Model.h>
  9. #include <LibGUI/Painter.h>
  10. #include <LibGUI/Scrollbar.h>
  11. #include <LibGUI/TreeView.h>
  12. #include <LibGfx/Bitmap.h>
  13. #include <LibGfx/Palette.h>
  14. REGISTER_WIDGET(GUI, TreeView)
  15. namespace GUI {
  16. struct TreeView::MetadataForIndex {
  17. bool open { false };
  18. };
  19. TreeView::MetadataForIndex& TreeView::ensure_metadata_for_index(const ModelIndex& index) const
  20. {
  21. VERIFY(index.is_valid());
  22. auto it = m_view_metadata.find(index.internal_data());
  23. if (it != m_view_metadata.end())
  24. return *it->value;
  25. auto new_metadata = make<MetadataForIndex>();
  26. auto& new_metadata_ref = *new_metadata;
  27. m_view_metadata.set(index.internal_data(), move(new_metadata));
  28. return new_metadata_ref;
  29. }
  30. TreeView::TreeView()
  31. {
  32. set_fill_with_background_color(true);
  33. set_background_role(ColorRole::Base);
  34. set_foreground_role(ColorRole::BaseText);
  35. set_column_headers_visible(false);
  36. m_expand_bitmap = Gfx::Bitmap::load_from_file("/res/icons/serenity/treeview-expand.png");
  37. m_collapse_bitmap = Gfx::Bitmap::load_from_file("/res/icons/serenity/treeview-collapse.png");
  38. }
  39. TreeView::~TreeView()
  40. {
  41. }
  42. ModelIndex TreeView::index_at_event_position(const Gfx::IntPoint& a_position, bool& is_toggle) const
  43. {
  44. auto position = a_position.translated(0, -column_header().height()).translated(horizontal_scrollbar().value() - frame_thickness(), vertical_scrollbar().value() - frame_thickness());
  45. is_toggle = false;
  46. if (!model())
  47. return {};
  48. ModelIndex result;
  49. traverse_in_paint_order([&](const ModelIndex& index, const Gfx::IntRect& rect, const Gfx::IntRect& toggle_rect, int) {
  50. if (toggle_rect.contains(position)) {
  51. result = index;
  52. is_toggle = true;
  53. return IterationDecision::Break;
  54. }
  55. if (rect.contains_vertically(position.y())) {
  56. result = index;
  57. return IterationDecision::Break;
  58. }
  59. return IterationDecision::Continue;
  60. });
  61. return result;
  62. }
  63. void TreeView::doubleclick_event(MouseEvent& event)
  64. {
  65. if (!model())
  66. return;
  67. auto& model = *this->model();
  68. bool is_toggle;
  69. auto index = index_at_event_position(event.position(), is_toggle);
  70. if (!index.is_valid())
  71. return;
  72. if (event.button() == MouseButton::Left) {
  73. set_cursor(index, SelectionUpdate::Set);
  74. if (model.row_count(index))
  75. toggle_index(index);
  76. else
  77. activate(index);
  78. }
  79. }
  80. void TreeView::set_open_state_of_all_in_subtree(const ModelIndex& root, bool open)
  81. {
  82. if (root.is_valid()) {
  83. ensure_metadata_for_index(root).open = open;
  84. if (model()->row_count(root)) {
  85. if (on_toggle)
  86. on_toggle(root, open);
  87. }
  88. }
  89. int row_count = model()->row_count(root);
  90. int column = model()->tree_column();
  91. for (int row = 0; row < row_count; ++row) {
  92. auto index = model()->index(row, column, root);
  93. set_open_state_of_all_in_subtree(index, open);
  94. }
  95. }
  96. void TreeView::expand_all_parents_of(const ModelIndex& index)
  97. {
  98. if (!model())
  99. return;
  100. auto current = index;
  101. while (current.is_valid()) {
  102. ensure_metadata_for_index(current).open = true;
  103. if (on_toggle)
  104. on_toggle(current, true);
  105. current = current.parent();
  106. }
  107. update_column_sizes();
  108. update_content_size();
  109. update();
  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. VERIFY(model()->row_count(index));
  132. auto& metadata = ensure_metadata_for_index(index);
  133. metadata.open = !metadata.open;
  134. if (!metadata.open && index.is_parent_of(cursor_index()))
  135. set_cursor(index, SelectionUpdate::Set);
  136. if (on_toggle)
  137. on_toggle(index, metadata.open);
  138. update_column_sizes();
  139. update_content_size();
  140. update();
  141. }
  142. template<typename Callback>
  143. void TreeView::traverse_in_paint_order(Callback callback) const
  144. {
  145. VERIFY(model());
  146. auto& model = *this->model();
  147. auto tree_column = model.tree_column();
  148. int indent_level = 1;
  149. int y_offset = 0;
  150. int tree_column_x_offset = this->tree_column_x_offset();
  151. Function<IterationDecision(const ModelIndex&)> traverse_index = [&](const ModelIndex& index) {
  152. int row_count_at_index = model.row_count(index);
  153. if (index.is_valid()) {
  154. auto& metadata = ensure_metadata_for_index(index);
  155. int x_offset = tree_column_x_offset + horizontal_padding() + indent_level * indent_width_in_pixels();
  156. auto node_text = index.data().to_string();
  157. Gfx::IntRect rect = {
  158. x_offset, y_offset,
  159. icon_size() + icon_spacing() + text_padding() + font_for_index(index)->width(node_text) + text_padding(), row_height()
  160. };
  161. Gfx::IntRect toggle_rect;
  162. if (row_count_at_index > 0) {
  163. int toggle_x = tree_column_x_offset + horizontal_padding() + (indent_width_in_pixels() * indent_level) - (icon_size() / 2) - 4;
  164. toggle_rect = { toggle_x, rect.y(), toggle_size(), toggle_size() };
  165. toggle_rect.center_vertically_within(rect);
  166. }
  167. if (callback(index, rect, toggle_rect, indent_level) == IterationDecision::Break)
  168. return IterationDecision::Break;
  169. y_offset += row_height();
  170. // NOTE: Skip traversing children if this index is closed!
  171. if (!metadata.open)
  172. return IterationDecision::Continue;
  173. }
  174. if (indent_level > 0 && !index.is_valid())
  175. return IterationDecision::Continue;
  176. ++indent_level;
  177. int row_count = model.row_count(index);
  178. for (int i = 0; i < row_count; ++i) {
  179. if (traverse_index(model.index(i, tree_column, index)) == IterationDecision::Break)
  180. return IterationDecision::Break;
  181. }
  182. --indent_level;
  183. return IterationDecision::Continue;
  184. };
  185. int root_count = model.row_count();
  186. for (int root_index = 0; root_index < root_count; ++root_index) {
  187. if (traverse_index(model.index(root_index, tree_column, ModelIndex())) == IterationDecision::Break)
  188. break;
  189. }
  190. }
  191. void TreeView::paint_event(PaintEvent& event)
  192. {
  193. Frame::paint_event(event);
  194. Painter painter(*this);
  195. painter.add_clip_rect(frame_inner_rect());
  196. painter.add_clip_rect(event.rect());
  197. if (fill_with_background_color())
  198. painter.fill_rect(event.rect(), palette().color(background_role()));
  199. if (!model())
  200. return;
  201. auto& model = *this->model();
  202. painter.translate(frame_inner_rect().location());
  203. painter.translate(-horizontal_scrollbar().value(), -vertical_scrollbar().value());
  204. auto visible_content_rect = this->visible_content_rect();
  205. int tree_column = model.tree_column();
  206. int column_count = model.column_count();
  207. int tree_column_x_offset = this->tree_column_x_offset();
  208. int y_offset = column_header().height();
  209. int painted_row_index = 0;
  210. traverse_in_paint_order([&](const ModelIndex& index, const Gfx::IntRect& a_rect, const Gfx::IntRect& a_toggle_rect, int indent_level) {
  211. if (!a_rect.intersects_vertically(visible_content_rect))
  212. return IterationDecision::Continue;
  213. auto rect = a_rect.translated(0, y_offset);
  214. auto toggle_rect = a_toggle_rect.translated(0, y_offset);
  215. if constexpr (ITEM_RECTS_DEBUG)
  216. painter.fill_rect(rect, Color::WarmGray);
  217. bool is_selected_row = selection().contains(index);
  218. Color text_color = palette().color(foreground_role());
  219. if (is_selected_row && should_fill_selected_rows())
  220. text_color = is_focused() ? palette().selection_text() : palette().inactive_selection_text();
  221. Color background_color;
  222. Color key_column_background_color;
  223. if (is_selected_row) {
  224. background_color = is_focused() ? palette().selection() : palette().inactive_selection();
  225. key_column_background_color = is_focused() ? palette().selection() : palette().inactive_selection();
  226. } else {
  227. if (alternating_row_colors() && (painted_row_index % 2)) {
  228. background_color = Color(220, 220, 220);
  229. key_column_background_color = Color(200, 200, 200);
  230. } else {
  231. background_color = palette().color(background_role());
  232. key_column_background_color = Color(220, 220, 220);
  233. }
  234. }
  235. int row_width = 0;
  236. for (int column_index = 0; column_index < column_count; ++column_index) {
  237. if (!column_header().is_section_visible(column_index))
  238. continue;
  239. row_width += this->column_width(column_index) + horizontal_padding() * 2;
  240. }
  241. if (frame_inner_rect().width() > row_width) {
  242. row_width = frame_inner_rect().width();
  243. }
  244. Gfx::IntRect row_rect { 0, rect.y(), row_width, rect.height() };
  245. if (!is_selected_row || should_fill_selected_rows())
  246. painter.fill_rect(row_rect, background_color);
  247. int x_offset = 0;
  248. for (int column_index = 0; column_index < column_count; ++column_index) {
  249. if (!column_header().is_section_visible(column_index))
  250. continue;
  251. int column_width = this->column_width(column_index);
  252. painter.draw_rect(toggle_rect, text_color);
  253. if (column_index != tree_column) {
  254. Gfx::IntRect cell_rect(horizontal_padding() + x_offset, rect.y(), column_width, row_height());
  255. auto cell_index = model.index(index.row(), column_index, index.parent());
  256. if (auto* delegate = column_painting_delegate(column_index)) {
  257. delegate->paint(painter, cell_rect, palette(), cell_index);
  258. } else {
  259. auto data = cell_index.data();
  260. if (data.is_bitmap()) {
  261. painter.blit(cell_rect.location(), data.as_bitmap(), data.as_bitmap().rect());
  262. } else if (data.is_icon()) {
  263. if (auto bitmap = data.as_icon().bitmap_for_size(16))
  264. painter.blit(cell_rect.location(), *bitmap, bitmap->rect());
  265. } else {
  266. auto text_alignment = cell_index.data(ModelRole::TextAlignment).to_text_alignment(Gfx::TextAlignment::CenterLeft);
  267. draw_item_text(painter, cell_index, is_selected_row, cell_rect, data.to_string(), font_for_index(cell_index), text_alignment, Gfx::TextElision::Right);
  268. }
  269. }
  270. } else {
  271. // It's the tree column!
  272. Gfx::IntRect icon_rect = { rect.x(), rect.y(), icon_size(), icon_size() };
  273. Gfx::IntRect text_rect = {
  274. icon_rect.right() + 1 + icon_spacing(), rect.y(),
  275. rect.width() - icon_size() - icon_spacing(), rect.height()
  276. };
  277. painter.fill_rect(text_rect, background_color);
  278. auto icon = index.data(ModelRole::Icon);
  279. if (icon.is_icon()) {
  280. if (auto* bitmap = icon.as_icon().bitmap_for_size(icon_size())) {
  281. if (m_hovered_index.is_valid() && m_hovered_index.parent() == index.parent() && m_hovered_index.row() == index.row())
  282. painter.blit_brightened(icon_rect.location(), *bitmap, bitmap->rect());
  283. else
  284. painter.blit(icon_rect.location(), *bitmap, bitmap->rect());
  285. }
  286. }
  287. draw_item_text(painter, index, is_selected_row, text_rect, index.data().to_string(), font_for_index(index), Gfx::TextAlignment::Center, Gfx::TextElision::None);
  288. if (is_focused() && index == cursor_index()) {
  289. painter.draw_rect(text_rect, palette().color(background_role()));
  290. painter.draw_focus_rect(text_rect, palette().focus_outline());
  291. }
  292. auto index_at_indent = index;
  293. for (int i = indent_level; i > 0; --i) {
  294. auto parent_of_index_at_indent = index_at_indent.parent();
  295. bool index_at_indent_is_last_in_parent = index_at_indent.row() == model.row_count(parent_of_index_at_indent) - 1;
  296. Gfx::IntPoint a { tree_column_x_offset + horizontal_padding() + indent_width_in_pixels() * i - icon_size() / 2, rect.y() - 2 };
  297. Gfx::IntPoint b { a.x(), a.y() + row_height() - 1 };
  298. if (index_at_indent_is_last_in_parent)
  299. b.set_y(rect.center().y());
  300. if (!(i != indent_level && index_at_indent_is_last_in_parent))
  301. painter.draw_line(a, b, Color::MidGray);
  302. if (i == indent_level) {
  303. Gfx::IntPoint c { a.x(), rect.center().y() };
  304. Gfx::IntPoint d { c.x() + icon_size() / 2, c.y() };
  305. painter.draw_line(c, d, Color::MidGray);
  306. }
  307. index_at_indent = parent_of_index_at_indent;
  308. }
  309. if (!toggle_rect.is_empty()) {
  310. auto& metadata = ensure_metadata_for_index(index);
  311. if (metadata.open)
  312. painter.blit(toggle_rect.location(), *m_collapse_bitmap, m_collapse_bitmap->rect());
  313. else
  314. painter.blit(toggle_rect.location(), *m_expand_bitmap, m_expand_bitmap->rect());
  315. }
  316. if (has_pending_drop() && index == drop_candidate_index()) {
  317. painter.draw_rect(rect, palette().selection(), true);
  318. }
  319. }
  320. x_offset += column_width + horizontal_padding() * 2;
  321. }
  322. return IterationDecision::Continue;
  323. });
  324. }
  325. void TreeView::scroll_into_view(const ModelIndex& a_index, bool, bool scroll_vertically)
  326. {
  327. if (!a_index.is_valid())
  328. return;
  329. Gfx::IntRect found_rect;
  330. traverse_in_paint_order([&](const ModelIndex& index, const Gfx::IntRect& rect, const Gfx::IntRect&, int) {
  331. if (index == a_index) {
  332. found_rect = rect;
  333. return IterationDecision::Break;
  334. }
  335. return IterationDecision::Continue;
  336. });
  337. AbstractScrollableWidget::scroll_into_view(found_rect, false, scroll_vertically);
  338. }
  339. void TreeView::model_did_update(unsigned flags)
  340. {
  341. m_view_metadata.clear();
  342. AbstractTableView::model_did_update(flags);
  343. }
  344. void TreeView::did_update_selection()
  345. {
  346. AbstractView::did_update_selection();
  347. if (!model())
  348. return;
  349. auto index = selection().first();
  350. if (!index.is_valid())
  351. return;
  352. if (activates_on_selection())
  353. activate(index);
  354. }
  355. void TreeView::keydown_event(KeyEvent& event)
  356. {
  357. if (!model())
  358. return AbstractTableView::keydown_event(event);
  359. if (event.key() == KeyCode::Key_Space) {
  360. if (model()->row_count(cursor_index()))
  361. toggle_index(cursor_index());
  362. return;
  363. }
  364. auto open_tree_node = [&](bool open, MetadataForIndex& metadata) {
  365. if (on_toggle)
  366. on_toggle(cursor_index(), open);
  367. metadata.open = open;
  368. update_column_sizes();
  369. update_content_size();
  370. update();
  371. };
  372. if (event.key() == KeyCode::Key_Left) {
  373. if (cursor_index().is_valid() && model()->row_count(cursor_index())) {
  374. if (event.ctrl()) {
  375. collapse_tree(cursor_index());
  376. return;
  377. }
  378. auto& metadata = ensure_metadata_for_index(cursor_index());
  379. if (metadata.open) {
  380. open_tree_node(false, metadata);
  381. return;
  382. }
  383. }
  384. if (cursor_index().is_valid() && cursor_index().parent().is_valid()) {
  385. set_cursor(cursor_index().parent(), SelectionUpdate::Set);
  386. return;
  387. }
  388. }
  389. if (event.key() == KeyCode::Key_Right) {
  390. if (cursor_index().is_valid() && model()->row_count(cursor_index())) {
  391. if (event.ctrl()) {
  392. expand_tree(cursor_index());
  393. return;
  394. }
  395. auto& metadata = ensure_metadata_for_index(cursor_index());
  396. if (!metadata.open) {
  397. open_tree_node(true, metadata);
  398. return;
  399. }
  400. auto new_cursor = model()->index(0, model()->tree_column(), cursor_index());
  401. set_cursor(new_cursor, SelectionUpdate::Set);
  402. return;
  403. }
  404. }
  405. if (event.key() == KeyCode::Key_Return) {
  406. if (cursor_index().is_valid() && model()->row_count(cursor_index())) {
  407. toggle_index(cursor_index());
  408. return;
  409. }
  410. }
  411. AbstractTableView::keydown_event(event);
  412. }
  413. void TreeView::move_cursor(CursorMovement movement, SelectionUpdate selection_update)
  414. {
  415. auto& model = *this->model();
  416. if (!cursor_index().is_valid())
  417. set_cursor(model.index(0, model.tree_column(), cursor_index()), SelectionUpdate::Set);
  418. auto find_last_index_in_tree = [&](const ModelIndex tree_index) -> ModelIndex {
  419. auto last_index = tree_index;
  420. size_t row_count = model.row_count(last_index);
  421. while (row_count > 0) {
  422. last_index = model.index(row_count - 1, model.tree_column(), last_index);
  423. if (last_index.is_valid()) {
  424. if (model.row_count(last_index) == 0)
  425. break;
  426. auto& metadata = ensure_metadata_for_index(last_index);
  427. if (!metadata.open)
  428. break;
  429. }
  430. row_count = model.row_count(last_index);
  431. }
  432. return last_index;
  433. };
  434. auto step_up = [&](const ModelIndex current_index) -> ModelIndex {
  435. // Traverse into parent index if we're at the top of our subtree
  436. if (current_index.row() == 0) {
  437. auto parent_index = current_index.parent();
  438. if (parent_index.is_valid())
  439. return parent_index;
  440. return current_index;
  441. }
  442. // If previous index is closed, move to it immediately
  443. auto previous_index = model.index(current_index.row() - 1, model.tree_column(), current_index.parent());
  444. if (model.row_count(previous_index) == 0)
  445. return previous_index;
  446. auto& metadata = ensure_metadata_for_index(previous_index);
  447. if (!metadata.open)
  448. return previous_index;
  449. // Return very last index inside of open previous index
  450. return find_last_index_in_tree(previous_index);
  451. };
  452. auto step_down = [&](const ModelIndex current_index) -> ModelIndex {
  453. if (!current_index.is_valid())
  454. return current_index;
  455. // Step in when node is open
  456. if (model.row_count(current_index) > 0) {
  457. auto& metadata = ensure_metadata_for_index(current_index);
  458. if (metadata.open)
  459. return model.index(0, model.tree_column(), current_index);
  460. }
  461. // Find the parent index in which we must step one down
  462. auto child_index = current_index;
  463. auto parent_index = child_index.parent();
  464. int row_count = model.row_count(parent_index);
  465. while (child_index.is_valid() && child_index.row() >= row_count - 1) {
  466. child_index = parent_index;
  467. parent_index = parent_index.parent();
  468. row_count = model.row_count(parent_index);
  469. }
  470. // Step one down
  471. if (!child_index.is_valid())
  472. return current_index;
  473. return model.index(child_index.row() + 1, child_index.column(), parent_index);
  474. };
  475. switch (movement) {
  476. case CursorMovement::Up: {
  477. auto new_index = step_up(cursor_index());
  478. if (new_index.is_valid())
  479. set_cursor(new_index, selection_update);
  480. break;
  481. }
  482. case CursorMovement::Down: {
  483. auto new_index = step_down(cursor_index());
  484. if (new_index.is_valid())
  485. set_cursor(new_index, selection_update);
  486. return;
  487. }
  488. case CursorMovement::Home: {
  489. ModelIndex first_index = model.index(0, model.tree_column(), ModelIndex());
  490. if (first_index.is_valid())
  491. set_cursor(first_index, selection_update);
  492. return;
  493. }
  494. case CursorMovement::End: {
  495. auto last_index = find_last_index_in_tree({});
  496. if (last_index.is_valid())
  497. set_cursor(last_index, selection_update);
  498. return;
  499. }
  500. case CursorMovement::PageUp: {
  501. const int items_per_page = visible_content_rect().height() / row_height();
  502. auto new_index = cursor_index();
  503. for (int step = 0; step < items_per_page; ++step)
  504. new_index = step_up(new_index);
  505. if (new_index.is_valid())
  506. set_cursor(new_index, selection_update);
  507. return;
  508. }
  509. case CursorMovement::PageDown: {
  510. const int items_per_page = visible_content_rect().height() / row_height();
  511. auto new_index = cursor_index();
  512. for (int step = 0; step < items_per_page; ++step)
  513. new_index = step_down(new_index);
  514. if (new_index.is_valid())
  515. set_cursor(new_index, selection_update);
  516. return;
  517. }
  518. case CursorMovement::Left:
  519. case CursorMovement::Right:
  520. // There is no left/right in a treeview, those keys expand/collapse items instead.
  521. break;
  522. }
  523. }
  524. int TreeView::item_count() const
  525. {
  526. int count = 0;
  527. traverse_in_paint_order([&](const ModelIndex&, const Gfx::IntRect&, const Gfx::IntRect&, int) {
  528. ++count;
  529. return IterationDecision::Continue;
  530. });
  531. return count;
  532. }
  533. void TreeView::auto_resize_column(int column)
  534. {
  535. if (!model())
  536. return;
  537. if (!column_header().is_section_visible(column))
  538. return;
  539. auto& model = *this->model();
  540. int header_width = column_header().font().width(model.column_name(column));
  541. if (column == m_key_column && model.is_column_sortable(column))
  542. header_width += font().width(" \xE2\xAC\x86");
  543. int column_width = header_width;
  544. bool is_empty = true;
  545. traverse_in_paint_order([&](const ModelIndex& index, const Gfx::IntRect&, const Gfx::IntRect&, int indent_level) {
  546. auto cell_data = model.index(index.row(), column, index.parent()).data();
  547. int cell_width = 0;
  548. if (cell_data.is_icon()) {
  549. cell_width = cell_data.as_icon().bitmap_for_size(16)->width();
  550. } else if (cell_data.is_bitmap()) {
  551. cell_width = cell_data.as_bitmap().width();
  552. } else if (cell_data.is_valid()) {
  553. cell_width = font().width(cell_data.to_string());
  554. }
  555. if (is_empty && cell_width > 0)
  556. is_empty = false;
  557. if (column == model.tree_column())
  558. cell_width += horizontal_padding() * 2 + indent_level * indent_width_in_pixels() + icon_size() / 2;
  559. column_width = max(column_width, cell_width);
  560. return IterationDecision::Continue;
  561. });
  562. auto default_column_width = column_header().default_section_size(column);
  563. if (is_empty && column_header().is_default_section_size_initialized(column))
  564. column_header().set_section_size(column, default_column_width);
  565. else
  566. column_header().set_section_size(column, column_width);
  567. }
  568. void TreeView::update_column_sizes()
  569. {
  570. if (!model())
  571. return;
  572. auto& model = *this->model();
  573. int column_count = model.column_count();
  574. int tree_column = model.tree_column();
  575. for (int column = 0; column < column_count; ++column) {
  576. if (column == tree_column)
  577. continue;
  578. if (!column_header().is_section_visible(column))
  579. continue;
  580. int header_width = column_header().font().width(model.column_name(column));
  581. if (column == m_key_column && model.is_column_sortable(column))
  582. header_width += font().width(" \xE2\xAC\x86");
  583. int column_width = header_width;
  584. traverse_in_paint_order([&](const ModelIndex& index, const Gfx::IntRect&, const Gfx::IntRect&, int) {
  585. auto cell_data = model.index(index.row(), column, index.parent()).data();
  586. int cell_width = 0;
  587. if (cell_data.is_icon()) {
  588. cell_width = cell_data.as_icon().bitmap_for_size(16)->width();
  589. } else if (cell_data.is_bitmap()) {
  590. cell_width = cell_data.as_bitmap().width();
  591. } else if (cell_data.is_valid()) {
  592. cell_width = font().width(cell_data.to_string());
  593. }
  594. column_width = max(column_width, cell_width);
  595. return IterationDecision::Continue;
  596. });
  597. set_column_width(column, max(this->column_width(column), column_width));
  598. }
  599. int tree_column_header_width = column_header().font().width(model.column_name(tree_column));
  600. if (tree_column == m_key_column && model.is_column_sortable(tree_column))
  601. tree_column_header_width += font().width(" \xE2\xAC\x86");
  602. int tree_column_width = tree_column_header_width;
  603. traverse_in_paint_order([&](const ModelIndex& index, const Gfx::IntRect&, const Gfx::IntRect&, int indent_level) {
  604. auto cell_data = model.index(index.row(), tree_column, index.parent()).data();
  605. int cell_width = 0;
  606. if (cell_data.is_valid()) {
  607. cell_width = font().width(cell_data.to_string());
  608. cell_width += horizontal_padding() * 2 + indent_level * indent_width_in_pixels() + icon_size() / 2;
  609. }
  610. tree_column_width = max(tree_column_width, cell_width);
  611. return IterationDecision::Continue;
  612. });
  613. set_column_width(tree_column, tree_column_width);
  614. }
  615. int TreeView::tree_column_x_offset() const
  616. {
  617. int tree_column = model()->tree_column();
  618. int offset = 0;
  619. for (int i = 0; i < tree_column; ++i) {
  620. if (column_header().is_section_visible(i)) {
  621. offset += column_width(i);
  622. offset += horizontal_padding() * 2;
  623. }
  624. }
  625. return offset;
  626. }
  627. Gfx::IntRect TreeView::content_rect(ModelIndex const& index) const
  628. {
  629. if (!index.is_valid())
  630. return {};
  631. Gfx::IntRect found_rect;
  632. traverse_in_paint_order([&](ModelIndex const& current_index, Gfx::IntRect const& rect, Gfx::IntRect const&, int) {
  633. if (index == current_index) {
  634. found_rect = rect;
  635. return IterationDecision::Break;
  636. }
  637. return IterationDecision::Continue;
  638. });
  639. return found_rect;
  640. }
  641. }