mirror of
https://github.com/yacy/yacy_search_server.git
synced 2024-09-21 00:00:13 +02:00
e54cb7fb0c
git-svn-id: https://svn.berlios.de/svnroot/repos/yacy/trunk@7202 6c8d7289-2bf4-0310-a012-ef5d649a1542
102 lines
3.3 KiB
Java
102 lines
3.3 KiB
Java
// AbstractReference.java
|
|
// (C) 2009 by Michael Peter Christen; mc@yacy.net, Frankfurt a. M., Germany
|
|
// first published 14.04.2009 on http://yacy.net
|
|
//
|
|
// This is a part of YaCy, a peer-to-peer based web search engine
|
|
//
|
|
// $LastChangedDate: 2009-04-07 11:34:41 +0200 (Di, 07 Apr 2009) $
|
|
// $LastChangedRevision: 5783 $
|
|
// $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 net.yacy.kelondro.rwi;
|
|
|
|
import java.util.List;
|
|
|
|
|
|
public abstract class AbstractReference implements Reference {
|
|
|
|
protected static void a(List<Integer> a, int i) {
|
|
assert a != null;
|
|
if (i < 0) return; // signal for 'do nothing'
|
|
synchronized (a) {
|
|
a.clear();
|
|
a.add(i);
|
|
}
|
|
}
|
|
protected static int max(List<Integer> a, List<Integer> b) {
|
|
assert a != null;
|
|
if (a.size() == 0) return max(b);
|
|
if (b.size() == 0) return max(a);
|
|
return Math.max(max(a), max(b));
|
|
}
|
|
protected static int min(List<Integer> a, List<Integer> b) {
|
|
assert a != null;
|
|
if (a.size() == 0) return min(b);
|
|
if (b.size() == 0) return min(a);
|
|
int ma = min(a);
|
|
int mb = min(b);
|
|
if (ma == -1) return mb;
|
|
if (mb == -1) return ma;
|
|
return Math.min(ma, mb);
|
|
}
|
|
|
|
private static int max(List<Integer> a) {
|
|
assert a != null;
|
|
if (a.size() == 0) return -1;
|
|
if (a.size() == 1) return a.get(0);
|
|
if (a.size() == 2) return Math.max(a.get(0), a.get(1));
|
|
int r = a.get(0);
|
|
for (int i = 1; i < a.size(); i++) if (a.get(i) > r) r = a.get(i);
|
|
return r;
|
|
}
|
|
private static int min(List<Integer> a) {
|
|
assert a != null;
|
|
if (a.size() == 0) return -1;
|
|
if (a.size() == 1) return a.get(0);
|
|
if (a.size() == 2) return Math.min(a.get(0), a.get(1));
|
|
int r = a.get(0);
|
|
for (int i = 1; i < a.size(); i++) if (a.get(i) < r) r = a.get(i);
|
|
return r;
|
|
}
|
|
|
|
public int maxposition() {
|
|
assert positions() > 0;
|
|
if (positions() == 1) return position(0);
|
|
int p = position(0);
|
|
for (int i = positions() - 1; i > 0; i--) if (position(i) > p) p = position(i);
|
|
return p;
|
|
}
|
|
|
|
public int minposition() {
|
|
assert positions() > 0;
|
|
if (positions() == 1) return position(0);
|
|
int p = position(0);
|
|
for (int i = positions() - 1; i > 0; i--) if (position(i) < p) p = position(i);
|
|
return p;
|
|
}
|
|
|
|
public int distance() {
|
|
int d = 0;
|
|
for (int i = 0; i < this.positions() - 1; i++) {
|
|
d += Math.abs(this.position(i) - this.position(i + 1));
|
|
}
|
|
return d;
|
|
}
|
|
}
|