You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
yacy_search_server/source/de/anomic/tools/disorderHeap.java

100 lines
3.7 KiB

// disorderHeap.java
// -----------------------
// (C) by Michael Peter Christen; mc@anomic.de
// first published on http://www.anomic.de
// Frankfurt, Germany, 2004
// last major change: 17.05.2004
//
// 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
//
// Using this software in any meaning (reading, learning, copying, compiling,
// running) means that you agree that the Author(s) is (are) not responsible
// for cost, loss of data or any harm that may be caused directly or indirectly
// by usage of this softare or this documentation. The usage of this software
// is on your own risk. The installation and usage (starting/running) of this
// software may allow other people or application to access your computer and
// any attached devices and is highly dependent on the configuration of the
// software which must be done by the user of the software; the author(s) is
// (are) also not responsible for proper configuration and usage of the
// software, even if provoked by documentation provided together with
// the software.
//
// Any changes to this file according to the GPL as documented in the file
// gpl.txt aside this file in the shipment you received can be done to the
// lines that follows this copyright notice here, but changes must not be
// done inside the copyright notive above. A re-distribution must contain
// the intact and unchanged copyright notice.
// Contributions and changes to the program code must be marked as such.
package de.anomic.tools;
import java.io.Serializable;
import java.util.LinkedList;
public class disorderHeap implements Serializable {
/**
* generated with svn4743 on 2008-04-28
*/
private static final long serialVersionUID = -1576632540870640019L;
LinkedList<String> list;
public disorderHeap() {
list = new LinkedList<String>();
}
public disorderHeap(int numbers) {
// create a disorder heap with numbers in it
// the numbers are 0..numbers-1
this();
for (int i = 0; i < numbers; i++) add(Integer.toString(i));
}
public synchronized void add(String element) {
// add one element into the list at an arbitrary position
int pos = (int) ((System.currentTimeMillis() / 7) % (list.size() + 1));
list.add(pos, element);
}
public synchronized String remove() {
if (list.size() == 0) return null;
int pos = (int) ((System.currentTimeMillis() / 13) % list.size());
return list.remove(pos);
}
public synchronized int number() {
String n = this.remove();
if (n == null) return -1;
try {
return Integer.parseInt(n);
} catch (Exception e) {
return -1;
}
}
public synchronized int size() {
return list.size();
}
public static void main(String[] args) {
disorderHeap ul = new disorderHeap();
for (int i = 0; i < args.length; i++) ul.add(args[i]);
for (int i = 0; i < args.length; i++) System.out.print(ul.remove() + " ");
System.out.println();
}
}