Skip to main content

AmrtTree

Struct AmrtTree 

Source
pub struct AmrtTree {
    pub nodes: Vec<AmrtNode>,
    pub max_level: usize,
    pub domain: [f64; 6],
}
Expand description

Oct-tree AMR data structure.

Manages a spatially recursive oct-tree where each node can be refined into 8 children. Nodes are stored in a flat Vec for cache-friendly traversal.

Fields§

§nodes: Vec<AmrtNode>

Flat storage of all nodes.

§max_level: usize

Maximum allowed refinement level.

§domain: [f64; 6]

Domain bounds \[x_min, y_min, z_min, x_max, y_max, z_max\].

Implementations§

Source§

impl AmrtTree

Source

pub fn new(domain: [f64; 6], max_level: usize) -> Self

Create a new empty oct-tree.

Source

pub fn init_root(&mut self)

Initialise the tree with a single root node at level 0.

Source

pub fn refine(&mut self, node_idx: usize) -> bool

Refine the leaf at node_idx into 8 children.

Returns false if the node is already at max_level or is not a leaf.

Source

pub fn coarsen(&mut self, parent_idx: usize) -> bool

Coarsen a set of 8 sibling leaves back to their parent.

Returns false if any sibling is not a leaf.

Source

pub fn leaf_count(&self) -> usize

Count active (non-deleted) leaf nodes.

Source

pub fn max_active_level(&self) -> usize

Depth of the tree (maximum level among all active leaves).

Source

pub fn cell_size_at(&self, level: usize) -> [f64; 3]

Physical cell size at a given refinement level.

Source

pub fn node_centre(&self, node_idx: usize) -> [f64; 3]

Physical centre of the node at node_idx.

Trait Implementations§

Source§

impl Debug for AmrtTree

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl Default for AmrtTree

Source§

fn default() -> AmrtTree

Returns the “default value” for a type. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.