Remove style clone in grid algorithm
1//! The abstractions that make up the core of Taffy's low-level API
2//!
3//! ## Examples
4//!
5//! The following examples demonstrate end-to-end implementation of Taffy's traits and usage of the low-level compute APIs:
6//!
7//! - [custom_tree_vec](https://github.com/DioxusLabs/taffy/blob/main/examples/custom_tree_vec.rs) which implements a custom Taffy tree using a `Vec` as an arena with NodeId's being index's into the Vec.
8//! - [custom_tree_owned_partial](https://github.com/DioxusLabs/taffy/blob/main/examples/custom_tree_owned_partial.rs) which implements a custom Taffy tree using directly owned children with NodeId's being pointers.
9//! - [custom_tree_owned_unsafe](https://github.com/DioxusLabs/taffy/blob/main/examples/custom_tree_owned_unsafe.rs) which implements a custom Taffy tree using directly owned children with NodeId's being pointers.
10//!
11//! ## Overview
12//!
13//! ### Trait dependency tree
14//!
15//! The tree below illustrates which traits depend on which other traits.
16//!
17//! ```text
18//! TraversePartialTree - Access a node's children
19//! ├── LayoutPartialTree - Run layout algorithms on a node and it's direct children
20//! └── TraverseTree - Recursively access a node's descendants
21//! ├── RoundTree - Round a float-valued` layout to integer pixels
22//! └── PrintTree - Print a debug representation of a node tree
23//! ```
24//!
25//! ### A table of traits
26//!
27//! | Trait | Requires | Enables |
28//! | --- | --- | --- |
29//! | [`LayoutPartialTree`] | [`TraversePartialTree`] | [`compute_flexbox_layout`](crate::compute_flexbox_layout)<br />[`compute_grid_layout`](crate::compute_grid_layout)<br />[`compute_block_layout`](crate::compute_block_layout)<br />[`compute_root_layout`](crate::compute_root_layout)<br />[`compute_leaf_layout`](crate::compute_leaf_layout)<br />[`compute_hidden_layout`](crate::compute_hidden_layout)<br />[`compute_cached_layout`](crate::compute_cached_layout) |
30//! | [`RoundTree`] | [`TraverseTree`] | [`round_layout`](crate::round_layout) |
31//! | [`PrintTree`] | [`TraverseTree`] | [`print_tree`](crate::print_tree) |
32//!
33//! ## All of the traits on one page
34//!
35//! ### TraversePartialTree and TraverseTree
36//! These traits are Taffy's abstraction for downward tree traversal:
37//! - [`TraversePartialTree`] allows access to a single container node, and it's immediate children. This is the only "traverse" trait that is required
38//! for use of Taffy's core layout algorithms (flexbox, grid, etc).
39//! - [`TraverseTree`] is a marker trait which uses the same API signature as `TraversePartialTree`, but extends it with a guarantee that the child/children methods can be used to recurse
40//! infinitely down the tree. It is required by the `RoundTree` and
41//! the `PrintTree` traits.
42//! ```rust
43//! # use taffy::*;
44//! pub trait TraversePartialTree {
45//! /// Type representing an iterator of the children of a node
46//! type ChildIter<'a>: Iterator<Item = NodeId>
47//! where
48//! Self: 'a;
49//!
50//! /// Get the list of children IDs for the given node
51//! fn child_ids(&self, parent_node_id: NodeId) -> Self::ChildIter<'_>;
52//!
53//! /// Get the number of children for the given node
54//! fn child_count(&self, parent_node_id: NodeId) -> usize;
55//!
56//! /// Get a specific child of a node, where the index represents the nth child
57//! fn get_child_id(&self, parent_node_id: NodeId, child_index: usize) -> NodeId;
58//! }
59//!
60//! pub trait TraverseTree: TraversePartialTree {}
61//! ```
62//!
63//! You must implement [`TraversePartialTree`] to access any of Taffy's low-level API. If your tree implementation allows you to implement [`TraverseTree`] with
64//! the correct semantics (full recursive traversal is available) then you should.
65//!
66//! ### LayoutPartialTree
67//!
68//! **Requires:** `TraversePartialTree`<br />
69//! **Enables:** Flexbox, Grid, Block and Leaf layout algorithms from the [`crate::compute`] module
70//!
71//! Any type that implements [`LayoutPartialTree`] can be laid out using [Taffy's algorithms](crate::compute)
72//!
73//! Note that this trait extends [`TraversePartialTree`] (not [`TraverseTree`]). Taffy's algorithm implementations have been designed such that they can be used for a laying out a single
74//! node that only has access to it's immediate children.
75//!
76//! ```rust
77//! # use taffy::*;
78//! pub trait LayoutPartialTree: TraversePartialTree {
79//! /// Get a reference to the [`Style`] for this node.
80//! fn get_style(&self, node_id: NodeId) -> &Style;
81//!
82//! /// Set the node's unrounded layout
83//! fn set_unrounded_layout(&mut self, node_id: NodeId, layout: &Layout);
84//!
85//! /// Get a mutable reference to the [`Cache`] for this node.
86//! fn get_cache_mut(&mut self, node_id: NodeId) -> &mut Cache;
87//!
88//! /// Compute the specified node's size or full layout given the specified constraints
89//! fn compute_child_layout(&mut self, node_id: NodeId, inputs: LayoutInput) -> LayoutOutput;
90//! }
91//! ```
92//!
93//! ### RoundTree
94//!
95//! **Requires:** `TraverseTree`
96//!
97//! Trait used by the `round_layout` method which takes a tree of unrounded float-valued layouts and performs
98//! rounding to snap the values to the pixel grid.
99//!
100//! As indicated by it's dependence on `TraverseTree`, it required full recursive access to the tree.
101//!
102//! ```rust
103//! # use taffy::*;
104//! pub trait RoundTree: TraverseTree {
105//! /// Get the node's unrounded layout
106//! fn get_unrounded_layout(&self, node_id: NodeId) -> &Layout;
107//! /// Get a reference to the node's final layout
108//! fn set_final_layout(&mut self, node_id: NodeId, layout: &Layout);
109//! }
110//! ```
111//!
112//! ### PrintTree
113//!
114//! **Requires:** `TraverseTree`
115//!
116//! ```rust
117//! /// Trait used by the `print_tree` method which prints a debug representation
118//! ///
119//! /// As indicated by it's dependence on `TraverseTree`, it required full recursive access to the tree.
120//! # use taffy::*;
121//! pub trait PrintTree: TraverseTree {
122//! /// Get a debug label for the node (typically the type of node: flexbox, grid, text, image, etc)
123//! fn get_debug_label(&self, node_id: NodeId) -> &'static str;
124//! /// Get a reference to the node's final layout
125//! fn get_final_layout(&self, node_id: NodeId) -> &Layout;
126//! }
127//! ```
128//!
129use super::{Cache, Layout, LayoutInput, LayoutOutput, NodeId, RequestedAxis, RunMode, SizingMode};
130use crate::geometry::{AbsoluteAxis, Line, Size};
131use crate::style::{AvailableSpace, CoreStyle};
132#[cfg(feature = "flexbox")]
133use crate::style::{FlexboxContainerStyle, FlexboxItemStyle};
134#[cfg(feature = "grid")]
135use crate::style::{GridContainerStyle, GridItemStyle};
136
137/// This trait is Taffy's abstraction for downward tree traversal.
138/// However, this trait does *not* require access to any node's other than a single container node's immediate children unless you also intend to implement `TraverseTree`.
139pub trait TraversePartialTree {
140 /// Type representing an iterator of the children of a node
141 type ChildIter<'a>: Iterator<Item = NodeId>
142 where
143 Self: 'a;
144
145 /// Get the list of children IDs for the given node
146 fn child_ids(&self, parent_node_id: NodeId) -> Self::ChildIter<'_>;
147
148 /// Get the number of children for the given node
149 fn child_count(&self, parent_node_id: NodeId) -> usize;
150
151 /// Get a specific child of a node, where the index represents the nth child
152 fn get_child_id(&self, parent_node_id: NodeId, child_index: usize) -> NodeId;
153}
154
155/// A marker trait which extends `TraversePartialTree` with the additional guarantee that the child/children methods can be used to recurse
156/// infinitely down the tree. Is required by the `RoundTree` and the `PrintTree` traits.
157pub trait TraverseTree: TraversePartialTree {}
158
159/// Any type that implements [`LayoutPartialTree`] can be laid out using [Taffy's algorithms](crate::compute)
160///
161/// Note that this trait extends [`TraversePartialTree`] (not [`TraverseTree`]). Taffy's algorithm implementations have been designed such that they can be used for a laying out a single
162/// node that only has access to it's immediate children.
163pub trait LayoutPartialTree: TraversePartialTree {
164 /// The style type representing the core container styles that all containers should have
165 /// Used when laying out the root node of a tree
166 type CoreContainerStyle<'a>: CoreStyle
167 where
168 Self: 'a;
169
170 /// Get core style
171 fn get_core_container_style(&self, node_id: NodeId) -> Self::CoreContainerStyle<'_>;
172
173 /// Set the node's unrounded layout
174 fn set_unrounded_layout(&mut self, node_id: NodeId, layout: &Layout);
175
176 /// Get a mutable reference to the [`Cache`] for this node.
177 fn get_cache_mut(&mut self, node_id: NodeId) -> &mut Cache;
178
179 /// Compute the specified node's size or full layout given the specified constraints
180 fn compute_child_layout(&mut self, node_id: NodeId, inputs: LayoutInput) -> LayoutOutput;
181}
182
183/// Trait used by the `round_layout` method which takes a tree of unrounded float-valued layouts and performs
184/// rounding to snap the values to the pixel grid.
185///
186/// As indicated by it's dependence on `TraverseTree`, it required full recursive access to the tree.
187pub trait RoundTree: TraverseTree {
188 /// Get the node's unrounded layout
189 fn get_unrounded_layout(&self, node_id: NodeId) -> &Layout;
190 /// Get a reference to the node's final layout
191 fn set_final_layout(&mut self, node_id: NodeId, layout: &Layout);
192}
193
194/// Trait used by the `print_tree` method which prints a debug representation
195///
196/// As indicated by it's dependence on `TraverseTree`, it required full recursive access to the tree.
197pub trait PrintTree: TraverseTree {
198 /// Get a debug label for the node (typically the type of node: flexbox, grid, text, image, etc)
199 fn get_debug_label(&self, node_id: NodeId) -> &'static str;
200 /// Get a reference to the node's final layout
201 fn get_final_layout(&self, node_id: NodeId) -> &Layout;
202}
203
204#[cfg(feature = "flexbox")]
205/// Extends [`LayoutPartialTree`] with getters for the styles required for Flexbox layout
206pub trait LayoutFlexboxContainer: LayoutPartialTree {
207 /// The style type representing the Flexbox container's styles
208 type ContainerStyle<'a>: FlexboxContainerStyle
209 where
210 Self: 'a;
211 /// The style type representing each Flexbox item's styles
212 type ItemStyle<'a>: FlexboxItemStyle
213 where
214 Self: 'a;
215
216 /// Get the container's styles
217 fn get_flexbox_container_style(&self, node_id: NodeId) -> Self::ContainerStyle<'_>;
218
219 /// Get the child's styles
220 fn get_flexbox_child_style(&self, child_node_id: NodeId) -> Self::ItemStyle<'_>;
221}
222
223#[cfg(feature = "grid")]
224/// Extends [`LayoutPartialTree`] with getters for the styles required for CSS Grid layout
225pub trait LayoutGridContainer: LayoutPartialTree {
226 /// The style type representing the CSS Grid container's styles
227 type ContainerStyle<'a>: GridContainerStyle
228 where
229 Self: 'a;
230
231 /// The style type representing each CSS Grid item's styles
232 type ItemStyle<'a>: GridItemStyle
233 where
234 Self: 'a;
235
236 /// Get the container's styles
237 fn get_grid_container_style(&self, node_id: NodeId) -> Self::ContainerStyle<'_>;
238
239 /// Get the child's styles
240 fn get_grid_child_style(&self, child_node_id: NodeId) -> Self::ItemStyle<'_>;
241}
242
243#[cfg(feature = "block_layout")]
244/// Extends [`LayoutPartialTree`] with getters for the styles required for CSS Block layout
245pub trait LayoutBlockContainer: LayoutPartialTree {
246 /// The style type representing the CSS Block container's styles
247 type ContainerStyle<'a>: CoreStyle
248 where
249 Self: 'a;
250 /// The style type representing each CSS Block item's styles
251 type ItemStyle<'a>: CoreStyle
252 where
253 Self: 'a;
254
255 /// Get the container's styles
256 fn get_block_container_style(&self, node_id: NodeId) -> Self::ContainerStyle<'_>;
257
258 /// Get the child's styles
259 fn get_block_child_style(&self, child_node_id: NodeId) -> Self::ItemStyle<'_>;
260}
261
262// --- PRIVATE TRAITS
263
264/// A private trait which allows us to add extra convenience methods to types which implement
265/// LayoutTree without making those methods public.
266pub(crate) trait LayoutPartialTreeExt: LayoutPartialTree {
267 /// Compute the size of the node given the specified constraints
268 #[inline(always)]
269 #[allow(clippy::too_many_arguments)]
270 fn measure_child_size(
271 &mut self,
272 node_id: NodeId,
273 known_dimensions: Size<Option<f32>>,
274 parent_size: Size<Option<f32>>,
275 available_space: Size<AvailableSpace>,
276 sizing_mode: SizingMode,
277 axis: AbsoluteAxis,
278 vertical_margins_are_collapsible: Line<bool>,
279 ) -> f32 {
280 self.compute_child_layout(
281 node_id,
282 LayoutInput {
283 known_dimensions,
284 parent_size,
285 available_space,
286 sizing_mode,
287 axis: axis.into(),
288 run_mode: RunMode::ComputeSize,
289 vertical_margins_are_collapsible,
290 },
291 )
292 .size
293 .get_abs(axis)
294 }
295
296 /// Perform a full layout on the node given the specified constraints
297 #[inline(always)]
298 fn perform_child_layout(
299 &mut self,
300 node_id: NodeId,
301 known_dimensions: Size<Option<f32>>,
302 parent_size: Size<Option<f32>>,
303 available_space: Size<AvailableSpace>,
304 sizing_mode: SizingMode,
305 vertical_margins_are_collapsible: Line<bool>,
306 ) -> LayoutOutput {
307 self.compute_child_layout(
308 node_id,
309 LayoutInput {
310 known_dimensions,
311 parent_size,
312 available_space,
313 sizing_mode,
314 axis: RequestedAxis::Both,
315 run_mode: RunMode::PerformLayout,
316 vertical_margins_are_collapsible,
317 },
318 )
319 }
320}
321
322impl<T: LayoutPartialTree> LayoutPartialTreeExt for T {}