// kelondroRotateIterator.java // (C) 2007 by Michael Peter Christen; mc@anomic.de, Frankfurt a. M., Germany // first published 08.03.2007 on http://www.anomic.de // // This is a part of YaCy, a peer-to-peer based web search engine // // $LastChangedDate: 2006-04-02 22:40:07 +0200 (So, 02 Apr 2006) $ // $LastChangedRevision: 1986 $ // $LastChangedBy: orbiter $ // // LICENSE // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU General Public License as published by // the Free Software Foundation; either version 2 of the License, or // (at your option) any later version. // // This program is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // // You should have received a copy of the GNU General Public License // along with this program; if not, write to the Free Software // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA package de.anomic.kelondro; public class kelondroRotateIterator implements kelondroCloneableIterator { kelondroCloneableIterator a, clone; Object modifier; public kelondroRotateIterator(kelondroCloneableIterator a, Object modifier) { // this works currently only for String-type key iterations this.a = a; this.modifier = modifier; this.clone = (kelondroCloneableIterator) a.clone(modifier); } public kelondroRotateIterator clone(Object modifier) { return new kelondroRotateIterator(a, modifier); } public boolean hasNext() { return true; } public E next() { // attention: this iterator has no termination - on purpose. // it must be taken care that a calling method has a termination predicate different // from the hasNext() method if (!(a.hasNext())) { a = (kelondroCloneableIterator) clone.clone(modifier); } return a.next(); } public void remove() { a.remove(); } }