summaryrefslogtreecommitdiff
path: root/src/layout/stack.rs
blob: 504c64aaf682e3d2c8f4d0b10bb4b0326ed681f4 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
use decorum::N64;

use super::*;

/// A node that stacks its children.
#[derive(Debug, Clone, Eq, PartialEq)]
#[cfg_attr(feature = "layout-cache", derive(Hash))]
pub struct StackNode {
    /// The `main` and `cross` directions of this stack.
    ///
    /// The children are stacked along the `main` direction. The `cross`
    /// direction is required for aligning the children.
    pub dirs: Gen<Dir>,
    /// The fixed aspect ratio between width and height, if any.
    ///
    /// The resulting frames will satisfy `width = aspect * height`.
    pub aspect: Option<N64>,
    /// The nodes to be stacked.
    pub children: Vec<StackChild>,
}

/// A child of a stack node.
#[derive(Debug, Clone, Eq, PartialEq)]
#[cfg_attr(feature = "layout-cache", derive(Hash))]
pub enum StackChild {
    /// Spacing between other nodes.
    Spacing(Linear),
    /// Any child node and how to align it in the stack.
    Any(LayoutNode, Gen<Align>),
}

impl Layout for StackNode {
    fn layout(
        &self,
        ctx: &mut LayoutContext,
        regions: &Regions,
    ) -> Vec<Constrained<Rc<Frame>>> {
        StackLayouter::new(self, regions.clone()).layout(ctx)
    }
}

impl From<StackNode> for LayoutNode {
    fn from(stack: StackNode) -> Self {
        Self::new(stack)
    }
}

/// Performs stack layout.
struct StackLayouter<'a> {
    /// The stack node to layout.
    stack: &'a StackNode,
    /// The axis of the main direction.
    main: SpecAxis,
    /// Whether the stack should expand to fill the region.
    expand: Spec<bool>,
    /// The region to layout into.
    regions: Regions,
    /// The full size of `regions.current` that was available before we started
    /// subtracting.
    full: Size,
    /// The generic size used by the frames for the current region.
    used: Gen<Length>,
    /// The alignment ruler for the current region.
    ruler: Align,
    /// The constraints for the current region.
    constraints: Constraints,
    /// Whether the last region can fit all the remaining content.
    overflowing: bool,
    /// Offset, alignment and frame for all children that fit into the current
    /// region. The exact positions are not known yet.
    frames: Vec<(Length, Gen<Align>, Rc<Frame>)>,
    /// Finished frames for previous regions.
    finished: Vec<Constrained<Rc<Frame>>>,
}

impl<'a> StackLayouter<'a> {
    /// Create a new stack layouter.
    fn new(stack: &'a StackNode, mut regions: Regions) -> Self {
        let main = stack.dirs.main.axis();
        let full = regions.current;
        let expand = regions.expand;

        // Disable expansion on the main axis for children.
        regions.expand.set(main, false);

        if let Some(aspect) = stack.aspect {
            regions.current = regions.current.with_aspect(aspect.into_inner());
        }

        Self {
            stack,
            main,
            expand,
            regions,
            full,
            used: Gen::zero(),
            ruler: Align::Start,
            constraints: Constraints::new(expand),
            overflowing: false,
            frames: vec![],
            finished: vec![],
        }
    }

    /// Layout all children.
    fn layout(mut self, ctx: &mut LayoutContext) -> Vec<Constrained<Rc<Frame>>> {
        for child in &self.stack.children {
            match *child {
                StackChild::Spacing(amount) => self.space(amount),
                StackChild::Any(ref node, aligns) => {
                    let nodes = node.layout(ctx, &self.regions);
                    let len = nodes.len();
                    for (i, frame) in nodes.into_iter().enumerate() {
                        if i + 1 < len {
                            self.constraints.exact = self.full.to_spec().map(Some);
                        }
                        self.push_frame(frame.item, aligns);
                    }
                }
            }
        }

        self.finish_region();
        self.finished
    }

