#include <XSECXPathNodeList.hpp>
This class is used primarily for holding lists of nodes found during XPath processing. It is also used for xpath-filter which requires multiple list comparisons.
It is not implemented using one of the container classes as it has the potential to become a real bottleneck. It could potentially be implemented as a hash list based on names of nodes (or even pointers).
Public Member Functions | |
Constructors, Destructors and operators | |
XSECXPathNodeList (unsigned int initialSize=_XSEC_NODELIST_DEFAULT_SIZE) | |
XSECXPathNodeList (const XSECXPathNodeList &other) | |
Copy Constructor. | |
~XSECXPathNodeList () | |
XSECXPathNodeList & | operator= (const XSECXPathNodeList &toCopy) |
Assignment Operator. | |
Adding and Deleting nodes | |
void | addNode (const XERCES_CPP_NAMESPACE_QUALIFIER DOMNode *n) |
Add a node to the list. | |
void | removeNode (const XERCES_CPP_NAMESPACE_QUALIFIER DOMNode *n) |
Remove a node from the list. | |
void | clear (void) |
Clear out the entire list, deleting all entries. | |
Reading List Functions | |
bool | hasNode (const XERCES_CPP_NAMESPACE_QUALIFIER DOMNode *n) |
Check if a node exists in the list. | |
const XERCES_CPP_NAMESPACE_QUALIFIER DOMNode * | getFirstNode (void) |
Get the first node in the list. | |
const XERCES_CPP_NAMESPACE_QUALIFIER DOMNode * | getNextNode (void) |
Get the next node in the list. | |
Manipulating Nodesets | |
void | intersect (const XSECXPathNodeList &toIntersect) |
Intersect with nodeset. |
|
|
|
Copy Constructor.
|
|
|
|
Add a node to the list. Checks to see whether the node is already in the list, and if not adds it.
|
|
Clear out the entire list, deleting all entries.
|
|
Get the first node in the list. Returns the first node in the list of nodes and resets the search list.
|
|
Get the next node in the list. Returns the next node in the list.
|
|
Check if a node exists in the list.
|
|
Intersect with nodeset. Delete any nodes in my list that are not in the intersect list
|
|
Assignment Operator. Set one node list equal to another.
|
|
Remove a node from the list. Given a node, find it in the list and (if it exists) delete it from the list.
|