Struct StaticTopTreeDataBuilder 

struct StaticTopTreeDataBuilder<C>
where
    C: Cluster,
{
    compressed: Vec<MaybeUninit<InnerValue<<C as Cluster>::Path>>>,
    raked: Vec<MaybeUninit<InnerValue<<C as Cluster>::Point>>>,
    light_points: Vec<<C as Cluster>::Point>,
}

Fields

compressed: Vec<MaybeUninit<InnerValue<<C as Cluster>::Path>>>

raked: Vec<MaybeUninit<InnerValue<<C as Cluster>::Point>>>

light_points: Vec<<C as Cluster>::Point>

Implementations

impl<C> StaticTopTreeDataBuilder<C>

where C: Cluster,

fn new(tree: &StaticTopTree) -> Self

Examples found in repository

crates/competitive/src/tree/static_top_tree.rs (line 465)

    pub fn new(
        tree: &'a StaticTopTree,
        vertices: Vec<<C as Cluster>::Vertex>,
        edges: Vec<<C as Cluster>::Edge>,
    ) -> Self {
        assert_eq!(vertices.len(), tree.vertices_size());
        assert_eq!(edges.len(), tree.edges_size());

        let mut data: StaticTopTreeDataBuilder<C> = StaticTopTreeDataBuilder::new(tree);
        let path = tree.init_compress(
            &mut data,
            &vertices,
            &edges,
            tree.compress_roots[tree.root].expect("root compress tree must exist"),
        );
        let all_point = C::add_edge(&path);
        Self {
            tree,
            vertices,
            edges,
            compressed: unsafe { assume_init_vec(data.compressed) },
            raked: unsafe { assume_init_vec(data.raked) },
            light_points: data.light_points,
            all_point,
        }
    }