Struct AndVisibility 

pub struct AndVisibility<A, B> {
    pub left: A,
    pub right: B,
}

Visibility filter that requires both child filters to pass.

Fields

left: A

First filter.

right: B

Second filter.

Implementations

impl<A, B> AndVisibility<A, B>

pub const fn new(left: A, right: B) -> Self

Creates a filter that accepts only entities accepted by both filters.

Trait Implementations

impl<A: Clone, B: Clone> Clone for AndVisibility<A, B>

fn clone(&self) -> AndVisibility<A, B>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<A: Copy, B: Copy> Copy for AndVisibility<A, B>

impl<A: Debug, B: Debug> Debug for AndVisibility<A, B>

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

Formats the value using the given formatter.

impl<A: Eq, B: Eq> Eq for AndVisibility<A, B>

impl<A: PartialEq, B: PartialEq> PartialEq for AndVisibility<A, B>

fn eq(&self, other: &AndVisibility<A, B>) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl<A: PartialEq, B: PartialEq> StructuralPartialEq for AndVisibility<A, B>

impl<A, B> VisibilityFilter for AndVisibility<A, B>

where A: VisibilityFilter, B: VisibilityFilter,

fn is_visible(&self, viewer: &ViewerQuery, entity: &EntityRecord) -> bool

Returns whether an entity is visible enough to be considered.

fn is_visible_with_distance( &self, viewer: &ViewerQuery, entity: &EntityRecord, distance_squared: f32, ) -> bool

Returns visibility when the planner already computed squared distance.