From e8de3adc50e0c18c001f645aa27474b940675cf7 Mon Sep 17 00:00:00 2001
From: Alexander Montag <mail@alexander-montag.de>
Date: Sun, 29 Sep 2024 16:43:48 +0000
Subject: [PATCH] Improve formatting of TreeSearch

---
 editor/tree_search.cpp | 10 ++++++----
 1 file changed, 6 insertions(+), 4 deletions(-)

diff --git a/editor/tree_search.cpp b/editor/tree_search.cpp
index b026253..df5b76e 100644
--- a/editor/tree_search.cpp
+++ b/editor/tree_search.cpp
@@ -356,12 +356,13 @@ void TreeSearch::_select_next_match() {
 	if (matching_entries.size() == 0) {
 		return;
 	}
-	TreeItem *selected = tree_reference->get_selected(); // we care about a single item here.
+	TreeItem *selected = tree_reference->get_selected();
 	if (!selected) {
 		_select_first_match();
 		return;
 	}
 
+	// find [selected_idx] among ordered_tree_items
 	int selected_idx = -1;
 	for (int i = 0; i < ordered_tree_items.size(); i++) {
 		if (ordered_tree_items[i] == selected) {
@@ -370,7 +371,7 @@ void TreeSearch::_select_next_match() {
 		}
 	}
 
-	// find the best fitting entry.
+	// find first entry after [selected_idx].
 	for (int i = MAX(0, selected_idx) + 1; i < ordered_tree_items.size(); i++) {
 		TreeItem *item = ordered_tree_items[i];
 		if (_vector_has_bsearch(matching_entries, item)) {
@@ -378,7 +379,8 @@ void TreeSearch::_select_next_match() {
 			return;
 		}
 	}
-	_select_first_match(); // wrap around.
+	// wrap around.
+	_select_first_match();
 }
 
 template <typename T>
@@ -511,7 +513,7 @@ TreeSearchPanel::TreeSearchPanel() {
 	set_visible(false);
 }
 
-TreeSearch::TreeSearchMode TreeSearchPanel::get_search_mode() const{
+TreeSearch::TreeSearchMode TreeSearchPanel::get_search_mode() const {
 	if (!check_button_filter_highlight || !check_button_filter_highlight->is_pressed()) {
 		return TreeSearch::TreeSearchMode::HIGHLIGHT;
 	}