Struct script::dom::node::Node[−][src]

#[repr(C)]pub struct Node {
    eventtarget: EventTarget,
    parent_node: MutNullableDom<Node>,
    first_child: MutNullableDom<Node>,
    last_child: MutNullableDom<Node>,
    next_sibling: MutNullableDom<Node>,
    prev_sibling: MutNullableDom<Node>,
    owner_doc: MutNullableDom<Document>,
    rare_data: DomRefCell<Option<Box<NodeRareData>>>,
    child_list: MutNullableDom<NodeList>,
    children_count: Cell<u32>,
    flags: Cell<NodeFlags>,
    inclusive_descendants_version: Cell<u64>,
    ranges: WeakRangeVec,
    style_and_layout_data: DomRefCell<Option<Box<StyleAndOpaqueLayoutData>>>,
}

An HTML node.

Fields

eventtarget: EventTarget

The JavaScript reflector for this node.

parent_node: MutNullableDom<Node>

The parent of this node.

first_child: MutNullableDom<Node>

The first child of this node.

last_child: MutNullableDom<Node>

The last child of this node.

next_sibling: MutNullableDom<Node>

The next sibling of this node.

prev_sibling: MutNullableDom<Node>

The previous sibling of this node.

owner_doc: MutNullableDom<Document>

The document that this node belongs to.

rare_data: DomRefCell<Option<Box<NodeRareData>>>

Rare node data.

child_list: MutNullableDom<NodeList>

The live list of children return by .childNodes.

children_count: Cell<u32>

The live count of children of this node.

flags: Cell<NodeFlags>

A bitfield of flags for node items.

inclusive_descendants_version: Cell<u64>

The maximum version of any inclusive descendant of this node.

ranges: WeakRangeVec

A vector of weak references to Range instances of which the start or end containers are this node. No range should ever be found twice in this vector, even if both the start and end containers are this node.

style_and_layout_data: DomRefCell<Option<Box<StyleAndOpaqueLayoutData>>>

Style+Layout information.

Implementations

`impl Node`[src]

`fn add_child(&self, new_child: &Node, before: Option<&Node>)`[src]

Adds a new child to the end of this node’s list of children.

Fails unless new_child is disconnected from the tree.

`pub fn clean_up_layout_data(&self)`[src]

`pub fn complete_remove_subtree(root: &Node, context: &UnbindContext<'_>)`[src]

Clean up flags and unbind from tree.

`fn remove_child(&self, child: &Node, cached_index: Option<u32>)`[src]

Removes the given child from this node’s list of children.

Fails unless child is a child of this node.

`pub fn to_untrusted_node_address(&self) -> UntrustedNodeAddress`[src]

`pub fn to_opaque(&self) -> OpaqueNode`[src]

`pub fn as_custom_element(&self) -> Option<Root<Dom<Element>>>`[src]

`pub fn fire_synthetic_mouse_event_not_trusted(&self, name: DOMString)`[src]

`pub fn parent_directionality(&self) -> String`[src]

`impl Node`[src]

`fn rare_data(&self) -> Ref<'_, Option<Box<NodeRareData>>>`[src]

`fn rare_data_mut(&self) -> RefMut<'_, Option<Box<NodeRareData>>>`[src]

`fn ensure_rare_data(&self) -> RefMut<'_, Box<NodeRareData>>`[src]

`pub fn is_before(&self, other: &Node) -> bool`[src]

Returns true if this node is before other in the same connected DOM tree.

`pub fn registered_mutation_observers_mut( &self ) -> RefMut<'_, Vec<RegisteredObserver>>`[src]

Return all registered mutation observers for this node. Lazily initialize the raredata if it does not exist.

`pub fn registered_mutation_observers( &self ) -> Option<Ref<'_, Vec<RegisteredObserver>>>`[src]

`pub fn add_mutation_observer(&self, observer: RegisteredObserver)`[src]

Add a new mutation observer for a given node.

`pub fn remove_mutation_observer(&self, observer: &MutationObserver)`[src]

Removes the mutation observer for a given node.

`pub fn dump(&self)`[src]

Dumps the subtree rooted at this node, for debugging.

`pub fn dump_indent(&self, indent: u32)`[src]

Dumps the node tree, for debugging, with indentation.

`pub fn debug_str(&self) -> String`[src]

Returns a string that describes this node.

`pub fn is_in_doc(&self) -> bool`[src]

`pub fn is_in_shadow_tree(&self) -> bool`[src]

`pub fn has_weird_parser_insertion_mode(&self) -> bool`[src]

`pub fn set_weird_parser_insertion_mode(&self)`[src]

`pub fn is_connected(&self) -> bool`[src]

