X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/24dbcb1a8071fe684d776063f04b314d92094e8d..23da67335f942457b0d8b1f10e9849eba0eee9f7:/contrib/psg/src/peersim/util/LinearIterator.java

diff --git a/contrib/psg/src/peersim/util/LinearIterator.java b/contrib/psg/src/peersim/util/LinearIterator.java
deleted file mode 100644
index 2a1ee36dee..0000000000
--- a/contrib/psg/src/peersim/util/LinearIterator.java
+++ /dev/null
@@ -1,108 +0,0 @@
-/*
- * Copyright (c) 2003-2005 The BISON Project
- *
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License version 2 as
- * published by the Free Software Foundation.
- *
- * 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 Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
- *
- */
-		
-package peersim.util;
-
-import java.util.NoSuchElementException;
-
-/**
-* This class gives the linear order 0,1,etc or alternatively k-1, k-2, etc.,
-* depending on the constructor.
-*/
-public class LinearIterator implements IndexIterator {
-
-
-// ======================= private fields ============================
-// ===================================================================
-
-private final boolean reverse;
-
-private int len = 0;
-
-private int pointer = 0;
-
-
-// ======================= initialization ============================
-// ===================================================================
-
-
-/**
-* Construct an iterator for an empty set of numbers.
-* You have to call {@link #reset} to actually fully initialize the object.
-* The numbers returned by consecutive calls to {@link #next} are 0,1,...
-*/
-public LinearIterator() { reverse=false; }
-
-// -------------------------------------------------------------------
-
-/**
-* Construct an interator for an empty set of numbers.
-* You have to call {@link #reset} to actually fully initialize the object.
-* If parameter is true then the numbers returned by consecutive calls to
-* {@link #next} are k-1,k-2,..., otherwise 0,1,...
-*/
-public LinearIterator( boolean rev ) { reverse=rev; }
-
-
-// ======================= public methods ============================
-// ===================================================================
-
-
-public void reset(int k) {
-	
-	len = k;
-	pointer = (reverse ? len-1 : 0);
-}
-
-// -------------------------------------------------------------------
-
-/**
-* Returns next index. The indices are returned in increasing or decreasing
-* order depending on the parameter given at construction time.
-*/
-public int next() {
-	
-	if( !hasNext() ) throw new NoSuchElementException();
-	
-	return (reverse ? pointer-- : pointer++);
-}
-
-// -------------------------------------------------------------------
-
-public boolean hasNext() { return (reverse ? pointer >= 0 : pointer < len); }
-
-// -------------------------------------------------------------------
-
-/*
-public static void main( String pars[] ) throws Exception {
-	
-	LinearIterator rp = new LinearIterator(pars[0].equals("rev"));
-	
-	int k = Integer.parseInt(pars[1]);
-	rp.reset(k);
-	while(rp.hasNext()) System.out.println(rp.next());
-	
-	System.out.println();
-
-	k = Integer.parseInt(pars[2]);
-	rp.reset(k);
-	while(rp.hasNext()) System.out.println(rp.next());
-	System.out.println(rp.next());
-}
-*/
-}