Struct BoundaryPoint 

pub(crate) struct BoundaryPoint {
    node: MutDom<Node>,
    offset: Cell<u32>,
}

https://dom.spec.whatwg.org/#concept-range-bp

Fields

node: MutDom<Node>

https://dom.spec.whatwg.org/#boundary-point-node

offset: Cell<u32>

https://dom.spec.whatwg.org/#concept-range-bp-offset

Implementations

impl BoundaryPoint

pub(crate) fn new(node: &Node, offset: u32) -> BoundaryPoint

pub(crate) fn set(&self, node: &Node, offset: u32)

pub(crate) fn offset(&self) -> Utf16CodeUnits

pub(crate) fn set_offset(&self, offset: u32)

pub(crate) fn node(&self) -> &MutDom<Node>

pub(crate) fn partial_cmp(&self, no_gc: &NoGC, other: &Self) -> Option<Ordering>

Trait Implementations

impl MallocSizeOf for BoundaryPoint

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.

impl PartialEq<BoundaryPoint> for SelectionBoundary

fn eq(&self, boundary_point: &BoundaryPoint) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq for BoundaryPoint

https://dom.spec.whatwg.org/#range-collapsed

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Traceable for BoundaryPoint

unsafe fn trace(&self, tracer: *mut JSTracer)

Trace self.