#[repr(C)]pub(crate) struct IterableIterator<D, T>{
reflector: Reflector,
iterable: Dom<T>,
type_: IteratorType,
index: Cell<u32>,
_marker: NoTrace<PhantomData<D>>,
}
Expand description
An iterator over the iterable entries of a given DOM interface.
Fields§
§reflector: Reflector
§iterable: Dom<T>
§type_: IteratorType
§index: Cell<u32>
§_marker: NoTrace<PhantomData<D>>
Implementations§
Source§impl<D, T> IterableIterator<D, T>
impl<D, T> IterableIterator<D, T>
Source§impl<D, T> IterableIterator<D, T>
impl<D, T> IterableIterator<D, T>
Trait Implementations§
Source§impl<D, T> DomObject for IterableIterator<D, T>
impl<D, T> DomObject for IterableIterator<D, T>
Source§impl<D, T> DomObjectWrap<D> for IterableIterator<D, T>
impl<D, T> DomObjectWrap<D> for IterableIterator<D, T>
Source§impl<D, T> IDLInterface for IterableIterator<D, T>where
D: DomTypes,
T: DomObjectIteratorWrap<D> + Traceable + Iterable + DomGlobalGeneric<D> + IDLInterface + IteratorDerives,
impl<D, T> IDLInterface for IterableIterator<D, T>where
D: DomTypes,
T: DomObjectIteratorWrap<D> + Traceable + Iterable + DomGlobalGeneric<D> + IDLInterface + IteratorDerives,
Source§impl<D, T> MallocSizeOf for IterableIterator<D, T>where
D: DomTypes + MallocSizeOf,
T: DomObjectIteratorWrap<D> + Traceable + Iterable + DomGlobalGeneric<D> + MallocSizeOf,
impl<D, T> MallocSizeOf for IterableIterator<D, T>where
D: DomTypes + MallocSizeOf,
T: DomObjectIteratorWrap<D> + Traceable + Iterable + DomGlobalGeneric<D> + MallocSizeOf,
Source§fn size_of(&self, ops: &mut MallocSizeOfOps) -> usize
fn size_of(&self, ops: &mut MallocSizeOfOps) -> usize
Measure the heap usage of all descendant heap-allocated structures, but
not the space taken up by the value itself.
Source§impl<D, T> MutDomObject for IterableIterator<D, T>
impl<D, T> MutDomObject for IterableIterator<D, T>
Source§impl<D, T> PartialEq for IterableIterator<D, T>
impl<D, T> PartialEq for IterableIterator<D, T>
Source§impl<D, T> ToJSValConvertible for IterableIterator<D, T>
impl<D, T> ToJSValConvertible for IterableIterator<D, T>
Source§impl<D, T> Traceable for IterableIterator<D, T>where
D: DomTypes + Traceable,
T: DomObjectIteratorWrap<D> + Traceable + Iterable + DomGlobalGeneric<D>,
impl<D, T> Traceable for IterableIterator<D, T>where
D: DomTypes + Traceable,
T: DomObjectIteratorWrap<D> + Traceable + Iterable + DomGlobalGeneric<D>,
impl<D, T> Eq for IterableIterator<D, T>
Auto Trait Implementations§
impl<D, T> !Freeze for IterableIterator<D, T>
impl<D, T> !RefUnwindSafe for IterableIterator<D, T>
impl<D, T> !Send for IterableIterator<D, T>
impl<D, T> !Sync for IterableIterator<D, T>
impl<D, T> Unpin for IterableIterator<D, T>where
D: Unpin,
impl<D, T> UnwindSafe for IterableIterator<D, T>where
T: RefUnwindSafe,
D: UnwindSafe,
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<D, T> DomGlobalGeneric<D> for T
impl<D, T> DomGlobalGeneric<D> for T
Source§fn global_(&self, realm: InRealm<'_>) -> Root<Dom<<D as DomTypes>::GlobalScope>>where
Self: Sized,
fn global_(&self, realm: InRealm<'_>) -> Root<Dom<<D as DomTypes>::GlobalScope>>where
Self: Sized,
Returns the [
GlobalScope
] of the realm that the DomObject
was created in. If this
object is a Node
, this will be different from it’s owning Document
if adopted by. For
Node
s it’s almost always better to use NodeTraits::owning_global
.Source§fn global(&self) -> Root<Dom<<D as DomTypes>::GlobalScope>>where
Self: Sized,
fn global(&self) -> Root<Dom<<D as DomTypes>::GlobalScope>>where
Self: Sized,
Returns the [
GlobalScope
] of the realm that the DomObject
was created in. If this
object is a Node
, this will be different from it’s owning Document
if adopted by. For
Node
s it’s almost always better to use NodeTraits::owning_global
.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.Source§impl<T> Filterable for T
impl<T> Filterable for T
Source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(_: DataRequest<'_>) -> bool>
Creates a filterable data provider with the given name for debugging. Read more
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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