|
| 1 | +/**************************************************************************/ |
| 2 | +/* size_container.cpp */ |
| 3 | +/**************************************************************************/ |
| 4 | +/* This file is part of: */ |
| 5 | +/* GODOT ENGINE */ |
| 6 | +/* https://godotengine.org */ |
| 7 | +/**************************************************************************/ |
| 8 | +/* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */ |
| 9 | +/* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */ |
| 10 | +/* */ |
| 11 | +/* Permission is hereby granted, free of charge, to any person obtaining */ |
| 12 | +/* a copy of this software and associated documentation files (the */ |
| 13 | +/* "Software"), to deal in the Software without restriction, including */ |
| 14 | +/* without limitation the rights to use, copy, modify, merge, publish, */ |
| 15 | +/* distribute, sublicense, and/or sell copies of the Software, and to */ |
| 16 | +/* permit persons to whom the Software is furnished to do so, subject to */ |
| 17 | +/* the following conditions: */ |
| 18 | +/* */ |
| 19 | +/* The above copyright notice and this permission notice shall be */ |
| 20 | +/* included in all copies or substantial portions of the Software. */ |
| 21 | +/* */ |
| 22 | +/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */ |
| 23 | +/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */ |
| 24 | +/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */ |
| 25 | +/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */ |
| 26 | +/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */ |
| 27 | +/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */ |
| 28 | +/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ |
| 29 | +/**************************************************************************/ |
| 30 | + |
| 31 | +#include "size_container.h" |
| 32 | + |
| 33 | +void SizeContainer::set_custom_minimum_size(const Size2 &p_custom) { |
| 34 | + if ((p_custom.x > maximum_size.x && maximum_size.x > 0) || (p_custom.y > maximum_size.y && maximum_size.y > 0)) { |
| 35 | + return; |
| 36 | + } |
| 37 | + |
| 38 | + Control::set_custom_minimum_size(p_custom); |
| 39 | +} |
| 40 | + |
| 41 | +void SizeContainer::set_size(const Size2 &p_size, bool p_keep_offsets) { |
| 42 | + Size2 size = p_size; |
| 43 | + if (maximum_size.x > 0) { |
| 44 | + size.x = MIN(size.x, maximum_size.x); |
| 45 | + } |
| 46 | + if (maximum_size.y > 0) { |
| 47 | + size.y = MIN(size.y, maximum_size.y); |
| 48 | + } |
| 49 | + |
| 50 | + Control::set_size(size, p_keep_offsets); |
| 51 | +} |
| 52 | + |
| 53 | +void SizeContainer::set_maximum_size(const Size2 &p_max_size) { |
| 54 | + if (maximum_size == p_max_size) { |
| 55 | + return; |
| 56 | + } |
| 57 | + maximum_size = p_max_size.maxf(0.0); |
| 58 | + set_size(get_minimum_size()); |
| 59 | +} |
| 60 | + |
| 61 | +Size2 SizeContainer::get_maximum_size() const { |
| 62 | + return maximum_size; |
| 63 | +} |
| 64 | + |
| 65 | +Size2 SizeContainer::get_minimum_size() const { |
| 66 | + Size2 ms; |
| 67 | + for (int i = 0; i < get_child_count(); i++) { |
| 68 | + Control *c = as_sortable_control(get_child(i), SortableVisibilityMode::VISIBLE); |
| 69 | + if (!c) { |
| 70 | + continue; |
| 71 | + } |
| 72 | + Size2 minsize = c->get_combined_minimum_size(); |
| 73 | + ms = ms.max(minsize); |
| 74 | + } |
| 75 | + |
| 76 | + if (maximum_size.x > 0 && ms.x > maximum_size.x) { |
| 77 | + ms.x = maximum_size.x; |
| 78 | + } |
| 79 | + if (maximum_size.y > 0 && ms.y > maximum_size.y) { |
| 80 | + ms.y = maximum_size.y; |
| 81 | + } |
| 82 | + |
| 83 | + return ms; |
| 84 | +} |
| 85 | + |
| 86 | +Vector<int> SizeContainer::get_allowed_size_flags_horizontal() const { |
| 87 | + Vector<int> flags; |
| 88 | + flags.append(SIZE_FILL); |
| 89 | + flags.append(SIZE_SHRINK_BEGIN); |
| 90 | + flags.append(SIZE_SHRINK_CENTER); |
| 91 | + flags.append(SIZE_SHRINK_END); |
| 92 | + return flags; |
| 93 | +} |
| 94 | + |
| 95 | +Vector<int> SizeContainer::get_allowed_size_flags_vertical() const { |
| 96 | + Vector<int> flags; |
| 97 | + flags.append(SIZE_FILL); |
| 98 | + flags.append(SIZE_SHRINK_BEGIN); |
| 99 | + flags.append(SIZE_SHRINK_CENTER); |
| 100 | + flags.append(SIZE_SHRINK_END); |
| 101 | + return flags; |
| 102 | +} |
| 103 | + |
| 104 | +void SizeContainer::_notification(int p_what) { |
| 105 | + switch (p_what) { |
| 106 | + case NOTIFICATION_SORT_CHILDREN: { |
| 107 | + Size2 size = get_size(); |
| 108 | + |
| 109 | + // Clamp container size to max_size if set |
| 110 | + if (maximum_size.x > 0) { |
| 111 | + size.x = MIN(size.x, maximum_size.x); |
| 112 | + } |
| 113 | + if (maximum_size.y > 0) { |
| 114 | + size.y = MIN(size.y, maximum_size.y); |
| 115 | + } |
| 116 | + |
| 117 | + for (int i = 0; i < get_child_count(); i++) { |
| 118 | + Control *c = as_sortable_control(get_child(i)); |
| 119 | + if (!c) { |
| 120 | + continue; |
| 121 | + } |
| 122 | + |
| 123 | + // Fit child within the constrained size |
| 124 | + fit_child_in_rect(c, Rect2(Point2(), size)); |
| 125 | + } |
| 126 | + } break; |
| 127 | + |
| 128 | + case NOTIFICATION_THEME_CHANGED: { |
| 129 | + update_minimum_size(); |
| 130 | + } break; |
| 131 | + } |
| 132 | +} |
| 133 | + |
| 134 | +void SizeContainer::_bind_methods() { |
| 135 | + ClassDB::bind_method(D_METHOD("set_maximum_size", "maximum_size"), &SizeContainer::set_maximum_size); |
| 136 | + ClassDB::bind_method(D_METHOD("get_maximum_size"), &SizeContainer::get_maximum_size); |
| 137 | + |
| 138 | + ADD_PROPERTY(PropertyInfo(Variant::VECTOR2, "maximum_size"), "set_maximum_size", "get_maximum_size"); |
| 139 | +} |
| 140 | + |
| 141 | +SizeContainer::SizeContainer() { |
| 142 | + set_clip_contents(true); |
| 143 | +} |
0 commit comments