com.codecommit.antixml.Node

Root of the Node ADT, representing the different types of supported XML nodes which may appear in an XML fragment. The ADT itself has the following shape (Haskell syntax):

type Prefix = Maybe String
type Scope = Map String String

data Node = ProcInstr String String
          | Elem Prefix String Attributes Scope (Group Node)
          | Text String
          | CDATA String
          | EntityRef String

For those that don't find Haskell to be the clearest explanation of what's going on in this type, here is a more natural-language version. The Node trait is sealed and has exactly four subclasses, each implementing a different type of XML node. These four classes are as follows:

ProcInstr – A processing instruction consisting of a target and some data
Elem – An XML element consisting of an optional prefix, a name (or identifier), a set of attributes, a set of namespace mappings in scope and a sequence of child nodes
Text – A node containing a single string, representing character data in the XML tree
CDATA – A node containing a single string, representing unescaped character data in the XML tree
EntityRef – An entity reference (e.g. &)

Attributes: sealed
Source: node.scala

Linear Supertypes

AnyRef, Any

Known Subclasses

CDATA, Elem, EntityRef, ProcInstr, Text

Ordering

Alphabetic
By inheritance

Inherited

Hide All
Show all

Node
AnyRef
Any

Visibility

Public
All

Value Members

def != (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def != (arg0: Any): Boolean

Attributes
final
Definition Classes
Any
def ## (): Int

Attributes
final
Definition Classes
AnyRef → Any
def == (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def == (arg0: Any): Boolean

Attributes
final
Definition Classes
Any
def asInstanceOf [T0] : T0

Attributes
final
Definition Classes
Any
def children : Group[Node]

Returns the children of this node.
Returns the children of this node. If the node is an Elem, then this method returns the element's children. Otherwise, it returns return an empty Group.
def clone (): AnyRef

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def eq (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def equals (arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize (): Unit

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def getClass (): java.lang.Class[_]

Attributes
final
Definition Classes
AnyRef → Any
def hashCode (): Int

Definition Classes
AnyRef → Any
def isInstanceOf [T0] : Boolean

Attributes
final
Definition Classes
Any
def ne (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def notify (): Unit

Attributes
final
Definition Classes
AnyRef
def notifyAll (): Unit

Attributes
final
Definition Classes
AnyRef
def synchronized [T0] (arg0: ⇒ T0): T0

Attributes
final
Definition Classes
AnyRef
def toString (): String

Definition Classes
AnyRef → Any
def wait (): Unit

Attributes
final
Definition Classes
AnyRef
Annotations
@throws()
def wait (arg0: Long, arg1: Int): Unit

Attributes
final
Definition Classes
AnyRef
Annotations
@throws()
def wait (arg0: Long): Unit

Attributes
final
Definition Classes
AnyRef
Annotations
@throws()

Node

trait Node extends AnyRef

Value Members

def != (arg0: AnyRef): Boolean

def != (arg0: Any): Boolean

def ## (): Int

def == (arg0: AnyRef): Boolean

def == (arg0: Any): Boolean

def asInstanceOf [T0] : T0

def children : Group[Node]

def clone (): AnyRef

def eq (arg0: AnyRef): Boolean

def equals (arg0: Any): Boolean

def finalize (): Unit

def getClass (): java.lang.Class[_]

def hashCode (): Int

def isInstanceOf [T0] : Boolean

def ne (arg0: AnyRef): Boolean

def notify (): Unit

def notifyAll (): Unit

def synchronized [T0] (arg0: ⇒ T0): T0

def toString (): String

def wait (): Unit

def wait (arg0: Long, arg1: Int): Unit

def wait (arg0: Long): Unit

Inherited from AnyRef

Inherited from Any