The Text interface inherits from CharacterData and represents the textual content (termed character data in XML) of an Element or Attr. If there is no markup inside an element's content, the text is contained in a single object implementing the Text interface that is the only child of the element. If there is markup, it is parsed into the information items (elements, comments, etc.) and Text nodes that form the list of children of the element. When a document is first made available via the DOM, there is only one Text node for each block of text. Users may create adjacent Text nodes that represent the contents of a given element without any intervening markup, but should be aware that there is no way to represent the separations between these nodes in XML or HTML, so they will not (in general) persist between DOM editing sessions. The normalize() method on Node merges any such adjacent Text objects into a single node for each block of text. |
Inherits from |
CharacterData |
Default Constructor |
Text(GdomeText* = 0) |
Creates a smart pointer for the Gdome element whose pointer is passed as an argument. The user should never pass a non-null pointer to this constructor. |
Copy and Cast Constructors |
Text(const
Text&)
Text(const CharacterData&) Text(const Node&) |
These constructors can be used to copy a smart pointer or to downcast it. If the downcasting is not possible, the resulting smart pointer will be null. |
Copy Operator |
Text& operator=(const Text&) |
Equality |
bool operator==(const
Text&) const
bool operator!=(const Text&) const |
Two smart pointers are equal if they point to the same Gdome object. |
Methods |
Text splitText(const unsigned longoffset) |
Parameters:
Breaks this node into two nodes at the specified offset, keeping both in the tree as siblings. After being split, this node will contain all the content up to the offset point. A new node of the same type, which contains all the content at and after the offset point, is returned. If the original node had a parent node, the new node is inserted as the next sibling of the original node. When the offset is equal to the length of this node, the new node has no data. Exceptions:
|