anynodecounter.java

来自「JAVA的一些源码 JAVA2 STANDARD EDITION DEVELO」· Java 代码 · 共 111 行

JAVA
111
字号
/* * Copyright 2001-2004 The Apache Software Foundation. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * *     http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *//* * $Id: AnyNodeCounter.java,v 1.4 2004/02/16 22:54:59 minchau Exp $ */package com.sun.org.apache.xalan.internal.xsltc.dom;import com.sun.org.apache.xalan.internal.xsltc.DOM;import com.sun.org.apache.xalan.internal.xsltc.Translet;import com.sun.org.apache.xml.internal.dtm.DTMAxisIterator;/** * @author Jacek Ambroziak * @author Santiago Pericas-Geertsen */public abstract class AnyNodeCounter extends NodeCounter {    public AnyNodeCounter(Translet translet,			  DOM document, DTMAxisIterator iterator) {	super(translet, document, iterator);    }	    public NodeCounter setStartNode(int node) {	_node = node;	_nodeType = _document.getExpandedTypeID(node);	return this;    }    public String getCounter() {	int result;	if (_value != Integer.MIN_VALUE) {	    result = _value;	}	else {	    int next = _node;             final int root = _document.getDocument();	    result = 0;	    while (next >= root && !matchesFrom(next)) {		if (matchesCount(next)) {		    ++result;			}		next--;//%HZ%:  Is this the best way of finding the root?  Is it better to check//%HZ%:  parent(next)?		/*		if (next == root) {		    break;                }		else {		    --next;		                }                */	    }	}	return formatNumbers(result);    }    public static NodeCounter getDefaultNodeCounter(Translet translet,						    DOM document,						    DTMAxisIterator iterator) {	return new DefaultAnyNodeCounter(translet, document, iterator);    }    static class DefaultAnyNodeCounter extends AnyNodeCounter {	public DefaultAnyNodeCounter(Translet translet,				     DOM document, DTMAxisIterator iterator) {	    super(translet, document, iterator);	}	public String getCounter() {	    int result;	    if (_value != Integer.MIN_VALUE) {		result = _value;	    }	    else {		int next = _node;		result = 0;		final int ntype = _document.getExpandedTypeID(_node);                final int root = _document.getDocument();		while (next >= 0) {		    if (ntype == _document.getExpandedTypeID(next)) {			result++;		    }//%HZ%:  Is this the best way of finding the root?  Is it better to check//%HZ%:  parent(next)?		    if (next == root) {		        break;                    }		    else {		        --next;                    }		}	    }	    return formatNumbers(result);	}    }}

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?