tmiller 01/08/15 12:23:22 Added: java/src/org/apache/xalan/xsltc/dom DupFilterIterator.java Log: bug fix 2553, new iterator to get rid of dups Revision Changes Path 1.1 xml-xalan/java/src/org/apache/xalan/xsltc/dom/DupFilterIterator.java Index: DupFilterIterator.java =================================================================== /* * @(#)$Id: DupFilterIterator.java,v 1.1 2001/08/15 19:23:22 tmiller Exp $ * * The Apache Software License, Version 1.1 * * * Copyright (c) 2001 The Apache Software Foundation. All rights * reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in * the documentation and/or other materials provided with the * distribution. * * 3. The end-user documentation included with the redistribution, * if any, must include the following acknowledgment: * "This product includes software developed by the * Apache Software Foundation (http://www.apache.org/)." * Alternately, this acknowledgment may appear in the software itself, * if and wherever such third-party acknowledgments normally appear. * * 4. The names "Xalan" and "Apache Software Foundation" must * not be used to endorse or promote products derived from this * software without prior written permission. For written * permission, please contact [EMAIL PROTECTED] * * 5. Products derived from this software may not be called "Apache", * nor may "Apache" appear in their name, without prior written * permission of the Apache Software Foundation. * * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * ==================================================================== * * This software consists of voluntary contributions made by many * individuals on behalf of the Apache Software Foundation and was * originally based on software copyright (c) 2001, Sun * Microsystems., http://www.sun.com. For more * information on the Apache Software Foundation, please see * <http://www.apache.org/>. * * @author G. Todd Miller * */ package org.apache.xalan.xsltc.dom; import org.apache.xalan.xsltc.NodeIterator; import org.apache.xalan.xsltc.TransletException; public final class DupFilterIterator extends NodeIteratorBase { private final static int INIT_DATA_SIZE = 16; private final NodeIterator _source; private int[] _data = null; private int _last = 0; private int _current = 0; private int _start = -1; public DupFilterIterator(NodeIterator source) { _source = source; } public int next() { return _current < _last ? _data[_current++] : END; } public NodeIterator setStartNode(int node) { if ((_data == null) || (node != _start)) { _start = node; _source.setStartNode(node); _data = new int[INIT_DATA_SIZE]; _last = 0; // gather all nodes from the source iterator, eliminate dups while ((node = _source.next()) != END) { if (_last == _data.length) { int[] newArray = new int[_data.length * 2]; System.arraycopy(_data, 0, newArray, 0, _last); _data = newArray; } if (!isDup(node)) { _data[_last++] = node; } } } _current = 0; // set to beginning return this; } private boolean isDup(int node) { boolean retval = false; int size = _data.length; for ( int i=0; i<size; i++ ){ if (_data[i] == node) { retval = true; break; } } return retval; } public int getPosition() { return (_last - _current); } public int getLast() { return _last; } public void setMark() { _source.setMark(); _markedNode = _current; } public void gotoMark() { _source.gotoMark(); _current = _markedNode; } } --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
