virtualx-engine/scene/gui/box_container.cpp

321 lines
8.6 KiB
C++
Raw Normal View History

2014-02-10 02:10:30 +01:00
/*************************************************************************/
/* box_container.cpp */
/*************************************************************************/
/* This file is part of: */
/* GODOT ENGINE */
/* https://godotengine.org */
2014-02-10 02:10:30 +01:00
/*************************************************************************/
/* Copyright (c) 2007-2020 Juan Linietsky, Ariel Manzur. */
/* Copyright (c) 2014-2020 Godot Engine contributors (cf. AUTHORS.md). */
2014-02-10 02:10:30 +01:00
/* */
/* Permission is hereby granted, free of charge, to any person obtaining */
/* a copy of this software and associated documentation files (the */
/* "Software"), to deal in the Software without restriction, including */
/* without limitation the rights to use, copy, modify, merge, publish, */
/* distribute, sublicense, and/or sell copies of the Software, and to */
/* permit persons to whom the Software is furnished to do so, subject to */
/* the following conditions: */
/* */
/* The above copyright notice and this permission notice shall be */
/* included in all copies or substantial portions of the Software. */
/* */
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
/*************************************************************************/
2014-02-10 02:10:30 +01:00
#include "box_container.h"
#include "label.h"
#include "margin_container.h"
2014-02-10 02:10:30 +01:00
struct _MinSizeCache {
int min_size;
bool will_stretch;
int final_size;
};
void BoxContainer::_resort() {
/** First pass, determine minimum size AND amount of stretchable elements */
Size2i new_size = get_size();
2014-02-10 02:10:30 +01:00
int sep = get_constant("separation"); //,vertical?"VBoxContainer":"HBoxContainer");
2014-02-10 02:10:30 +01:00
bool first = true;
int children_count = 0;
int stretch_min = 0;
int stretch_avail = 0;
float stretch_ratio_total = 0;
Map<Control *, _MinSizeCache> min_size_cache;
2014-02-10 02:10:30 +01:00
for (int i = 0; i < get_child_count(); i++) {
Control *c = Object::cast_to<Control>(get_child(i));
if (!c || !c->is_visible_in_tree())
2014-02-10 02:10:30 +01:00
continue;
if (c->is_set_as_toplevel())
continue;
Size2i size = c->get_combined_minimum_size();
2014-02-10 02:10:30 +01:00
_MinSizeCache msc;
if (vertical) { /* VERTICAL */
stretch_min += size.height;
msc.min_size = size.height;
msc.will_stretch = c->get_v_size_flags() & SIZE_EXPAND;
2014-02-10 02:10:30 +01:00
} else { /* HORIZONTAL */
stretch_min += size.width;
msc.min_size = size.width;
msc.will_stretch = c->get_h_size_flags() & SIZE_EXPAND;
2014-02-10 02:10:30 +01:00
}
if (msc.will_stretch) {
stretch_avail += msc.min_size;
stretch_ratio_total += c->get_stretch_ratio();
2014-02-10 02:10:30 +01:00
}
msc.final_size = msc.min_size;
min_size_cache[c] = msc;
2014-02-10 02:10:30 +01:00
children_count++;
}
if (children_count == 0)
2014-02-10 02:10:30 +01:00
return;
int stretch_max = (vertical ? new_size.height : new_size.width) - (children_count - 1) * sep;
2014-02-10 02:10:30 +01:00
int stretch_diff = stretch_max - stretch_min;
if (stretch_diff < 0) {
2014-02-10 02:10:30 +01:00
//avoid negative stretch space
stretch_diff = 0;
2014-02-10 02:10:30 +01:00
}
stretch_avail += stretch_diff; //available stretch space.
2014-02-10 02:10:30 +01:00
/** Second, pass sucessively to discard elements that can't be stretched, this will run while stretchable
elements exist */
bool has_stretched = false;
while (stretch_ratio_total > 0) { // first of all, don't even be here if no stretchable objects exist
2014-02-10 02:10:30 +01:00
has_stretched = true;
bool refit_successful = true; //assume refit-test will go well
2014-02-10 02:10:30 +01:00
for (int i = 0; i < get_child_count(); i++) {
2014-02-10 02:10:30 +01:00
Control *c = Object::cast_to<Control>(get_child(i));
if (!c || !c->is_visible_in_tree())
2014-02-10 02:10:30 +01:00
continue;
if (c->is_set_as_toplevel())
continue;
ERR_FAIL_COND(!min_size_cache.has(c));
_MinSizeCache &msc = min_size_cache[c];
2014-02-10 02:10:30 +01:00
if (msc.will_stretch) { //wants to stretch
//let's see if it can really stretch
int final_pixel_size = stretch_avail * c->get_stretch_ratio() / stretch_ratio_total;
if (final_pixel_size < msc.min_size) {
2014-02-10 02:10:30 +01:00
//if available stretching area is too small for widget,
//then remove it from stretching area
msc.will_stretch = false;
stretch_ratio_total -= c->get_stretch_ratio();
refit_successful = false;
stretch_avail -= msc.min_size;
msc.final_size = msc.min_size;
2014-02-10 02:10:30 +01:00
break;
} else {
msc.final_size = final_pixel_size;
2014-02-10 02:10:30 +01:00
}
}
}
if (refit_successful) //uf refit went well, break
break;
}
/** Final pass, draw and stretch elements **/
int ofs = 0;
if (!has_stretched) {
switch (align) {
case ALIGN_BEGIN:
break;
case ALIGN_CENTER:
ofs = stretch_diff / 2;
break;
case ALIGN_END:
ofs = stretch_diff;
break;
}
}
2014-02-10 02:10:30 +01:00
first = true;
int idx = 0;
2014-02-10 02:10:30 +01:00
for (int i = 0; i < get_child_count(); i++) {
2014-02-10 02:10:30 +01:00
Control *c = Object::cast_to<Control>(get_child(i));
if (!c || !c->is_visible_in_tree())
2014-02-10 02:10:30 +01:00
continue;
if (c->is_set_as_toplevel())
continue;
_MinSizeCache &msc = min_size_cache[c];
2014-02-10 02:10:30 +01:00
if (first)
first = false;
2014-02-10 02:10:30 +01:00
else
ofs += sep;
2014-02-10 02:10:30 +01:00
int from = ofs;
int to = ofs + msc.final_size;
2014-02-10 02:10:30 +01:00
if (msc.will_stretch && idx == children_count - 1) {
2014-02-10 02:10:30 +01:00
//adjust so the last one always fits perfect
//compensating for numerical imprecision
to = vertical ? new_size.height : new_size.width;
2014-02-10 02:10:30 +01:00
}
int size = to - from;
2014-02-10 02:10:30 +01:00
Rect2 rect;
if (vertical) {
rect = Rect2(0, from, new_size.width, size);
2014-02-10 02:10:30 +01:00
} else {
rect = Rect2(from, 0, size, new_size.height);
2014-02-10 02:10:30 +01:00
}
fit_child_in_rect(c, rect);
2014-02-10 02:10:30 +01:00
ofs = to;
2014-02-10 02:10:30 +01:00
idx++;
}
}
Size2 BoxContainer::get_minimum_size() const {
/* Calculate MINIMUM SIZE */
Size2i minimum;
int sep = get_constant("separation"); //,vertical?"VBoxContainer":"HBoxContainer");
2014-02-10 02:10:30 +01:00
bool first = true;
2014-02-10 02:10:30 +01:00
for (int i = 0; i < get_child_count(); i++) {
Control *c = Object::cast_to<Control>(get_child(i));
2014-02-10 02:10:30 +01:00
if (!c)
continue;
if (c->is_set_as_toplevel())
continue;
if (!c->is_visible()) {
2014-02-10 02:10:30 +01:00
continue;
}
Size2i size = c->get_combined_minimum_size();
2014-02-10 02:10:30 +01:00
if (vertical) { /* VERTICAL */
if (size.width > minimum.width) {
minimum.width = size.width;
2014-02-10 02:10:30 +01:00
}
minimum.height += size.height + (first ? 0 : sep);
2014-02-10 02:10:30 +01:00
} else { /* HORIZONTAL */
if (size.height > minimum.height) {
minimum.height = size.height;
2014-02-10 02:10:30 +01:00
}
minimum.width += size.width + (first ? 0 : sep);
2014-02-10 02:10:30 +01:00
}
first = false;
2014-02-10 02:10:30 +01:00
}
return minimum;
}
void BoxContainer::_notification(int p_what) {
switch (p_what) {
2014-02-10 02:10:30 +01:00
case NOTIFICATION_SORT_CHILDREN: {
_resort();
} break;
case NOTIFICATION_THEME_CHANGED: {
minimum_size_changed();
} break;
2014-02-10 02:10:30 +01:00
}
}
void BoxContainer::set_alignment(AlignMode p_align) {
align = p_align;
_resort();
}
BoxContainer::AlignMode BoxContainer::get_alignment() const {
return align;
}
2014-02-10 02:10:30 +01:00
void BoxContainer::add_spacer(bool p_begin) {
Control *c = memnew(Control);
c->set_mouse_filter(MOUSE_FILTER_PASS); //allow spacer to pass mouse events
2014-02-10 02:10:30 +01:00
if (vertical)
c->set_v_size_flags(SIZE_EXPAND_FILL);
else
c->set_h_size_flags(SIZE_EXPAND_FILL);
add_child(c);
if (p_begin)
move_child(c, 0);
2014-02-10 02:10:30 +01:00
}
BoxContainer::BoxContainer(bool p_vertical) {
vertical = p_vertical;
align = ALIGN_BEGIN;
2014-02-10 02:10:30 +01:00
}
void BoxContainer::_bind_methods() {
ClassDB::bind_method(D_METHOD("add_spacer", "begin"), &BoxContainer::add_spacer);
ClassDB::bind_method(D_METHOD("get_alignment"), &BoxContainer::get_alignment);
ClassDB::bind_method(D_METHOD("set_alignment", "alignment"), &BoxContainer::set_alignment);
BIND_ENUM_CONSTANT(ALIGN_BEGIN);
BIND_ENUM_CONSTANT(ALIGN_CENTER);
BIND_ENUM_CONSTANT(ALIGN_END);
ADD_PROPERTY(PropertyInfo(Variant::INT, "alignment", PROPERTY_HINT_ENUM, "Begin,Center,End"), "set_alignment", "get_alignment");
}
2014-02-10 02:10:30 +01:00
MarginContainer *VBoxContainer::add_margin_child(const String &p_label, Control *p_control, bool p_expand) {
2014-02-10 02:10:30 +01:00
Label *l = memnew(Label);
2014-02-10 02:10:30 +01:00
l->set_text(p_label);
add_child(l);
MarginContainer *mc = memnew(MarginContainer);
mc->add_constant_override("margin_left", 0);
2014-02-10 02:10:30 +01:00
mc->add_child(p_control);
add_child(mc);
if (p_expand)
mc->set_v_size_flags(SIZE_EXPAND_FILL);
return mc;
}