Struct TileNode 

pub struct TileNode {
    pub kind: TileNodeKind,
    pub rect: PictureBox2D,
}

A node in the dirty rect tracking quadtree.

Fields

kind: TileNodeKind

Leaf or internal node

rect: PictureBox2D

Rect of this node in the same space as the tile cache picture

Implementations

impl TileNode

fn new_leaf(curr_indices: Vec<PrimitiveDependencyIndex>) -> Self

Construct a new leaf node, with the given primitive dependency index buffer

fn draw_debug_rects( &self, pic_to_world_mapper: &SpaceMapper<PicturePixel, WorldPixel>, is_opaque: bool, local_valid_rect: PictureRect, scratch: &mut PrimitiveScratchBuffer, global_device_pixel_scale: DevicePixelScale, )

Draw debug information about this tile node

fn get_child_rects(rect: &PictureBox2D, result: &mut [PictureBox2D; 4])

Calculate the four child rects for a given node

fn clear(&mut self, rect: PictureBox2D)

Called during pre_update, to clear the current dependencies

fn add_prim( &mut self, index: PrimitiveDependencyIndex, prim_rect: &PictureBox2D, )

Add a primitive dependency to this node

fn maybe_merge_or_split( &mut self, level: i32, curr_prims: &[PrimitiveDescriptor], max_split_levels: i32, )

Apply a merge or split operation to this tile, if desired

fn update_dirty_rects( &mut self, prev_prims: &[PrimitiveDescriptor], curr_prims: &[PrimitiveDescriptor], prim_comparer: &mut PrimitiveComparer<'_>, dirty_rect: &mut PictureBox2D, compare_cache: &mut FastHashMap<PrimitiveComparisonKey, PrimitiveCompareResult>, invalidation_reason: &mut Option<InvalidationReason>, frame_context: &FrameVisibilityContext<'_>, )

Update the dirty state of this node, building the overall dirty rect

Trait Implementations

impl Clone for TileNode

fn clone(&self) -> TileNode

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Serialize for TileNode

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.