Struct CompositionHitTestAabbTree 

pub struct CompositionHitTestAabbTree { /* private fields */ }

An index of the children of a visual for hit testing: the children are grouped into buckets by their order, and each bucket is a dynamic tree of axis-aligned bounding boxes.

Implementations

impl CompositionHitTestAabbTree

pub fn new(children: Rc<CompositionVisualCollection>) -> Self

pub fn clear(&mut self)

pub fn update(&mut self, visual: &Rc<CompositionVisual>, order: i32)

pub fn remove(&mut self, visual: &Rc<CompositionVisual>)

pub fn update_order(&mut self, visual: &Rc<CompositionVisual>, order: i32)

pub fn query<H: ICompositionHitTester>( &mut self, input: &H::Input, results: &mut Vec<Rc<CompositionVisual>>, readback_revision: u64, )

Appends the children that may be hit by input to results, topmost first.

pub fn query_first<H: ICompositionHitTester>( &mut self, target: &CompositionTarget, input: &H::Input, filter: Option<&'_ dyn Fn(&Rc<CompositionVisual>) -> bool>, result_filter: Option<&'_ dyn Fn(&Rc<CompositionVisual>) -> bool>, readback_revision: u64, ) -> (Option<Rc<CompositionVisual>>, IntersectionResult)

Finds the topmost hit among the children that may be hit by input.