<meta name="usage" content="internal"> A class that does incremental counting for support of xsl:number. More...
<meta name="usage" content="internal"> A class that does incremental counting for support of xsl:number.
This class stores a cache of counted nodes (m_countNodes). It tries to cache the counted nodes in document order... the node count is based on its position in the cache list
| typedef unsigned long Counter::CountType |
| typedef XalanVector<XalanNode*> Counter::NodeVectorType |
| Counter::Counter | ( | MemoryManagerType & | theManager, |
| const ElemNumber * | numberElem, | ||
| NodeVectorType & | countNodes | ||
| ) |
Construct a counter object.
| Counter::Counter | ( | MemoryManagerType & | theManager, |
| const ElemNumber * | numberElem = 0 |
||
| ) |
Construct a counter object.
| Counter::Counter | ( | const Counter & | other, |
| MemoryManagerType & | theManager | ||
| ) |
| XalanNode* Counter::getLast | ( | ) | const |
Get the last node in the list.
| CountType Counter::getPreviouslyCounted | ( | StylesheetExecutionContext & | support, |
| const XalanNode * | node | ||
| ) | const |
Try to find a node that was previously counted.
If found, return a positive integer that corresponds to the count.
| node | The node to be counted. |
A vector of all nodes counted so far.
The start count from where m_countNodes counts from.
In other words, the count of a given node in the m_countNodes vector is node position + m_countNodesStartCount.
| const XalanNode* Counter::m_fromNode |
The node from where the counting starts.
This is needed to find a counter if the node being counted is not immediatly found in the m_countNodes vector.
| const ElemNumber* Counter::m_numberElem |
The owning xsl:number element.
Doxygen and GraphViz are used to generate this API documentation from the Xalan-C header files.
|
Xalan-C++ XSLT Processor Version 1.10 |
|
|