Struct veloren_world::layer::tree::ProceduralTree

pub struct ProceduralTree {
    branches: Vec<Branch>,
    trunk_idx: usize,
    config: TreeConfig,
    roots: Vec<Root>,
    root_aabb: Aabb<f32>,
}

Fields

branches: Vec<Branch>

trunk_idx: usize

config: TreeConfig

roots: Vec<Root>

root_aabb: Aabb<f32>

Implementations

impl ProceduralTree

pub fn generate(config: TreeConfig, rng: &mut impl Rng) -> Self

Generate a new tree using the given configuration and seed.

fn add_branch( &mut self, config: &TreeConfig, start: Vec3<f32>, dir: Vec3<f32>, branch_len: f32, branch_radius: f32, depth: usize, sibling_idx: Option<usize>, proportion: f32, rng: &mut impl Rng, ) -> (usize, Aabb<f32>)

pub fn get_bounds(&self) -> Aabb<f32>

Get the bounding box that covers the tree (all branches and leaves)

fn walk_inner( &self, descend: &mut impl FnMut(&Branch, &Branch) -> bool, parent: &Branch, branch_idx: usize, )

pub fn walk<F: FnMut(&Branch, &Branch) -> bool>(&self, f: F)

Recursively walk the tree’s branches, calling the current closure with the branch and its parent. If the closure returns false, recursion into the child branches is skipped.

pub fn is_branch_or_leaves_at(&self, pos: Vec3<f32>) -> (bool, bool, bool, bool)

Determine whether there are either branches or leaves at the given position in the tree.