11 void ComputeGrow(std::vector<Element>* elements,
14 for (
Element& element : *elements) {
16 extra_space * element.flex_grow / std::max(flex_grow_sum, 1);
17 extra_space -= added_space;
18 flex_grow_sum -= element.flex_grow;
19 element.size = element.min_size + added_space;
26 void ComputeShrinkEasy(std::vector<Element>* elements,
28 int flex_shrink_sum) {
29 for (
Element& element : *elements) {
30 int added_space = extra_space * element.min_size * element.flex_shrink /
31 std::max(flex_shrink_sum, 1);
32 extra_space -= added_space;
33 flex_shrink_sum -= element.flex_shrink * element.min_size;
34 element.size = element.min_size + added_space;
42 void ComputeShrinkHard(std::vector<Element>* elements,
45 for (
Element& element : *elements) {
46 if (element.flex_shrink != 0) {
51 int added_space = extra_space * element.min_size / std::max(1,
size);
52 extra_space -= added_space;
53 size -= element.min_size;
55 element.size = element.min_size + added_space;
61 void Compute(std::vector<Element>* elements,
int target_size) {
63 int flex_grow_sum = 0;
64 int flex_shrink_sum = 0;
65 int flex_shrink_size = 0;
67 for (
auto& element : *elements) {
68 flex_grow_sum += element.flex_grow;
69 flex_shrink_sum += element.min_size * element.flex_shrink;
70 if (element.flex_shrink != 0) {
71 flex_shrink_size += element.min_size;
73 size += element.min_size;
76 int extra_space = target_size -
size;
77 if (extra_space >= 0) {
78 ComputeGrow(elements, extra_space, flex_grow_sum);
79 }
else if (flex_shrink_size + extra_space >= 0) {
80 ComputeShrinkEasy(elements, extra_space, flex_shrink_sum);
83 ComputeShrinkHard(elements, extra_space + flex_shrink_size,
84 size - flex_shrink_size);
void Compute(std::vector< Element > *elements, int target_size)
Decorator size(Direction, Constraint, int value)
Apply a constraint on the size of an element.