`pub fn type_id(&self) -> NodeTypeId`[src]

Returns the type ID of this node.

`pub fn len(&self) -> u32`[src]

`pub fn index(&self) -> u32`[src]

`pub fn has_parent(&self) -> bool`[src]

Returns true if this node has a parent.

`pub fn children_count(&self) -> u32`[src]

`pub fn ranges(&self) -> &WeakRangeVec`[src]

`pub fn is_doctype(&self) -> bool`[src]

`pub fn get_flag(&self, flag: NodeFlags) -> bool`[src]

`pub fn set_flag(&self, flag: NodeFlags, value: bool)`[src]

`pub fn note_dirty_descendants(&self)`[src]

`pub fn has_dirty_descendants(&self) -> bool`[src]

`pub fn rev_version(&self)`[src]

`pub fn dirty(&self, damage: NodeDamage)`[src]

`pub fn inclusive_descendants_version(&self) -> u64`[src]

The maximum version number of this node’s descendants, including itself

`pub fn traverse_preorder( &self, shadow_including: ShadowIncluding ) -> TreeIteratorⓘNotable traits for TreeIterator impl Iterator for TreeIterator type Item = Root<Dom<Node>>;`[src]

Iterates over this node and all its descendants, in preorder.

`pub fn inclusively_following_siblings( &self ) -> impl Iterator<Item = Root<Dom<Node>>>`[src]

`pub fn inclusively_preceding_siblings( &self ) -> impl Iterator<Item = Root<Dom<Node>>>`[src]

`pub fn common_ancestor( &self, other: &Node, shadow_including: ShadowIncluding ) -> Option<Root<Dom<Node>>>`[src]

`pub fn is_inclusive_ancestor_of(&self, parent: &Node) -> bool`[src]

`pub fn is_ancestor_of(&self, parent: &Node) -> bool`[src]

`fn is_shadow_including_inclusive_ancestor_of(&self, node: &Node) -> bool`[src]

`pub fn following_siblings(&self) -> impl Iterator<Item = Root<Dom<Node>>>`[src]

`pub fn preceding_siblings(&self) -> impl Iterator<Item = Root<Dom<Node>>>`[src]

`pub fn following_nodes(&self, root: &Node) -> FollowingNodeIteratorⓘNotable traits for FollowingNodeIterator impl Iterator for FollowingNodeIterator type Item = Root<Dom<Node>>;`[src]

`pub fn preceding_nodes(&self, root: &Node) -> PrecedingNodeIteratorⓘNotable traits for PrecedingNodeIterator impl Iterator for PrecedingNodeIterator type Item = Root<Dom<Node>>;`[src]

`pub fn descending_last_children(&self) -> impl Iterator<Item = Root<Dom<Node>>>`[src]

`pub fn is_parent_of(&self, child: &Node) -> bool`[src]

`pub fn to_trusted_node_address(&self) -> TrustedNodeAddress`[src]

`pub fn bounding_content_box(&self) -> Option<Rect<Au>>`[src]

Returns the rendered bounding content box if the element is rendered, and none otherwise.

`pub fn bounding_content_box_or_zero(&self) -> Rect<Au>`[src]

`pub fn content_boxes(&self) -> Vec<Rect<Au>>ⓘNotable traits for Vec<u8, A> impl<A> Write for Vec<u8, A> where A: Allocator,` [src]

`pub fn client_rect(&self) -> Rect<i32>`[src]

`pub fn scroll_area(&self) -> Rect<i32>`[src]

`pub fn scroll_offset(&self) -> Vector2D<f32>`[src]

`pub fn before(&self, nodes: Vec<NodeOrString>) -> Result<(), Error>`[src]

`pub fn after(&self, nodes: Vec<NodeOrString>) -> Result<(), Error>`[src]

`pub fn replace_with(&self, nodes: Vec<NodeOrString>) -> Result<(), Error>`[src]

`pub fn prepend(&self, nodes: Vec<NodeOrString>) -> Result<(), Error>`[src]

`pub fn append(&self, nodes: Vec<NodeOrString>) -> Result<(), Error>`[src]

`pub fn replace_children(&self, nodes: Vec<NodeOrString>) -> Result<(), Error>`[src]

`pub fn query_selector( &self, selectors: DOMString ) -> Result<Option<Root<Dom<Element>>>, Error>`[src]

`pub fn query_selector_iter( &self, selectors: DOMString ) -> Result<QuerySelectorIterator, Error>`[src]

https://dom.spec.whatwg.org/#scope-match-a-selectors-string Get an iterator over all nodes which match a set of selectors Be careful not to do anything which may manipulate the DOM tree whilst iterating, otherwise the iterator may be invalidated.