001: /*
002: * Copyright (c) 1998-2006 Caucho Technology -- all rights reserved
003: *
004: * This file is part of Resin(R) Open Source
005: *
006: * Each copy or derived work must preserve the copyright notice and this
007: * notice unmodified.
008: *
009: * Resin Open Source is free software; you can redistribute it and/or modify
010: * it under the terms of the GNU General Public License as published by
011: * the Free Software Foundation; either version 2 of the License, or
012: * (at your option) any later version.
013: *
014: * Resin Open Source is distributed in the hope that it will be useful,
015: * but WITHOUT ANY WARRANTY; without even the implied warranty of
016: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE, or any warranty
017: * of NON-INFRINGEMENT. See the GNU General Public License for more
018: * details.
019: *
020: * You should have received a copy of the GNU General Public License
021: * along with Resin Open Source; if not, write to the
022: *
023: * Free Software Foundation, Inc.
024: * 59 Temple Place, Suite 330
025: * Boston, MA 02111-1307 USA
026: *
027: * @author Scott Ferguson
028: */
029:
030: package com.caucho.jcr.base;
031:
032: import javax.jcr.Node;
033: import javax.jcr.NodeIterator;
034:
035: /**
036: * Iterates over an array array of base nodes.
037: */
038: public class BaseNodeIterator implements NodeIterator {
039: private BaseNode[] _nodes;
040: private int _index;
041:
042: public BaseNodeIterator(BaseNode[] nodes) {
043: _nodes = nodes;
044: }
045:
046: /**
047: * Returns the next node.
048: */
049: public Node nextNode() {
050: if (_index < _nodes.length)
051: return _nodes[_index++];
052: else
053: return null;
054: }
055:
056: //
057: // javax.jcr.RangeIterator
058: //
059:
060: /**
061: * Skips the next 'n' nodes.
062: */
063: public void skip(long skipNum) {
064: _index += skipNum;
065: }
066:
067: /**
068: * Returns the total number of nodes.
069: */
070: public long getSize() {
071: return _nodes.length;
072: }
073:
074: /**
075: * Returns the current position.
076: */
077: public long getPosition() {
078: return _index;
079: }
080:
081: //
082: // java.util.iterator
083: //
084:
085: /**
086: * Returns the next node.
087: */
088: public Object next() {
089: return nextNode();
090: }
091:
092: /**
093: * Returns true if there are more nodes.
094: */
095: public boolean hasNext() {
096: return _index < _nodes.length;
097: }
098:
099: /**
100: * Removes the current item.
101: */
102: public void remove() {
103: throw new UnsupportedOperationException(getClass().getName());
104: }
105: }
|