git-svn-id: https://svn.berlios.de/svnroot/repos/yacy/trunk@1121 6c8d7289-2bf4-0310-a012-ef5d649a1542pull/1/head
orbiter
19 years ago
parent
4776f3f815
commit
85282b1d98
@ -0,0 +1,95 @@
|
||||
// kelondroBinSearch.java
|
||||
// -----------------------
|
||||
// part of The Kelondro Database
|
||||
// (C) by Michael Peter Christen; mc@anomic.de
|
||||
// first published on http://www.anomic.de
|
||||
// Frankfurt, Germany, 2005
|
||||
// created 22.11.2005
|
||||
//
|
||||
// $LastChangedDate: 2005-09-22 22:01:26 +0200 (Thu, 22 Sep 2005) $
|
||||
// $LastChangedRevision: 774 $
|
||||
// $LastChangedBy: orbiter $
|
||||
//
|
||||
// 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.kelondro;
|
||||
|
||||
|
||||
public class kelondroBinSearch {
|
||||
|
||||
private byte[] chunks;
|
||||
private int chunksize;
|
||||
private byte[] buffer;
|
||||
private int count;
|
||||
|
||||
public kelondroBinSearch(byte[] chunks, int chunksize) {
|
||||
this.chunks = chunks;
|
||||
this.chunksize = chunksize;
|
||||
this.count = chunks.length / chunksize;
|
||||
this.buffer = new byte[chunksize];
|
||||
}
|
||||
|
||||
public boolean contains(byte[] t) {
|
||||
return contains(t, 0, this.count);
|
||||
}
|
||||
|
||||
private synchronized boolean contains(byte[] t, int beginPos, int endPos) {
|
||||
// the endPos is exclusive, beginPos is inclusive
|
||||
// this method is synchronized to make the use of the buffer possible
|
||||
if (beginPos >= endPos) return false;
|
||||
int pivot = (beginPos + endPos) / 2;
|
||||
if ((pivot < 0) || (pivot >= this.count)) return false;
|
||||
selectBuffer(pivot);
|
||||
int c = kelondroTree.compare(buffer, t);
|
||||
if (c == 0) return true;
|
||||
if (c < 0) /* buffer < t */ return contains(t, pivot + 1, endPos);
|
||||
if (c > 0) /* buffer > t */ return contains(t, beginPos, pivot);
|
||||
return false;
|
||||
}
|
||||
|
||||
private void selectBuffer(int element) {
|
||||
System.arraycopy(this.chunks, element * this.chunksize, this.buffer, 0, chunksize);
|
||||
}
|
||||
|
||||
public static void main(String[] args) {
|
||||
String s = "4CEvsI8FRczRBo_ApRCkwfEbFLn1pIFXg39QGMgj5RHM6HpIMJq67QX3M5iQYr_LyI_5aGDaa_bYbRgJ9XnQjpmq6QkOoGWAoEaihRqhV3kItLFHjRtqauUR";
|
||||
kelondroBinSearch bs = new kelondroBinSearch(s.getBytes(), 6);
|
||||
for (int i = 0; i + 6 <= s.length(); i = i + 6) {
|
||||
System.out.println(s.substring(i, i + 6) + ":" + ((bs.contains(s.substring(i, i + 6).getBytes())) ? "drin" : "draussen"));
|
||||
}
|
||||
for (int i = 0; i + 7 <= s.length(); i = i + 6) {
|
||||
System.out.println(s.substring(i + 1, i + 7) + ":" + ((bs.contains(s.substring(i + 1, i + 7).getBytes())) ? "drin" : "draussen"));
|
||||
}
|
||||
}
|
||||
}
|
||||
Loading…
Reference in new issue