mirror of
https://github.com/yacy/yacy_search_server.git
synced 2024-09-21 00:00:13 +02:00
621b473b18
- removed unnecessary code (unused variables, String.toString) - corrected some calculations (cast int to double or long ;) - improved little performance (using Integer.valueOf() instead of new Integer) - log if some File-actions fail (mkdir(), delete(), ...) and some ignored exceptions - finalized some (more) fields - finally close some streams - made inner classes static if not using environment - generalized some equals (from specificClass to Object) - fixed some potential nullpointer accesses git-svn-id: https://svn.berlios.de/svnroot/repos/yacy/trunk@5039 6c8d7289-2bf4-0310-a012-ef5d649a1542
105 lines
3.8 KiB
Java
105 lines
3.8 KiB
Java
// kelondroObjectSpace.java
|
|
// ------------------------
|
|
// part of The Kelondro Database
|
|
// (C) by Michael Peter Christen; mc@yacy.net
|
|
// first published on http://www.anomic.de
|
|
// Frankfurt, Germany, 2005
|
|
// created: 12.12.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
|
|
|
|
package de.anomic.kelondro;
|
|
|
|
import java.util.ArrayList;
|
|
import java.util.HashMap;
|
|
import java.util.Iterator;
|
|
import java.util.Map;
|
|
import java.util.TreeMap;
|
|
|
|
public class kelondroObjectSpace {
|
|
|
|
private static final int minSize = 10;
|
|
private static final int maxSize = 256;
|
|
|
|
private static HashMap<Integer, ArrayList<byte[]>> objHeap = new HashMap<Integer, ArrayList<byte[]>>();
|
|
private static TreeMap<Integer, Integer> aliveNow = new TreeMap<Integer, Integer>();
|
|
//private static TreeMap aliveMax = new TreeMap();
|
|
|
|
private static void incAlive(final int size) {
|
|
final Integer s = Integer.valueOf(size);
|
|
synchronized (aliveNow) {
|
|
final Integer x = aliveNow.get(s);
|
|
if (x == null) aliveNow.put(s, Integer.valueOf(1)); else aliveNow.put(s, Integer.valueOf(x.intValue() + 1));
|
|
}
|
|
}
|
|
|
|
private static void decAlive(final int size) {
|
|
final Integer s = Integer.valueOf(size);
|
|
synchronized (aliveNow) {
|
|
final Integer x = aliveNow.get(s);
|
|
if (x == null) aliveNow.put(s, Integer.valueOf(-1)); else aliveNow.put(s, Integer.valueOf(x.intValue() - 1));
|
|
}
|
|
}
|
|
|
|
public static byte[] alloc(final int len) {
|
|
if ((len < minSize) || (len > maxSize)) return new byte[len];
|
|
incAlive(len);
|
|
synchronized (objHeap) {
|
|
final ArrayList<byte[]> buf = objHeap.get(Integer.valueOf(len));
|
|
if ((buf == null) || (buf.size() == 0)) return new byte[len];
|
|
return buf.remove(buf.size() - 1);
|
|
}
|
|
}
|
|
|
|
public static void recycle(final byte[] b) {
|
|
if ((b.length < minSize) || (b.length > maxSize)) {
|
|
return;
|
|
}
|
|
decAlive(b.length);
|
|
synchronized (objHeap) {
|
|
final Integer i = Integer.valueOf(b.length);
|
|
ArrayList<byte[]> buf = objHeap.get(i);
|
|
if (buf == null) {
|
|
buf = new ArrayList<byte[]>();
|
|
buf.add(b);
|
|
objHeap.put(i, buf);
|
|
} else {
|
|
buf.add(b);
|
|
}
|
|
}
|
|
}
|
|
|
|
public static TreeMap<Integer, Integer> statAlive() {
|
|
return aliveNow;
|
|
}
|
|
|
|
public static TreeMap<Integer, Integer> statHeap() {
|
|
// creates a statistic output of this object space
|
|
// the result is a mapping from Integer (chunk size) to Integer (number of counts)
|
|
// and shows how many Objects are held in this space for usage
|
|
final TreeMap<Integer, Integer> result = new TreeMap<Integer, Integer>();
|
|
synchronized (objHeap) {
|
|
final Iterator<Map.Entry<Integer, ArrayList<byte[]>>> i = objHeap.entrySet().iterator();
|
|
Map.Entry<Integer, ArrayList<byte[]>> entry;
|
|
while (i.hasNext()) {
|
|
entry = i.next();
|
|
result.put(entry.getKey(), Integer.valueOf(entry.getValue().size()));
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
|
|
}
|