Struct script::dom::namednodemap::NamedNodeMap
source · #[repr(C)]pub struct NamedNodeMap {
reflector_: Reflector,
owner: Dom<Element>,
}
Fields§
§reflector_: Reflector
§owner: Dom<Element>
Implementations§
source§impl NamedNodeMap
impl NamedNodeMap
fn new_inherited(elem: &Element) -> NamedNodeMap
pub fn new(window: &Window, elem: &Element) -> Root<Dom<NamedNodeMap>>
Trait Implementations§
source§impl DomObject for NamedNodeMap
impl DomObject for NamedNodeMap
source§impl DomObjectWrap for NamedNodeMap
impl DomObjectWrap for NamedNodeMap
source§const WRAP: unsafe fn(_: SafeJSContext, _: &GlobalScope, _: Option<HandleObject<'_>>, _: Box<Self>, _: CanGc) -> Root<Dom<Self>> = {dom::bindings::codegen::Bindings::NamedNodeMapBinding::NamedNodeMap_Binding::Wrap as for<'a, 'b> unsafe fn(script_runtime::JSContext, &'a dom::globalscope::GlobalScope, std::option::Option<js::rust::Handle<'b, *mut js::jsapi::JSObject>>, std::boxed::Box<dom::namednodemap::NamedNodeMap>, script_runtime::CanGc) -> dom::bindings::root::Root<dom::bindings::root::Dom<dom::namednodemap::NamedNodeMap>>}
const WRAP: unsafe fn(_: SafeJSContext, _: &GlobalScope, _: Option<HandleObject<'_>>, _: Box<Self>, _: CanGc) -> Root<Dom<Self>> = {dom::bindings::codegen::Bindings::NamedNodeMapBinding::NamedNodeMap_Binding::Wrap as for<'a, 'b> unsafe fn(script_runtime::JSContext, &'a dom::globalscope::GlobalScope, std::option::Option<js::rust::Handle<'b, *mut js::jsapi::JSObject>>, std::boxed::Box<dom::namednodemap::NamedNodeMap>, script_runtime::CanGc) -> dom::bindings::root::Root<dom::bindings::root::Dom<dom::namednodemap::NamedNodeMap>>}
Function pointer to the general wrap function type
source§impl HasParent for NamedNodeMap
impl HasParent for NamedNodeMap
source§impl IDLInterface for NamedNodeMap
impl IDLInterface for NamedNodeMap
source§impl MallocSizeOf for NamedNodeMap
impl MallocSizeOf for NamedNodeMap
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 MutDomObject for NamedNodeMap
impl MutDomObject for NamedNodeMap
source§impl NamedNodeMapMethods<DomTypeHolder> for NamedNodeMap
impl NamedNodeMapMethods<DomTypeHolder> for NamedNodeMap
fn Length(&self) -> u32
fn Item(&self, index: u32) -> Option<Root<Dom<Attr>>>
fn GetNamedItem(&self, name: DOMString) -> Option<Root<Dom<Attr>>>
fn GetNamedItemNS( &self, namespace: Option<DOMString>, local_name: DOMString, ) -> Option<Root<Dom<Attr>>>
fn SetNamedItem(&self, attr: &Attr) -> Result<Option<Root<Dom<Attr>>>, Error>
fn SetNamedItemNS(&self, attr: &Attr) -> Result<Option<Root<Dom<Attr>>>, Error>
fn RemoveNamedItem(&self, name: DOMString) -> Result<Root<Dom<Attr>>, Error>
fn RemoveNamedItemNS( &self, namespace: Option<DOMString>, local_name: DOMString, ) -> Result<Root<Dom<Attr>>, Error>
fn IndexedGetter(&self, index: u32) -> Option<Root<Dom<Attr>>>
fn NamedGetter(&self, name: DOMString) -> Option<Root<Dom<Attr>>>
fn SupportedPropertyNames(&self) -> Vec<DOMString>
source§impl PartialEq for NamedNodeMap
impl PartialEq for NamedNodeMap
source§impl ToJSValConvertible for NamedNodeMap
impl ToJSValConvertible for NamedNodeMap
source§impl Traceable for NamedNodeMap
impl Traceable for NamedNodeMap
impl Eq for NamedNodeMap
Auto Trait Implementations§
impl !Freeze for NamedNodeMap
impl !RefUnwindSafe for NamedNodeMap
impl !Send for NamedNodeMap
impl !Sync for NamedNodeMap
impl Unpin for NamedNodeMap
impl !UnwindSafe for NamedNodeMap
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<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