    /// Add main-axis spacing into the current region.
    fn space(&mut self, amount: Linear) {
        // Resolve the linear.
        let full = self.full.get(self.main);
        let resolved = amount.resolve(full);

        // Cap the spacing to the remaining available space. This action does
        // not directly affect the constraints because of the cap.
        let remaining = self.regions.current.get_mut(self.main);
        let capped = resolved.min(*remaining);

        // Grow our size and shrink the available space in the region.
        self.used.main += capped;
        *remaining -= capped;
    }

    /// Push a frame into the current or next fitting region, finishing regions
    /// if necessary.
    fn push_frame(&mut self, frame: Rc<Frame>, aligns: Gen<Align>) {
        let size = frame.size.to_gen(self.main);

        // Don't allow `Start` after `End` in the same region.
        if aligns.main < self.ruler {
            self.finish_region();
        }

        // Find a fitting region.
        while !self.regions.current.get(self.main).fits(size.main) {
            if self.regions.in_full_last() {
                self.overflowing = true;
                break;
            }

            self.constraints
                .max
                .get_mut(self.main)
                .set_min(self.used.main + size.main);
            self.finish_region();
        }

        // Shrink available space in the region.
        *self.regions.current.get_mut(self.main) -= size.main;

        // Grow our size.
        let offset = self.used.main;
        self.used.main += size.main;
        self.used.cross.set_max(size.cross);
        self.ruler = aligns.main;

        // Remember the frame with offset and alignment.
        self.frames.push((offset, aligns, frame));
    }

    /// Finish the frame for one region.
    fn finish_region(&mut self) {
        let expand = self.expand;
        let used = self.used.to_size(self.main);

        // Determine the stack's size dependening on whether the region is
        // fixed.
        let mut size = Size::new(
            if expand.horizontal {
                self.constraints.exact.horizontal = Some(self.full.width);
                self.full.width
            } else {
                self.constraints.min.horizontal = Some(used.width);
                used.width
            },
            if expand.vertical {
                self.constraints.exact.vertical = Some(self.full.height);
                self.full.height
            } else {
                self.constraints.min.vertical = Some(used.height);
                used.height
            },
        );

        // Make sure the stack's size satisfies the aspect ratio.
        if let Some(aspect) = self.stack.aspect {
            self.constraints.exact = self.full.to_spec().map(Some);
            self.constraints.min = Spec::splat(None);
            self.constraints.max = Spec::splat(None);
            let width = size
                .width
                .max(aspect.into_inner() * size.height)
                .min(self.full.width)
                .min(aspect.into_inner() * self.full.height);

            size = Size::new(width, width / aspect.into_inner());
        }

        if self.overflowing {
            self.constraints.min.vertical = None;
            self.constraints.max.vertical = None;
            self.constraints.exact = self.full.to_spec().map(Some);
        }

        let mut output = Frame::new(size, size.height);
        let mut first = true;

        // Place all frames.
        for (offset, aligns, frame) in self.frames.drain(..) {
            let stack_size = size.to_gen(self.main);
            let child_size = frame.size.to_gen(self.main);

            // Align along the cross axis.
            let cross = aligns.cross.resolve(
                self.stack.dirs.cross,
                Length::zero() .. stack_size.cross - child_size.cross,
            );

            // Align along the main axis.
            let main = aligns.main.resolve(
                self.stack.dirs.main,
                if self.stack.dirs.main.is_positive() {
                    offset .. stack_size.main - self.used.main + offset
                } else {
                    let offset_with_self = offset + child_size.main;
                    self.used.main - offset_with_self
                        .. stack_size.main - offset_with_self
                },
            );

            let pos = Gen::new(cross, main).to_point(self.main);

            // The baseline of the stack is that of the first frame.
            if first {
                output.baseline = pos.y + frame.baseline;
                first = false;
            }

            output.push_frame(pos, frame);
        }

        self.regions.next();
        if let Some(aspect) = self.stack.aspect {
            self.regions.current = self.regions.current.with_aspect(aspect.into_inner());
        }

        self.full = self.regions.current;
        self.used = Gen::zero();
        self.ruler = Align::Start;
        self.finished.push(output.constrain(self.constraints));
        self.constraints = Constraints::new(expand);
    }
}