Enum TidyNodeType 

#[repr(u32)]
pub enum TidyNodeType {
    Root = 0,
    DocType = 1,
    Comment = 2,
    ProcIns = 3,
    Text = 4,
    Start = 5,
    End = 6,
    StartEnd = 7,
    CDATA = 8,
    Section = 9,
    Asp = 10,
    Jste = 11,
    Php = 12,
    XmlDecl = 13,
}

Node types

Variants

Root = 0

< Root

DocType = 1

< DOCTYPE

Comment = 2

< Comment

ProcIns = 3

< Processing Instruction

Text = 4

< Text

Start = 5

< Start Tag

End = 6

< End Tag

StartEnd = 7

< Start/End (empty) Tag

CDATA = 8

< Unparsed Text

Section = 9

< XML Section

Asp = 10

< ASP Source

Jste = 11

< JSTE Source

Php = 12

< PHP Source

XmlDecl = 13

< XML Declaration

Trait Implementations

impl Clone for TidyNodeType

fn clone(&self) -> TidyNodeType

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for TidyNodeType

impl Debug for TidyNodeType

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

Formats the value using the given formatter.

impl Eq for TidyNodeType

impl Hash for TidyNodeType

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 TidyNodeType

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