struct QuerySelectorProcessor<'a, 'b, E, Q>{
results: &'a mut Q::Output,
matching_context: MatchingContext<'b, E::Impl>,
traversal_map: SiblingTraversalMap<E>,
dependencies: &'a [Dependency],
}
Fields§
§results: &'a mut Q::Output
§matching_context: MatchingContext<'b, E::Impl>
§traversal_map: SiblingTraversalMap<E>
§dependencies: &'a [Dependency]
Trait Implementations§
Source§impl<'a, 'b, E, Q> InvalidationProcessor<'a, 'b, E> for QuerySelectorProcessor<'a, 'b, E, Q>
impl<'a, 'b, E, Q> InvalidationProcessor<'a, 'b, E> for QuerySelectorProcessor<'a, 'b, E, Q>
Source§fn light_tree_only(&self) -> bool
fn light_tree_only(&self) -> bool
Whether the invalidation processor only cares about light-tree
descendants of a given element, that is, doesn’t invalidate
pseudo-elements, NAC, shadow dom…
Source§fn check_outer_dependency(&mut self, _: &Dependency, _: E) -> bool
fn check_outer_dependency(&mut self, _: &Dependency, _: E) -> bool
When a dependency from a :where or :is selector matches, it may still be
the case that we don’t need to invalidate the full style. Consider the
case of: Read more
Source§fn collect_invalidations(
&mut self,
element: E,
self_invalidations: &mut InvalidationVector<'a>,
descendant_invalidations: &mut DescendantInvalidationLists<'a>,
_sibling_invalidations: &mut InvalidationVector<'a>,
) -> bool
fn collect_invalidations( &mut self, element: E, self_invalidations: &mut InvalidationVector<'a>, descendant_invalidations: &mut DescendantInvalidationLists<'a>, _sibling_invalidations: &mut InvalidationVector<'a>, ) -> bool
Collect invalidations for a given element’s descendants and siblings. Read more
Source§fn matching_context(&mut self) -> &mut MatchingContext<'b, E::Impl>
fn matching_context(&mut self) -> &mut MatchingContext<'b, E::Impl>
The matching context that should be used to process invalidations.
Source§fn sibling_traversal_map(&self) -> &SiblingTraversalMap<E>
fn sibling_traversal_map(&self) -> &SiblingTraversalMap<E>
The traversal map that should be used to process invalidations.
Source§fn should_process_descendants(&mut self, _: E) -> bool
fn should_process_descendants(&mut self, _: E) -> bool
Returns whether the invalidation process should process the descendants
of the given element.
Source§fn invalidated_self(&mut self, e: E)
fn invalidated_self(&mut self, e: E)
Executes an action when
Self
is invalidated.Source§fn invalidated_sibling(&mut self, e: E, _of: E)
fn invalidated_sibling(&mut self, e: E, _of: E)
Executes an action when
sibling
is invalidated as a sibling of
of
.Source§fn recursion_limit_exceeded(&mut self, _e: E)
fn recursion_limit_exceeded(&mut self, _e: E)
Executes an arbitrary action when the recursion limit is exceded (if
any).
Source§fn invalidated_descendants(&mut self, _e: E, _child: E)
fn invalidated_descendants(&mut self, _e: E, _child: E)
Executes an action when any descendant of
Self
is invalidated.Source§fn invalidates_on_pseudo_element(&self) -> bool
fn invalidates_on_pseudo_element(&self) -> bool
Whether an invalidation that contains only a pseudo-element selector
like ::before or ::after triggers invalidation of the element that would
originate it.
Source§fn found_relative_selector_invalidation(
&mut self,
_element: E,
_kind: RelativeDependencyInvalidationKind,
_relative_dependency: &'a Dependency,
)
fn found_relative_selector_invalidation( &mut self, _element: E, _kind: RelativeDependencyInvalidationKind, _relative_dependency: &'a Dependency, )
Executes an action when an element in a relative selector is reached.
Lets the dependency to be borrowed for further processing out of the
invalidation traversal.
Auto Trait Implementations§
impl<'a, 'b, E, Q> Freeze for QuerySelectorProcessor<'a, 'b, E, Q>where
E: Freeze,
impl<'a, 'b, E, Q> !RefUnwindSafe for QuerySelectorProcessor<'a, 'b, E, Q>
impl<'a, 'b, E, Q> !Send for QuerySelectorProcessor<'a, 'b, E, Q>
impl<'a, 'b, E, Q> !Sync for QuerySelectorProcessor<'a, 'b, E, Q>
impl<'a, 'b, E, Q> Unpin for QuerySelectorProcessor<'a, 'b, E, Q>where
E: Unpin,
impl<'a, 'b, E, Q> !UnwindSafe for QuerySelectorProcessor<'a, 'b, E, Q>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> MaybeBoxed<Box<T>> for T
impl<T> MaybeBoxed<Box<T>> for T
Source§fn maybe_boxed(self) -> Box<T>
fn maybe_boxed(self) -> Box<T>
Convert
Source§impl<T> MaybeBoxed<T> for T
impl<T> MaybeBoxed<T> for T
Source§fn maybe_boxed(self) -> T
fn maybe_boxed(self) -> T
Convert