Constructor and Description |
---|
XmlSplittable(<any> nodes)
Create an XML splittable for the given list of nodes.
|
XmlSplittable(Document doc)
Create an XML splittable rooted at the document element of the given
document.
|
XmlSplittable(Node node)
Create an XML splittable from the given node.
|
Modifier and Type | Method and Description |
---|---|
boolean |
asBoolean() |
double |
asNumber() |
void |
assign(Splittable parent,
int index) |
void |
assign(Splittable parent,
String propertyName) |
String |
asString() |
Splittable |
deepCopy() |
Splittable |
get(int index) |
Splittable |
get(String key) |
String |
getPayload() |
List<String> |
getPropertyKeys() |
Object |
getReified(String key) |
boolean |
isBoolean() |
boolean |
isIndexed() |
boolean |
isKeyed() |
boolean |
isNull(int index) |
boolean |
isNull(String key) |
boolean |
isNumber() |
boolean |
isReified(String key) |
boolean |
isString() |
boolean |
isUndefined(String key) |
void |
removeReified(String key) |
void |
setReified(String key,
Object object) |
void |
setSize(int i) |
int |
size() |
String |
toString() |
public XmlSplittable(Document doc)
doc
- the document representing the root of this XML splittablepublic XmlSplittable(Node node)
node
- the node representing the root of this XML splittablepublic XmlSplittable(<any> nodes)
nodes
- the nodes representing this XML splittablepublic boolean asBoolean()
public double asNumber()
public void assign(Splittable parent, int index)
public void assign(Splittable parent, String propertyName)
public String asString()
public Splittable deepCopy()
public Splittable get(int index)
public Splittable get(String key)
public String getPayload()
public boolean isBoolean()
public boolean isIndexed()
public boolean isKeyed()
public boolean isNull(int index)
public boolean isNull(String key)
public boolean isNumber()
public boolean isReified(String key)
public boolean isString()
public boolean isUndefined(String key)
public void removeReified(String key)
public void setSize(int i)
public int size()
Copyright © 2018. All rights reserved.