gioser

tawasuyu/taffy

A high performance rust-powered UI layout library

Rust 497HTML 254C 19JavaScript 81329 Definiciones

⎇ 0.3.x tests/generated/grid_overflow_rows.rs Rust · 80 líneas · 5.4 KB Historia Quién tocó qué crudo

Grid: Fixes for minmax, fr proportions and distributing space across multiple tracks (#349) 69995d972 · Nico Burns ·

1#[test]
2fn grid_overflow_rows() {
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_with_measure(
9            taffy::style::Style {
10                grid_column: taffy::geometry::Line { start: line(1i16), end: taffy::style::GridPlacement::Span(4u16) },
11                ..Default::default()
12            },
13            taffy::node::MeasureFunc::Raw(|known_dimensions, available_space| {
14                const TEXT: &str = "HHHHHHHHHHHHHHHH\u{200b}HHHHHHHHHHHHHHHH";
15                super::measure_standard_text(
16                    known_dimensions,
17                    available_space,
18                    TEXT,
19                    super::WritingMode::Horizontal,
20                    None,
21                )
22            }),
23        )
24        .unwrap();
25    let node1 = taffy.new_leaf(taffy::style::Style { ..Default::default() }).unwrap();
26    let node2 = taffy.new_leaf(taffy::style::Style { ..Default::default() }).unwrap();
27    let node3 = taffy.new_leaf(taffy::style::Style { ..Default::default() }).unwrap();
28    let node4 = taffy.new_leaf(taffy::style::Style { ..Default::default() }).unwrap();
29    let node5 = taffy.new_leaf(taffy::style::Style { ..Default::default() }).unwrap();
30    let node = taffy
31        .new_with_children(
32            taffy::style::Style {
33                display: taffy::style::Display::Grid,
34                grid_template_rows: vec![points(40f32), points(40f32)],
35                grid_template_columns: vec![min_content(), max_content(), points(10f32), percent(0.2f32)],
36                ..Default::default()
37            },
38            &[node0, node1, node2, node3, node4, node5],
39        )
40        .unwrap();
41    taffy.compute_layout(node, taffy::geometry::Size::MAX_CONTENT).unwrap();
42    println!("\nComputed tree:");
43    taffy::debug::print_tree(&taffy, node);
44    println!();
45    let Layout { size, location, .. } = taffy.layout(node).unwrap();
46    assert_eq!(size.width, 320f32, "width of node {:?}. Expected {}. Actual {}", node.data(), 320f32, size.width);
47    assert_eq!(size.height, 80f32, "height of node {:?}. Expected {}. Actual {}", node.data(), 80f32, size.height);
48    assert_eq!(location.x, 0f32, "x of node {:?}. Expected {}. Actual {}", node.data(), 0f32, location.x);
49    assert_eq!(location.y, 0f32, "y of node {:?}. Expected {}. Actual {}", node.data(), 0f32, location.y);
50    let Layout { size, location, .. } = taffy.layout(node0).unwrap();
51    assert_eq!(size.width, 320f32, "width of node {:?}. Expected {}. Actual {}", node0.data(), 320f32, size.width);
52    assert_eq!(size.height, 40f32, "height of node {:?}. Expected {}. Actual {}", node0.data(), 40f32, size.height);
53    assert_eq!(location.x, 0f32, "x of node {:?}. Expected {}. Actual {}", node0.data(), 0f32, location.x);
54    assert_eq!(location.y, 0f32, "y of node {:?}. Expected {}. Actual {}", node0.data(), 0f32, location.y);
55    let Layout { size, location, .. } = taffy.layout(node1).unwrap();
56    assert_eq!(size.width, 43f32, "width of node {:?}. Expected {}. Actual {}", node1.data(), 43f32, size.width);
57    assert_eq!(size.height, 40f32, "height of node {:?}. Expected {}. Actual {}", node1.data(), 40f32, size.height);
58    assert_eq!(location.x, 0f32, "x of node {:?}. Expected {}. Actual {}", node1.data(), 0f32, location.x);
59    assert_eq!(location.y, 40f32, "y of node {:?}. Expected {}. Actual {}", node1.data(), 40f32, location.y);
60    let Layout { size, location, .. } = taffy.layout(node2).unwrap();
61    assert_eq!(size.width, 203f32, "width of node {:?}. Expected {}. Actual {}", node2.data(), 203f32, size.width);
62    assert_eq!(size.height, 40f32, "height of node {:?}. Expected {}. Actual {}", node2.data(), 40f32, size.height);
63    assert_eq!(location.x, 43f32, "x of node {:?}. Expected {}. Actual {}", node2.data(), 43f32, location.x);
64    assert_eq!(location.y, 40f32, "y of node {:?}. Expected {}. Actual {}", node2.data(), 40f32, location.y);
65    let Layout { size, location, .. } = taffy.layout(node3).unwrap();
66    assert_eq!(size.width, 10f32, "width of node {:?}. Expected {}. Actual {}", node3.data(), 10f32, size.width);
67    assert_eq!(size.height, 40f32, "height of node {:?}. Expected {}. Actual {}", node3.data(), 40f32, size.height);
68    assert_eq!(location.x, 246f32, "x of node {:?}. Expected {}. Actual {}", node3.data(), 246f32, location.x);
69    assert_eq!(location.y, 40f32, "y of node {:?}. Expected {}. Actual {}", node3.data(), 40f32, location.y);
70    let Layout { size, location, .. } = taffy.layout(node4).unwrap();
71    assert_eq!(size.width, 64f32, "width of node {:?}. Expected {}. Actual {}", node4.data(), 64f32, size.width);
72    assert_eq!(size.height, 40f32, "height of node {:?}. Expected {}. Actual {}", node4.data(), 40f32, size.height);
73    assert_eq!(location.x, 256f32, "x of node {:?}. Expected {}. Actual {}", node4.data(), 256f32, location.x);
74    assert_eq!(location.y, 40f32, "y of node {:?}. Expected {}. Actual {}", node4.data(), 40f32, location.y);
75    let Layout { size, location, .. } = taffy.layout(node5).unwrap();
76    assert_eq!(size.width, 43f32, "width of node {:?}. Expected {}. Actual {}", node5.data(), 43f32, size.width);
77    assert_eq!(size.height, 0f32, "height of node {:?}. Expected {}. Actual {}", node5.data(), 0f32, size.height);
78    assert_eq!(location.x, 0f32, "x of node {:?}. Expected {}. Actual {}", node5.data(), 0f32, location.x);
79    assert_eq!(location.y, 80f32, "y of node {:?}. Expected {}. Actual {}", node5.data(), 80f32, location.y);
80}