⎇ ae87fd0283feff32a5ceffe4c77394ff6ca88d39
tests/generated/align_flex_start_with_shrinking_children.rs
History
Who touched what
raw
Reinstate FlexStart and FlexEnd alignment variants (#336)
1#[test]
2fn align_flex_start_with_shrinking_children() {
3 use slotmap::Key;
4 #[allow(unused_imports)]
5 use taffy::{layout::Layout, prelude::*};
6 let mut taffy = taffy::Taffy::new();
7 let node000 =
8 taffy.new_leaf(taffy::style::Style { flex_grow: 1f32, flex_shrink: 1f32, ..Default::default() }).unwrap();
9 let node00 = taffy
10 .new_with_children(taffy::style::Style { flex_grow: 1f32, flex_shrink: 1f32, ..Default::default() }, &[node000])
11 .unwrap();
12 let node0 = taffy
13 .new_with_children(
14 taffy::style::Style { align_items: Some(taffy::style::AlignItems::FlexStart), ..Default::default() },
15 &[node00],
16 )
17 .unwrap();
18 let node = taffy
19 .new_with_children(
20 taffy::style::Style {
21 size: taffy::geometry::Size {
22 width: taffy::style::Dimension::Points(500f32),
23 height: taffy::style::Dimension::Points(500f32),
24 },
25 ..Default::default()
26 },
27 &[node0],
28 )
29 .unwrap();
30 taffy.compute_layout(node, taffy::geometry::Size::MAX_CONTENT).unwrap();
31 println!("\nComputed tree:");
32 taffy::debug::print_tree(&taffy, node);
33 println!();
34 let Layout { size, location, .. } = taffy.layout(node).unwrap();
35 assert_eq!(size.width, 500f32, "width of node {:?}. Expected {}. Actual {}", node.data(), 500f32, size.width);
36 assert_eq!(size.height, 500f32, "height of node {:?}. Expected {}. Actual {}", node.data(), 500f32, size.height);
37 assert_eq!(location.x, 0f32, "x of node {:?}. Expected {}. Actual {}", node.data(), 0f32, location.x);
38 assert_eq!(location.y, 0f32, "y of node {:?}. Expected {}. Actual {}", node.data(), 0f32, location.y);
39 let Layout { size, location, .. } = taffy.layout(node0).unwrap();
40 assert_eq!(size.width, 0f32, "width of node {:?}. Expected {}. Actual {}", node0.data(), 0f32, size.width);
41 assert_eq!(size.height, 500f32, "height of node {:?}. Expected {}. Actual {}", node0.data(), 500f32, size.height);
42 assert_eq!(location.x, 0f32, "x of node {:?}. Expected {}. Actual {}", node0.data(), 0f32, location.x);
43 assert_eq!(location.y, 0f32, "y of node {:?}. Expected {}. Actual {}", node0.data(), 0f32, location.y);
44 let Layout { size, location, .. } = taffy.layout(node00).unwrap();
45 assert_eq!(size.width, 0f32, "width of node {:?}. Expected {}. Actual {}", node00.data(), 0f32, size.width);
46 assert_eq!(size.height, 0f32, "height of node {:?}. Expected {}. Actual {}", node00.data(), 0f32, size.height);
47 assert_eq!(location.x, 0f32, "x of node {:?}. Expected {}. Actual {}", node00.data(), 0f32, location.x);
48 assert_eq!(location.y, 0f32, "y of node {:?}. Expected {}. Actual {}", node00.data(), 0f32, location.y);
49 let Layout { size, location, .. } = taffy.layout(node000).unwrap();
50 assert_eq!(size.width, 0f32, "width of node {:?}. Expected {}. Actual {}", node000.data(), 0f32, size.width);
51 assert_eq!(size.height, 0f32, "height of node {:?}. Expected {}. Actual {}", node000.data(), 0f32, size.height);
52 assert_eq!(location.x, 0f32, "x of node {:?}. Expected {}. Actual {}", node000.data(), 0f32, location.x);
53 assert_eq!(location.y, 0f32, "y of node {:?}. Expected {}. Actual {}", node000.data(), 0f32, location.y);
54}