Enum RankedNode 

pub enum RankedNode {
    Array {
        node_id: NodeId,
        key_in_object: Option<String>,
    },
    Object {
        node_id: NodeId,
        key_in_object: Option<String>,
    },
    SplittableLeaf {
        node_id: NodeId,
        key_in_object: Option<String>,
        value: String,
    },
    LeafPart {
        node_id: NodeId,
        key_in_object: Option<String>,
    },
    AtomicLeaf {
        node_id: NodeId,
        key_in_object: Option<String>,
        token: String,
    },
}

Variants

Array

Fields

node_id: NodeId

key_in_object: Option<String>

Object

Fields

node_id: NodeId

key_in_object: Option<String>

SplittableLeaf

Fields

node_id: NodeId

key_in_object: Option<String>

value: String

LeafPart

Fields

node_id: NodeId

key_in_object: Option<String>

AtomicLeaf

Fields

node_id: NodeId

key_in_object: Option<String>

token: String

Implementations

impl RankedNode

pub fn node_id(&self) -> NodeId

pub fn key_in_object(&self) -> Option<&str>

pub fn display_kind(&self) -> NodeKind

Trait Implementations

impl Clone for RankedNode

fn clone(&self) -> RankedNode

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for RankedNode

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Hash for RankedNode

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for RankedNode

fn eq(&self, other: &RankedNode) -> 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 Eq for RankedNode

impl StructuralPartialEq for RankedNode