MultipleNodeCounter.java revision 286
0N/A/*
2362N/A * reserved comment block
0N/A * DO NOT REMOVE OR ALTER!
0N/A */
0N/A/*
0N/A * Copyright 2001-2004 The Apache Software Foundation.
2362N/A *
0N/A * Licensed under the Apache License, Version 2.0 (the "License");
2362N/A * you may not use this file except in compliance with the License.
0N/A * You may obtain a copy of the License at
0N/A *
0N/A * http://www.apache.org/licenses/LICENSE-2.0
0N/A *
0N/A * Unless required by applicable law or agreed to in writing, software
0N/A * distributed under the License is distributed on an "AS IS" BASIS,
0N/A * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
0N/A * See the License for the specific language governing permissions and
0N/A * limitations under the License.
0N/A */
0N/A/*
2362N/A * $Id: MultipleNodeCounter.java,v 1.2.4.1 2005/09/12 11:49:56 pvedula Exp $
2362N/A */
2362N/A
0N/Apackage com.sun.org.apache.xalan.internal.xsltc.dom;
0N/A
0N/Aimport com.sun.org.apache.xalan.internal.xsltc.DOM;
0N/Aimport com.sun.org.apache.xalan.internal.xsltc.Translet;
0N/Aimport com.sun.org.apache.xalan.internal.xsltc.util.IntegerArray;
0N/Aimport com.sun.org.apache.xml.internal.dtm.DTMAxisIterator;
0N/Aimport com.sun.org.apache.xml.internal.dtm.Axis;
0N/A
0N/A/**
0N/A * @author Jacek Ambroziak
0N/A * @author Santiago Pericas-Geertsen
0N/A */
0N/Apublic abstract class MultipleNodeCounter extends NodeCounter {
0N/A private DTMAxisIterator _precSiblings = null;
0N/A
0N/A public MultipleNodeCounter(Translet translet,
0N/A DOM document, DTMAxisIterator iterator) {
0N/A super(translet, document, iterator);
0N/A }
0N/A
0N/A public MultipleNodeCounter(Translet translet,
0N/A DOM document,
0N/A DTMAxisIterator iterator,
0N/A boolean hasFrom) {
0N/A super(translet, document, iterator, hasFrom);
}
public NodeCounter setStartNode(int node) {
_node = node;
_nodeType = _document.getExpandedTypeID(node);
_precSiblings = _document.getAxisIterator(Axis.PRECEDINGSIBLING);
return this;
}
public String getCounter() {
if (_value != Integer.MIN_VALUE) {
//See Errata E24
if (_value == 0) return "0";
else if (Double.isNaN(_value)) return "NaN";
else if (_value < 0 && Double.isInfinite(_value)) return "-Infinity";
else if (Double.isInfinite(_value)) return "Infinity";
else return formatNumbers((int)_value);
}
IntegerArray ancestors = new IntegerArray();
// Gather all ancestors that do not match from pattern
int next = _node;
ancestors.add(next); // include self
while ((next = _document.getParent(next)) > END &&
!matchesFrom(next)) {
ancestors.add(next);
}
// Create an array of counters
final int nAncestors = ancestors.cardinality();
final int[] counters = new int[nAncestors];
for (int i = 0; i < nAncestors; i++) {
counters[i] = Integer.MIN_VALUE;
}
// Increment array of counters according to semantics
for (int j = 0, i = nAncestors - 1; i >= 0 ; i--, j++) {
final int counter = counters[j];
final int ancestor = ancestors.at(i);
if (matchesCount(ancestor)) {
_precSiblings.setStartNode(ancestor);
while ((next = _precSiblings.next()) != END) {
if (matchesCount(next)) {
counters[j] = (counters[j] == Integer.MIN_VALUE) ? 1
: counters[j] + 1;
}
}
// Count the node itself
counters[j] = counters[j] == Integer.MIN_VALUE
? 1
: counters[j] + 1;
}
}
return formatNumbers(counters);
}
public static NodeCounter getDefaultNodeCounter(Translet translet,
DOM document,
DTMAxisIterator iterator) {
return new DefaultMultipleNodeCounter(translet, document, iterator);
}
static class DefaultMultipleNodeCounter extends MultipleNodeCounter {
public DefaultMultipleNodeCounter(Translet translet,
DOM document,
DTMAxisIterator iterator) {
super(translet, document, iterator);
}
}
}