botaccount
/
limboai
mirror of https://github.com/limbonaut/limboai.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Address set_text in THEME_CHANGED, address inconsistency

This commit is contained in:
Alexander Montag 2024-09-28 19:11:59 +02:00
parent cd85e6dd30
commit 62460496e4
2 changed files with 13 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
editor/tree_search.cpp
View File

@ -49,8 +49,6 @@ void TreeSearchPanel::_initialize_controls() {
line_edit_search->set_placeholder(TTR("Search tree")); line_edit_search->set_placeholder(TTR("Search tree"));
label_filter->set_text(TTR("Filter"));
close_button->set_theme_type_variation("FlatButton"); close_button->set_theme_type_variation("FlatButton");
// positioning and sizing // positioning and sizing
@ -95,6 +93,9 @@ void TreeSearchPanel::_notification(int p_what) {
line_edit_search->connect("text_submitted", c_text_submitted.unbind(1)); line_edit_search->connect("text_submitted", c_text_submitted.unbind(1));
break; break;
} }
case NOTIFICATION_THEME_CHANGED: {
label_filter->set_text(TTR("Filter"));
}
} }
} }
@ -263,7 +264,8 @@ void TreeSearch::_draw_highlight_item(TreeItem *p_tree_item, Rect2 p_rect, Calla
void TreeSearch::_update_matching_entries(const String &p_search_mask) { void TreeSearch::_update_matching_entries(const String &p_search_mask) {
Vector<TreeItem *> accum; Vector<TreeItem *> accum;
matching_entries = _find_matching_entries(tree_reference->get_root(), p_search_mask, accum); _find_matching_entries(tree_reference->get_root(), p_search_mask, accum);
matching_entries = accum;
} }
/* this linearizes the tree into [ordered_tree_items] like so: /* this linearizes the tree into [ordered_tree_items] like so:
@ -306,13 +308,14 @@ String TreeSearch::_get_search_mask() {
return search_panel->get_text(); return search_panel->get_text();
} }
Vector<TreeItem *> TreeSearch::_find_matching_entries(TreeItem *p_tree_item, const String &p_search_mask, Vector<TreeItem *> &p_accum) { void TreeSearch::_find_matching_entries(TreeItem *p_tree_item, const String &p_search_mask, Vector<TreeItem *> &p_accum) {
if (!p_tree_item) if (!p_tree_item) {
return p_accum; return;
}
StringSearchIndices item_search_indices = _substring_bounds(p_tree_item->get_text(0), p_search_mask); StringSearchIndices item_search_indices = _substring_bounds(p_tree_item->get_text(0), p_search_mask);
if (item_search_indices.hit()) if (item_search_indices.hit()) {
p_accum.push_back(p_tree_item); p_accum.push_back(p_tree_item);
}
for (int i = 0; i < p_tree_item->get_child_count(); i++) { for (int i = 0; i < p_tree_item->get_child_count(); i++) {
TreeItem *child = p_tree_item->get_child(i); TreeItem *child = p_tree_item->get_child(i);
_find_matching_entries(child, p_search_mask, p_accum); _find_matching_entries(child, p_search_mask, p_accum);
@ -323,7 +326,7 @@ Vector<TreeItem *> TreeSearch::_find_matching_entries(TreeItem *p_tree_item, con
p_accum.sort(); p_accum.sort();
} }
return p_accum; return;
} }
// Returns the lower and upper bounds of a substring. Does fuzzy search: Simply looks if words exist in right ordering. // Returns the lower and upper bounds of a substring. Does fuzzy search: Simply looks if words exist in right ordering.

2
editor/tree_search.h
View File

@ -69,7 +69,7 @@ private:
void _update_ordered_tree_items(TreeItem *p_tree_item); void _update_ordered_tree_items(TreeItem *p_tree_item);
void _update_number_matches(); void _update_number_matches();
Vector<TreeItem *> _find_matching_entries(TreeItem *p_tree_item, const String &p_search_mask, Vector<TreeItem *> &p_buffer); void _find_matching_entries(TreeItem *p_tree_item, const String &p_search_mask, Vector<TreeItem *> &p_accum);
String _get_search_mask(); String _get_search_mask();
StringSearchIndices _substring_bounds(const String &p_searchable, const String &p_search_mask) const; StringSearchIndices _substring_bounds(const String &p_searchable, const String &p_search_mask) const;