Struct style::invalidation::element::relative_selector::RelativeSelectorInnerInvalidationProcessor
source · pub struct RelativeSelectorInnerInvalidationProcessor<'a, 'b, 'c, E>where
E: TElement + 'a,{
matching_context: MatchingContext<'b, E::Impl>,
snapshot_table: Option<&'c SnapshotMap>,
dependencies: &'c SmallVec<[(Option<OpaqueElement>, &'a Dependency); 1]>,
invalidations: SmallVec<[(E, RelativeSelectorInvalidation<'a>); 1]>,
traversal_map: &'b SiblingTraversalMap<E>,
}
Expand description
Invalidation for the selector(s) inside a relative selector.
Fields§
§matching_context: MatchingContext<'b, E::Impl>
Matching context to be used.
snapshot_table: Option<&'c SnapshotMap>
Table of snapshots.
dependencies: &'c SmallVec<[(Option<OpaqueElement>, &'a Dependency); 1]>
Incoming dependencies to be processed.
invalidations: SmallVec<[(E, RelativeSelectorInvalidation<'a>); 1]>
Generated invalidations.
traversal_map: &'b SiblingTraversalMap<E>
Traversal map for this invalidation.
Implementations§
source§impl<'a, 'b, 'c, E> RelativeSelectorInnerInvalidationProcessor<'a, 'b, 'c, E>where
E: TElement + 'a,
impl<'a, 'b, 'c, E> RelativeSelectorInnerInvalidationProcessor<'a, 'b, 'c, E>where
E: TElement + 'a,
fn new( quirks_mode: QuirksMode, snapshot_table: Option<&'c ServoElementSnapshotTable>, dependencies: &'c SmallVec<[(Option<OpaqueElement>, &'a Dependency); 1]>, selector_caches: &'b mut SelectorCaches, traversal_map: &'b SiblingTraversalMap<E>, ) -> Self
fn note_dependency( &mut self, element: E, scope: Option<OpaqueElement>, dependency: &'a Dependency, descendant_invalidations: &mut DescendantInvalidationLists<'a>, sibling_invalidations: &mut InvalidationVector<'a>, )
sourcefn take_invalidations(
self,
) -> SmallVec<[(E, RelativeSelectorInvalidation<'a>); 1]> ⓘ
fn take_invalidations( self, ) -> SmallVec<[(E, RelativeSelectorInvalidation<'a>); 1]> ⓘ
Take the generated invalidations.
Trait Implementations§
source§impl<'a, 'b, 'c, E> InvalidationProcessor<'a, 'b, E> for RelativeSelectorInnerInvalidationProcessor<'a, 'b, 'c, E>where
E: TElement + 'a,
impl<'a, 'b, 'c, E> InvalidationProcessor<'a, 'b, E> for RelativeSelectorInnerInvalidationProcessor<'a, 'b, 'c, E>where
E: TElement + 'a,
source§fn check_outer_dependency(
&mut self,
dependency: &Dependency,
element: E,
) -> bool
fn check_outer_dependency( &mut self, dependency: &Dependency, element: 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 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 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 should_process_descendants(&mut self, _element: E) -> bool
fn should_process_descendants(&mut self, _element: E) -> bool
Returns whether the invalidation process should process the descendants
of the given element.
source§fn recursion_limit_exceeded(&mut self, _element: E)
fn recursion_limit_exceeded(&mut self, _element: E)
Executes an arbitrary action when the recursion limit is exceded (if
any).
source§fn invalidated_self(&mut self, _element: E)
fn invalidated_self(&mut self, _element: E)
Executes an action when
Self
is invalidated.source§fn invalidated_sibling(&mut self, _sibling: E, _of: E)
fn invalidated_sibling(&mut self, _sibling: E, _of: E)
Executes an action when
sibling
is invalidated as a sibling of
of
.source§fn invalidated_descendants(&mut self, _element: E, _child: E)
fn invalidated_descendants(&mut self, _element: E, _child: E)
Executes an action when any descendant of
Self
is invalidated.source§fn found_relative_selector_invalidation(
&mut self,
element: E,
kind: RelativeDependencyInvalidationKind,
dep: &'a Dependency,
)
fn found_relative_selector_invalidation( &mut self, element: E, kind: RelativeDependencyInvalidationKind, dep: &'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.
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 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 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…
Auto Trait Implementations§
impl<'a, 'b, 'c, E> Freeze for RelativeSelectorInnerInvalidationProcessor<'a, 'b, 'c, E>where
E: Freeze,
impl<'a, 'b, 'c, E> !RefUnwindSafe for RelativeSelectorInnerInvalidationProcessor<'a, 'b, 'c, E>
impl<'a, 'b, 'c, E> !Send for RelativeSelectorInnerInvalidationProcessor<'a, 'b, 'c, E>
impl<'a, 'b, 'c, E> !Sync for RelativeSelectorInnerInvalidationProcessor<'a, 'b, 'c, E>
impl<'a, 'b, 'c, E> Unpin for RelativeSelectorInnerInvalidationProcessor<'a, 'b, 'c, E>where
E: Unpin,
impl<'a, 'b, 'c, E> !UnwindSafe for RelativeSelectorInnerInvalidationProcessor<'a, 'b, 'c, E>
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