⎇ 859cc921b3adb8e3b184e6fc0cf0c40b6c5a625b
tests/generated/grid_placement_auto_negative.rs
Ñawpa willay
Pi imata llamkarqan
ch'uya
Grid/refactor coordinate handling (#301)
1#[test]
2fn grid_placement_auto_negative() {
3 use slotmap::Key;
4 #[allow(unused_imports)]
5 use taffy::{layout::Layout, prelude::*};
6 let mut taffy = taffy::Taffy::new();
7 let node0 = taffy
8 .new_leaf(taffy::style::Style {
9 grid_row: taffy::geometry::Line { start: line(1i16), end: taffy::style::GridPlacement::Auto },
10 grid_column: taffy::geometry::Line { start: line(-5i16), end: taffy::style::GridPlacement::Auto },
11 ..Default::default()
12 })
13 .unwrap();
14 let node1 = taffy.new_leaf(taffy::style::Style { ..Default::default() }).unwrap();
15 let node2 = taffy
16 .new_leaf(taffy::style::Style {
17 grid_row: taffy::geometry::Line { start: line(2i16), end: taffy::style::GridPlacement::Auto },
18 ..Default::default()
19 })
20 .unwrap();
21 let node = taffy
22 .new_with_children(
23 taffy::style::Style {
24 display: taffy::style::Display::Grid,
25 grid_template_rows: vec![points(40f32), points(40f32)],
26 grid_template_columns: vec![points(40f32), points(40f32)],
27 size: taffy::geometry::Size {
28 width: taffy::style::Dimension::Points(120f32),
29 height: taffy::style::Dimension::Points(120f32),
30 },
31 ..Default::default()
32 },
33 &[node0, node1, node2],
34 )
35 .unwrap();
36 taffy.compute_layout(node, taffy::geometry::Size::MAX_CONTENT).unwrap();
37 println!("\nComputed tree:");
38 taffy::debug::print_tree(&taffy, node);
39 println!();
40 let Layout { size, location, .. } = taffy.layout(node).unwrap();
41 assert_eq!(size.width, 120f32, "width of node {:?}. Expected {}. Actual {}", node.data(), 120f32, size.width);
42 assert_eq!(size.height, 120f32, "height of node {:?}. Expected {}. Actual {}", node.data(), 120f32, size.height);
43 assert_eq!(location.x, 0f32, "x of node {:?}. Expected {}. Actual {}", node.data(), 0f32, location.x);
44 assert_eq!(location.y, 0f32, "y of node {:?}. Expected {}. Actual {}", node.data(), 0f32, location.y);
45 let Layout { size, location, .. } = taffy.layout(node0).unwrap();
46 assert_eq!(size.width, 20f32, "width of node {:?}. Expected {}. Actual {}", node0.data(), 20f32, size.width);
47 assert_eq!(size.height, 40f32, "height of node {:?}. Expected {}. Actual {}", node0.data(), 40f32, size.height);
48 assert_eq!(location.x, 0f32, "x of node {:?}. Expected {}. Actual {}", node0.data(), 0f32, location.x);
49 assert_eq!(location.y, 0f32, "y of node {:?}. Expected {}. Actual {}", node0.data(), 0f32, location.y);
50 let Layout { size, location, .. } = taffy.layout(node1).unwrap();
51 assert_eq!(size.width, 20f32, "width of node {:?}. Expected {}. Actual {}", node1.data(), 20f32, size.width);
52 assert_eq!(size.height, 40f32, "height of node {:?}. Expected {}. Actual {}", node1.data(), 40f32, size.height);
53 assert_eq!(location.x, 20f32, "x of node {:?}. Expected {}. Actual {}", node1.data(), 20f32, location.x);
54 assert_eq!(location.y, 0f32, "y of node {:?}. Expected {}. Actual {}", node1.data(), 0f32, location.y);
55 let Layout { size, location, .. } = taffy.layout(node2).unwrap();
56 assert_eq!(size.width, 20f32, "width of node {:?}. Expected {}. Actual {}", node2.data(), 20f32, size.width);
57 assert_eq!(size.height, 40f32, "height of node {:?}. Expected {}. Actual {}", node2.data(), 40f32, size.height);
58 assert_eq!(location.x, 0f32, "x of node {:?}. Expected {}. Actual {}", node2.data(), 0f32, location.x);
59 assert_eq!(location.y, 40f32, "y of node {:?}. Expected {}. Actual {}", node2.data(), 40f32, location.y);
60}