limboai/editor/task_tree.cpp

618 lines
20 KiB
C++
Raw Normal View History

2023-08-26 08:24:08 +00:00
/**
* task_tree.cpp
* =============================================================================
2024-03-21 20:38:57 +00:00
* Copyright 2021-2024 Serhii Snitsaruk
2023-08-26 08:24:08 +00:00
*
* Use of this source code is governed by an MIT-style
* license that can be found in the LICENSE file or at
* https://opensource.org/licenses/MIT.
* =============================================================================
*/
#ifdef TOOLS_ENABLED
2023-08-26 08:24:08 +00:00
#include "task_tree.h"
2024-01-07 20:04:18 +00:00
#include "../bt/tasks/bt_comment.h"
#include "../bt/tasks/composites/bt_probability_selector.h"
2024-01-09 12:34:24 +00:00
#include "../util/limbo_compat.h"
2024-01-07 20:04:18 +00:00
#include "../util/limbo_utility.h"
2024-09-19 21:35:14 +00:00
#include "tree_search.h"
2023-08-26 08:24:08 +00:00
2024-01-07 20:04:18 +00:00
#ifdef LIMBOAI_MODULE
2023-10-28 11:09:03 +00:00
#include "core/object/script_language.h"
#include "editor/themes/editor_scale.h"
2024-09-11 03:05:38 +00:00
#include "scene/gui/box_container.h"
#include "scene/gui/label.h"
2024-09-25 16:17:44 +00:00
#include "scene/gui/texture_rect.h"
2024-01-07 20:04:18 +00:00
#endif // LIMBOAI_MODULE
#ifdef LIMBOAI_GDEXTENSION
2024-01-09 12:34:24 +00:00
#include <godot_cpp/classes/editor_interface.hpp>
2024-09-11 03:05:38 +00:00
#include <godot_cpp/classes/h_box_container.hpp>
#include <godot_cpp/classes/label.hpp>
2024-09-25 16:17:44 +00:00
#include <godot_cpp/classes/script.hpp>
#include <godot_cpp/classes/texture_rect.hpp>
#include <godot_cpp/classes/v_box_container.hpp>
2024-01-07 20:04:18 +00:00
using namespace godot;
#endif // LIMBOAI_GDEXTENSION
2023-08-26 08:24:08 +00:00
//**** TaskTree
TreeItem *TaskTree::_create_tree(const Ref<BTTask> &p_task, TreeItem *p_parent, int p_idx) {
ERR_FAIL_COND_V(p_task.is_null(), nullptr);
TreeItem *item = tree->create_item(p_parent, p_idx);
item->set_metadata(0, p_task);
for (int i = 0; i < p_task->get_child_count(); i++) {
_create_tree(p_task->get_child(i), item);
}
_update_item(item);
// update TreeSearch if root task was created
if (tree->get_root() == item){
tree_search->update_search(tree);
}
2023-08-26 08:24:08 +00:00
return item;
}
void TaskTree::_update_item(TreeItem *p_item) {
if (p_item == nullptr) {
return;
}
if (p_item->get_parent()) {
Ref<BTProbabilitySelector> sel = p_item->get_parent()->get_metadata(0);
if (sel.is_valid() && sel->has_probability(p_item->get_index())) {
p_item->set_custom_draw_callback(0, callable_mp(this, &TaskTree::_draw_probability));
p_item->set_cell_mode(0, TreeItem::CELL_MODE_CUSTOM);
}
}
2023-08-26 08:24:08 +00:00
Ref<BTTask> task = p_item->get_metadata(0);
ERR_FAIL_COND_MSG(!task.is_valid(), "Invalid task reference in metadata.");
p_item->set_text(0, task->get_task_name());
2024-01-07 20:04:18 +00:00
if (IS_CLASS(task, BTComment)) {
2023-08-29 09:07:18 +00:00
p_item->set_custom_font(0, theme_cache.comment_font);
p_item->set_custom_color(0, theme_cache.comment_color);
2023-08-26 08:24:08 +00:00
} else if (task->get_custom_name().is_empty()) {
2023-08-29 09:07:18 +00:00
p_item->set_custom_font(0, theme_cache.normal_name_font);
2023-08-26 08:24:08 +00:00
p_item->clear_custom_color(0);
} else {
2023-08-29 09:07:18 +00:00
p_item->set_custom_font(0, theme_cache.custom_name_font);
2023-08-26 08:24:08 +00:00
// p_item->set_custom_color(0, get_theme_color(SNAME("warning_color"), SNAME("Editor")));
}
String type_arg;
2024-01-07 20:04:18 +00:00
if (task->get_script() != Variant()) {
Ref<Script> sc = task->get_script();
if (sc.is_valid()) {
type_arg = sc->get_path();
}
2024-01-07 20:04:18 +00:00
}
if (type_arg.is_empty()) {
2023-08-26 08:24:08 +00:00
type_arg = task->get_class();
}
p_item->set_icon(0, LimboUtility::get_singleton()->get_task_icon(type_arg));
p_item->set_icon_max_width(0, 16 * EDSCALE);
p_item->set_editable(0, false);
p_item->set_collapsed(task->is_displayed_collapsed());
2023-08-26 08:24:08 +00:00
for (int i = 0; i < p_item->get_button_count(0); i++) {
p_item->erase_button(0, i);
}
PackedStringArray warnings = task->get_configuration_warnings();
String warning_text;
for (int j = 0; j < warnings.size(); j++) {
if (j > 0) {
warning_text += "\n";
}
warning_text += warnings[j];
}
if (!warning_text.is_empty()) {
2023-08-29 09:07:18 +00:00
p_item->add_button(0, theme_cache.task_warning_icon, 0, false, warning_text);
2023-08-26 08:24:08 +00:00
}
2024-09-25 15:32:03 +00:00
tree_search->on_item_edited(p_item); // this is necessary to preserve custom drawing from tree search.
2023-08-26 08:24:08 +00:00
}
void TaskTree::_update_tree() {
2024-09-11 03:38:05 +00:00
Vector<Ref<BTTask>> selection = get_selected_tasks();
2023-08-26 08:24:08 +00:00
tree->clear();
if (bt.is_null()) {
return;
}
if (bt->get_root_task().is_valid()) {
updating_tree = true;
2023-08-26 08:24:08 +00:00
_create_tree(bt->get_root_task(), nullptr);
updating_tree = false;
2023-08-26 08:24:08 +00:00
}
2024-09-11 03:38:05 +00:00
for (const Ref<BTTask> &task : selection) {
add_selection(task);
2023-08-26 08:24:08 +00:00
}
}
TreeItem *TaskTree::_find_item(const Ref<BTTask> &p_task) const {
if (p_task.is_null()) {
return nullptr;
}
TreeItem *item = tree->get_root();
List<TreeItem *> stack;
while (item && item->get_metadata(0) != p_task) {
if (item->get_child_count() > 0) {
stack.push_back(item->get_first_child());
}
item = item->get_next();
if (item == nullptr && !stack.is_empty()) {
item = stack.front()->get();
stack.pop_front();
}
}
return item;
}
void TaskTree::_on_item_mouse_selected(const Vector2 &p_pos, MouseButton p_button_index) {
2024-01-09 12:34:24 +00:00
if (p_button_index == LW_MBTN(LEFT)) {
Rect2 rect = get_selected_probability_rect();
if (rect != Rect2() && rect.has_point(p_pos)) {
2024-01-09 12:42:54 +00:00
emit_signal(LW_NAME(probability_clicked));
}
2024-01-09 12:34:24 +00:00
} else if (p_button_index == LW_MBTN(RIGHT)) {
2024-01-09 12:42:54 +00:00
emit_signal(LW_NAME(rmb_pressed), get_screen_position() + p_pos);
2023-08-26 08:24:08 +00:00
}
}
void TaskTree::_on_item_selected() {
Callable on_task_changed = callable_mp(this, &TaskTree::_on_task_changed);
if (last_selected.is_valid()) {
update_task(last_selected);
2024-01-09 12:42:54 +00:00
if (last_selected->is_connected(LW_NAME(changed), on_task_changed)) {
last_selected->disconnect(LW_NAME(changed), on_task_changed);
2023-08-26 08:24:08 +00:00
}
}
last_selected = get_selected();
2024-01-09 12:42:54 +00:00
last_selected->connect(LW_NAME(changed), on_task_changed);
emit_signal(LW_NAME(task_selected), last_selected);
2023-08-26 08:24:08 +00:00
}
void TaskTree::_on_item_activated() {
2024-01-09 12:42:54 +00:00
emit_signal(LW_NAME(task_activated));
2023-08-26 08:24:08 +00:00
}
void TaskTree::_on_item_collapsed(Object *p_obj) {
if (updating_tree) {
return;
}
TreeItem *item = Object::cast_to<TreeItem>(p_obj);
if (!item) {
return;
}
Ref<BTTask> task = item->get_metadata(0);
ERR_FAIL_NULL(task);
task->set_display_collapsed(item->is_collapsed());
}
2023-08-26 08:24:08 +00:00
void TaskTree::_on_task_changed() {
_update_item(tree->get_selected());
}
void TaskTree::load_bt(const Ref<BehaviorTree> &p_behavior_tree) {
ERR_FAIL_COND_MSG(p_behavior_tree.is_null(), "Tried to load a null tree.");
Callable on_task_changed = callable_mp(this, &TaskTree::_on_task_changed);
2024-01-09 12:42:54 +00:00
if (last_selected.is_valid() && last_selected->is_connected(LW_NAME(changed), on_task_changed)) {
last_selected->disconnect(LW_NAME(changed), on_task_changed);
2023-08-26 08:24:08 +00:00
}
bt = p_behavior_tree;
tree->clear();
probability_rect_cache.clear();
2023-08-26 08:24:08 +00:00
if (bt->get_root_task().is_valid()) {
updating_tree = true;
2023-08-26 08:24:08 +00:00
_create_tree(bt->get_root_task(), nullptr);
updating_tree = false;
2023-08-26 08:24:08 +00:00
}
}
void TaskTree::unload() {
Callable on_task_changed = callable_mp(this, &TaskTree::_on_task_changed);
2024-01-09 12:42:54 +00:00
if (last_selected.is_valid() && last_selected->is_connected(LW_NAME(changed), on_task_changed)) {
last_selected->disconnect(LW_NAME(changed), on_task_changed);
2023-08-26 08:24:08 +00:00
}
bt.unref();
2023-08-26 08:24:08 +00:00
tree->clear();
}
void TaskTree::update_task(const Ref<BTTask> &p_task) {
ERR_FAIL_COND(p_task.is_null());
TreeItem *item = _find_item(p_task);
if (item) {
_update_item(item);
}
}
2024-09-11 03:38:05 +00:00
void TaskTree::add_selection(const Ref<BTTask> &p_task) {
ERR_FAIL_COND(p_task.is_null());
TreeItem *item = _find_item(p_task);
if (item) {
item->select(0);
}
}
void TaskTree::remove_selection(const Ref<BTTask> &p_task) {
ERR_FAIL_COND(p_task.is_null());
TreeItem *item = _find_item(p_task);
if (item) {
item->deselect(0);
}
}
2023-08-26 08:24:08 +00:00
Ref<BTTask> TaskTree::get_selected() const {
if (tree->get_selected()) {
return tree->get_selected()->get_metadata(0);
}
return nullptr;
}
2024-09-11 03:38:05 +00:00
Vector<Ref<BTTask>> TaskTree::get_selected_tasks() const {
Vector<Ref<BTTask>> selected_tasks;
TreeItem *next = tree->get_next_selected(nullptr);
while (next) {
Ref<BTTask> task = next->get_metadata(0);
if (task.is_valid()) {
selected_tasks.push_back(task);
}
next = tree->get_next_selected(next);
}
return selected_tasks;
}
void TaskTree::clear_selection() {
2024-09-13 17:24:52 +00:00
tree->deselect_all();
2023-08-26 08:24:08 +00:00
}
Rect2 TaskTree::get_selected_probability_rect() const {
if (tree->get_selected() == nullptr) {
return Rect2();
}
2024-01-07 20:04:18 +00:00
RECT_CACHE_KEY key = tree->get_selected()->get_instance_id();
if (unlikely(!probability_rect_cache.has(key))) {
return Rect2();
} else {
return probability_rect_cache[key];
}
}
double TaskTree::get_selected_probability_weight() const {
Ref<BTTask> selected = get_selected();
ERR_FAIL_COND_V(selected.is_null(), 0.0);
Ref<BTProbabilitySelector> probability_selector = selected->get_parent();
ERR_FAIL_COND_V(probability_selector.is_null(), 0.0);
return probability_selector->get_weight(selected->get_index());
}
double TaskTree::get_selected_probability_percent() const {
Ref<BTTask> selected = get_selected();
ERR_FAIL_COND_V(selected.is_null(), 0.0);
Ref<BTProbabilitySelector> probability_selector = selected->get_parent();
ERR_FAIL_COND_V(probability_selector.is_null(), 0.0);
return probability_selector->get_probability(selected->get_index()) * 100.0;
}
bool TaskTree::selected_has_probability() const {
bool result = false;
Ref<BTTask> selected = get_selected();
2024-01-07 20:04:18 +00:00
if (selected.is_valid() && !IS_CLASS(selected, BTComment)) {
Ref<BTProbabilitySelector> probability_selector = selected->get_parent();
result = probability_selector.is_valid();
}
return result;
}
2023-08-26 08:24:08 +00:00
Variant TaskTree::_get_drag_data_fw(const Point2 &p_point) {
if (editable && tree->get_item_at_position(p_point)) {
TypedArray<BTTask> selected_tasks;
Vector<Ref<Texture2D>> icons;
TreeItem *next = tree->get_next_selected(nullptr);
while (next) {
Ref<BTTask> task = next->get_metadata(0);
if (task.is_valid()) {
selected_tasks.push_back(task);
icons.push_back(next->get_icon(0));
}
next = tree->get_next_selected(next);
}
if (selected_tasks.is_empty()) {
return Variant();
}
2024-09-11 03:05:38 +00:00
VBoxContainer *vb = memnew(VBoxContainer);
int list_max = 10;
float opacity_step = 1.0f / list_max;
float opacity_item = 1.0f;
for (int i = 0; i < selected_tasks.size(); i++) {
Ref<BTTask> task = Object::cast_to<BTTask>(selected_tasks[i]);
if (i < list_max) {
HBoxContainer *hb = memnew(HBoxContainer);
TextureRect *tf = memnew(TextureRect);
int icon_size = get_theme_constant(LW_NAME(class_icon_size), LW_NAME(Editor));
tf->set_custom_minimum_size(Size2(icon_size, icon_size));
tf->set_stretch_mode(TextureRect::STRETCH_KEEP_ASPECT_CENTERED);
tf->set_expand_mode(TextureRect::EXPAND_IGNORE_SIZE);
tf->set_texture(icons[i]);
hb->add_child(tf);
Label *label = memnew(Label);
label->set_text(task->get_task_name());
hb->add_child(label);
vb->add_child(hb);
hb->set_modulate(Color(1, 1, 1, opacity_item));
opacity_item -= opacity_step;
}
}
set_drag_preview(vb);
2024-09-11 03:38:05 +00:00
2023-08-26 08:24:08 +00:00
Dictionary drag_data;
drag_data["type"] = "task";
drag_data["tasks"] = selected_tasks;
2023-08-26 08:24:08 +00:00
tree->set_drop_mode_flags(Tree::DROP_MODE_INBETWEEN | Tree::DROP_MODE_ON_ITEM);
return drag_data;
}
return Variant();
}
bool TaskTree::_can_drop_data_fw(const Point2 &p_point, const Variant &p_data) const {
if (!editable) {
return false;
}
Dictionary d = p_data;
if (!d.has("type") || !d.has("tasks")) {
2023-08-26 08:24:08 +00:00
return false;
}
int section = tree->get_drop_section_at_position(p_point);
TreeItem *item = tree->get_item_at_position(p_point);
2023-08-28 14:22:44 +00:00
if (!item || section < -1) {
return false;
}
2024-09-13 17:24:52 +00:00
if (!item->get_parent() && section < 0) { // Before root item.
2023-08-26 08:24:08 +00:00
return false;
}
if (String(d["type"]) == "task") {
TypedArray<BTTask> tasks = d["tasks"];
if (tasks.is_empty()) {
return false; // No tasks.
}
2024-09-13 17:24:52 +00:00
Ref<BTTask> to_task = item->get_metadata(0);
int to_pos = -1;
int type = tree->get_drop_section_at_position(p_point);
_normalize_drop(item, type, to_pos, to_task);
if (to_task.is_null()) {
return false; // Outside root.
}
2024-09-11 03:05:38 +00:00
for (int i = 0; i < tasks.size(); i++) {
Ref<BTTask> task = tasks[i];
2024-09-13 17:24:52 +00:00
if (to_task->is_descendant_of(task) || task == to_task) {
return false; // Don't drop as child of selected tasks.
}
2023-08-26 08:24:08 +00:00
}
}
return true;
2023-08-26 08:24:08 +00:00
}
void TaskTree::_drop_data_fw(const Point2 &p_point, const Variant &p_data) {
Dictionary d = p_data;
2024-09-13 17:24:52 +00:00
if (!d.has("tasks")) {
return;
}
2023-08-26 08:24:08 +00:00
TreeItem *item = tree->get_item_at_position(p_point);
int type = tree->get_drop_section_at_position(p_point);
ERR_FAIL_NULL(item);
ERR_FAIL_COND(type < -1 || type > 1);
2024-09-13 17:24:52 +00:00
// The drop behavior depends on the TreeItem's state.
// Normalize and emit the parent task and position instead of exposing TreeItem.
int to_pos = -1;
Ref<BTTask> to_task = item->get_metadata(0);
ERR_FAIL_COND(to_task.is_null());
_normalize_drop(item, type, to_pos, to_task);
emit_signal(LW_NAME(tasks_dragged), d["tasks"], to_task, to_pos);
}
2024-09-13 17:24:52 +00:00
void TaskTree::_normalize_drop(TreeItem *item, int type, int &to_pos, Ref<BTTask> &to_task) const {
switch (type) {
case 0: // Drop as last child of target.
to_pos = to_task->get_child_count();
break;
case -1: // Drop above target.
ERR_FAIL_COND_MSG(to_task->get_parent().is_null(), "Cannot perform drop above the root task!");
to_pos = to_task->get_index();
{
Vector<Ref<BTTask>> selected = get_selected_tasks();
2024-09-25 16:17:44 +00:00
if (to_task == selected[selected.size() - 1]) {
2024-09-13 17:24:52 +00:00
to_pos += 1;
}
}
to_task = to_task->get_parent();
break;
case 1: // Drop below target.
if (item->get_child_count() == 0) {
to_pos = to_task->get_index() + 1;
if (to_task == tree->get_next_selected(nullptr)->get_metadata(0)) {
to_pos -= 1;
}
to_task = to_task->get_parent();
break;
2024-09-13 17:24:52 +00:00
}
2024-09-13 17:24:52 +00:00
if (to_task->get_parent().is_null() || !item->is_collapsed()) { // Insert as first child of target.
to_pos = 0;
} else { // Insert as sibling of target.
TreeItem *lower_sibling = nullptr;
for (int i = to_task->get_index() + 1; i < to_task->get_parent()->get_child_count(); i++) {
TreeItem *c = item->get_parent()->get_child(i);
if (c->is_visible_in_tree()) {
lower_sibling = c;
break;
}
}
2024-09-13 17:24:52 +00:00
if (lower_sibling) {
to_pos = lower_sibling->get_index();
}
to_task = to_task->get_parent();
}
break;
2023-08-26 08:24:08 +00:00
}
}
void TaskTree::_draw_probability(Object *item_obj, Rect2 rect) {
TreeItem *item = Object::cast_to<TreeItem>(item_obj);
if (!item) {
return;
}
Ref<BTProbabilitySelector> sel = item->get_parent()->get_metadata(0);
if (sel.is_null()) {
return;
}
String text = rtos(Math::snapped(sel->get_probability(item->get_index()) * 100, 0.01)) + "%";
Size2 text_size = theme_cache.probability_font->get_string_size(text, HORIZONTAL_ALIGNMENT_LEFT, -1, theme_cache.probability_font_size);
Rect2 prob_rect = rect;
prob_rect.position.x += theme_cache.name_font->get_string_size(item->get_text(0), HORIZONTAL_ALIGNMENT_LEFT, -1, theme_cache.name_font_size).x;
prob_rect.position.x += EDSCALE * 40.0;
prob_rect.size.x = text_size.x + EDSCALE * 12;
prob_rect.position.y += 4 * EDSCALE;
prob_rect.size.y -= 8 * EDSCALE;
probability_rect_cache[item->get_instance_id()] = prob_rect; // Cache rect for later click detection.
theme_cache.probability_bg->draw(tree->get_canvas_item(), prob_rect);
Point2 text_pos = prob_rect.position;
text_pos.y += text_size.y + (prob_rect.size.y - text_size.y) * 0.5;
text_pos.y -= theme_cache.probability_font->get_descent(theme_cache.probability_font_size);
text_pos.y = Math::floor(text_pos.y);
tree->draw_string(theme_cache.probability_font, text_pos, text, HORIZONTAL_ALIGNMENT_CENTER,
prob_rect.size.x, theme_cache.probability_font_size, theme_cache.probability_font_color);
}
2024-01-07 20:04:18 +00:00
void TaskTree::_do_update_theme_item_cache() {
2024-01-09 12:42:54 +00:00
theme_cache.name_font = get_theme_font(LW_NAME(font));
theme_cache.custom_name_font = get_theme_font(LW_NAME(bold), LW_NAME(EditorFonts));
theme_cache.comment_font = get_theme_font(LW_NAME(doc_italic), LW_NAME(EditorFonts));
theme_cache.probability_font = get_theme_font(LW_NAME(font));
2024-01-09 12:42:54 +00:00
theme_cache.name_font_size = get_theme_font_size(LW_NAME(font_size));
theme_cache.probability_font_size = Math::floor(get_theme_font_size(LW_NAME(font_size)) * 0.9);
2023-08-29 09:07:18 +00:00
2024-01-09 12:42:54 +00:00
theme_cache.task_warning_icon = get_theme_icon(LW_NAME(NodeWarning), LW_NAME(EditorIcons));
2023-08-29 09:07:18 +00:00
2024-01-09 12:42:54 +00:00
theme_cache.comment_color = get_theme_color(LW_NAME(disabled_font_color), LW_NAME(Editor));
theme_cache.probability_font_color = get_theme_color(LW_NAME(font_color), LW_NAME(Editor));
theme_cache.probability_bg.instantiate();
2024-01-09 12:42:54 +00:00
theme_cache.probability_bg->set_bg_color(get_theme_color(LW_NAME(accent_color), LW_NAME(Editor)) * Color(1, 1, 1, 0.25));
theme_cache.probability_bg->set_corner_radius_all(12.0 * EDSCALE);
2023-08-29 09:07:18 +00:00
}
2023-08-26 08:24:08 +00:00
void TaskTree::_notification(int p_what) {
switch (p_what) {
2024-01-09 12:34:24 +00:00
case NOTIFICATION_READY: {
tree->connect("item_mouse_selected", callable_mp(this, &TaskTree::_on_item_mouse_selected));
// Note: CONNECT_DEFERRED is needed to avoid double updates with set_allow_reselect(true), which breaks folding/unfolding.
tree->connect("multi_selected", callable_mp(this, &TaskTree::_on_item_selected).unbind(3), CONNECT_DEFERRED);
2024-01-09 12:34:24 +00:00
tree->connect("item_activated", callable_mp(this, &TaskTree::_on_item_activated));
tree->connect("item_collapsed", callable_mp(this, &TaskTree::_on_item_collapsed));
tree_search_panel->connect("update_requested", callable_mp(this, &TaskTree::_update_tree));
tree_search_panel->connect("visibility_changed", callable_mp(this, &TaskTree::_update_tree));
2024-01-09 12:34:24 +00:00
} break;
2023-08-26 08:24:08 +00:00
case NOTIFICATION_THEME_CHANGED: {
2024-01-07 20:04:18 +00:00
_do_update_theme_item_cache();
2023-08-26 08:24:08 +00:00
_update_tree();
} break;
}
2023-08-26 08:24:08 +00:00
}
void TaskTree::_bind_methods() {
ClassDB::bind_method(D_METHOD("load_bt", "behavior_tree"), &TaskTree::load_bt);
2023-08-26 08:24:08 +00:00
ClassDB::bind_method(D_METHOD("get_bt"), &TaskTree::get_bt);
ClassDB::bind_method(D_METHOD("update_tree"), &TaskTree::update_tree);
ClassDB::bind_method(D_METHOD("update_task", "task"), &TaskTree::update_task);
2024-09-11 03:38:05 +00:00
ClassDB::bind_method(D_METHOD("add_selection", "task"), &TaskTree::add_selection);
ClassDB::bind_method(D_METHOD("remove_selection", "task"), &TaskTree::remove_selection);
2023-08-26 08:24:08 +00:00
ClassDB::bind_method(D_METHOD("get_selected"), &TaskTree::get_selected);
2024-09-11 03:38:05 +00:00
ClassDB::bind_method(D_METHOD("clear_selection"), &TaskTree::clear_selection);
2023-08-26 08:24:08 +00:00
ClassDB::bind_method(D_METHOD("_get_drag_data_fw"), &TaskTree::_get_drag_data_fw);
ClassDB::bind_method(D_METHOD("_can_drop_data_fw"), &TaskTree::_can_drop_data_fw);
ClassDB::bind_method(D_METHOD("_drop_data_fw"), &TaskTree::_drop_data_fw);
ClassDB::bind_method(D_METHOD("_draw_probability"), &TaskTree::_draw_probability);
2023-08-26 08:24:08 +00:00
ADD_SIGNAL(MethodInfo("rmb_pressed"));
ADD_SIGNAL(MethodInfo("task_selected"));
ADD_SIGNAL(MethodInfo("task_activated"));
ADD_SIGNAL(MethodInfo("probability_clicked"));
2024-09-11 03:05:38 +00:00
ADD_SIGNAL(MethodInfo("tasks_dragged", PropertyInfo(Variant::ARRAY, "tasks", PROPERTY_HINT_ARRAY_TYPE, RESOURCE_TYPE_HINT("BTTask")),
PropertyInfo(Variant::OBJECT, "to_task", PROPERTY_HINT_RESOURCE_TYPE, "BTTask"),
PropertyInfo(Variant::INT, "type")));
2023-08-26 08:24:08 +00:00
}
2024-09-25 15:32:03 +00:00
void TaskTree::tree_search_show_and_focus() {
ERR_FAIL_NULL(tree_search);
tree_search_panel->show_and_focus();
2024-09-25 15:32:03 +00:00
}
2023-08-26 08:24:08 +00:00
TaskTree::TaskTree() {
editable = true;
updating_tree = false;
2024-09-25 16:17:44 +00:00
2024-09-19 21:35:14 +00:00
// for Tree + TreeSearch, we want a VBoxContainer. For now, rather than changing this classes type, let's do nesting:
// TaskTree -> VBoxContainer -> [Tree, TreeSearchPanel]
2024-09-25 16:17:44 +00:00
VBoxContainer *vbox_container = memnew(VBoxContainer);
2024-09-19 21:35:14 +00:00
add_child(vbox_container);
vbox_container->set_anchors_preset(PRESET_FULL_RECT);
2024-09-25 16:17:44 +00:00
2023-08-26 08:24:08 +00:00
tree = memnew(Tree);
2024-09-19 21:35:14 +00:00
tree->set_v_size_flags(Control::SIZE_EXPAND_FILL);
vbox_container->add_child(tree);
2023-08-26 08:24:08 +00:00
tree->set_columns(2);
tree->set_column_expand(0, true);
tree->set_column_expand(1, false);
tree->set_anchor(SIDE_RIGHT, ANCHOR_END);
tree->set_anchor(SIDE_BOTTOM, ANCHOR_END);
tree->set_allow_rmb_select(true);
tree->set_allow_reselect(true);
tree->set_select_mode(Tree::SelectMode::SELECT_MULTI);
2023-08-26 08:24:08 +00:00
tree->set_drag_forwarding(callable_mp(this, &TaskTree::_get_drag_data_fw), callable_mp(this, &TaskTree::_can_drop_data_fw), callable_mp(this, &TaskTree::_drop_data_fw));
2024-09-25 16:17:44 +00:00
tree_search_panel = memnew(TreeSearchPanel);
tree_search = Ref(memnew(TreeSearch(tree_search_panel)));
vbox_container->add_child(tree_search_panel);
2023-08-26 08:24:08 +00:00
}
TaskTree::~TaskTree() {
Callable on_task_changed = callable_mp(this, &TaskTree::_on_task_changed);
2024-01-09 12:42:54 +00:00
if (last_selected.is_valid() && last_selected->is_connected(LW_NAME(changed), on_task_changed)) {
last_selected->disconnect(LW_NAME(changed), on_task_changed);
2023-08-26 08:24:08 +00:00
}
}
#endif // ! TOOLS_ENABLED