- added better control over file deletion, because this sometimes fails, especially on windows git-svn-id: https://svn.berlios.de/svnroot/repos/yacy/trunk@5756 6c8d7289-2bf4-0310-a012-ef5d649a1542pull/1/head
orbiter
16 years ago
parent
9ab009b16b
commit
96eaecda3e
@ -0,0 +1,331 @@
|
||||
// IndexCollectionMigration.java
|
||||
// (C) 2009 by Michael Peter Christen; mc@yacy.net, Frankfurt a. M., Germany
|
||||
// first published 30.03.2009 on http://yacy.net
|
||||
//
|
||||
// This is a part of YaCy, a peer-to-peer based web search engine
|
||||
//
|
||||
// $LastChangedDate: 2009-03-13 11:34:51 +0100 (Fr, 13 Mrz 2009) $
|
||||
// $LastChangedRevision: 5709 $
|
||||
// $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 de.anomic.kelondro.text;
|
||||
|
||||
import java.io.File;
|
||||
import java.io.IOException;
|
||||
import java.util.Set;
|
||||
|
||||
import de.anomic.kelondro.index.Row;
|
||||
import de.anomic.kelondro.order.Base64Order;
|
||||
import de.anomic.kelondro.order.ByteOrder;
|
||||
import de.anomic.kelondro.order.CloneableIterator;
|
||||
import de.anomic.kelondro.order.MergeIterator;
|
||||
import de.anomic.kelondro.order.Order;
|
||||
import de.anomic.kelondro.order.RotateIterator;
|
||||
import de.anomic.kelondro.text.Index;
|
||||
import de.anomic.kelondro.text.IndexCollection;
|
||||
import de.anomic.kelondro.text.ReferenceContainer;
|
||||
import de.anomic.kelondro.text.ReferenceContainerOrder;
|
||||
import de.anomic.kelondro.text.ReferenceRow;
|
||||
import de.anomic.kelondro.util.FileUtils;
|
||||
import de.anomic.kelondro.util.Log;
|
||||
|
||||
public final class IndexCollectionMigration extends AbstractBufferedIndex implements Index, BufferedIndex {
|
||||
|
||||
private final IndexCell cell;
|
||||
private IndexCollection collections;
|
||||
private final IODispatcher merger;
|
||||
|
||||
public IndexCollectionMigration (
|
||||
final File indexPrimaryTextLocation,
|
||||
final ByteOrder wordOrdering,
|
||||
final Row payloadrow,
|
||||
final int entityCacheMaxSize,
|
||||
final int maxCellArrayFiles,
|
||||
final IODispatcher merger,
|
||||
final Log log) throws IOException {
|
||||
|
||||
this.merger = merger;
|
||||
final File celldir = new File(indexPrimaryTextLocation, "RICELL");
|
||||
this.cell = new IndexCell(
|
||||
celldir,
|
||||
wordOrdering,
|
||||
ReferenceRow.urlEntryRow,
|
||||
entityCacheMaxSize, maxCellArrayFiles, this.merger);
|
||||
final File textindexcache = new File(indexPrimaryTextLocation, "RICACHE");
|
||||
if (textindexcache.exists()) {
|
||||
// migrate the "index.dhtout.blob" into RICELL directory
|
||||
File f = new File(textindexcache, "index.dhtout.blob");
|
||||
if (f.exists()) {
|
||||
File n = this.cell.newContainerBLOBFile();
|
||||
f.renameTo(n);
|
||||
this.cell.mountBLOBFile(n);
|
||||
}
|
||||
f = new File(textindexcache, "index.dhtin.blob");
|
||||
if (f.exists()) {
|
||||
File n = this.cell.newContainerBLOBFile();
|
||||
f.renameTo(n);
|
||||
this.cell.mountBLOBFile(n);
|
||||
}
|
||||
// delete everything else
|
||||
String[] l = textindexcache.list();
|
||||
for (String s: l) {
|
||||
f = new File(textindexcache, s);
|
||||
FileUtils.deletedelete(f);
|
||||
}
|
||||
FileUtils.deletedelete(textindexcache);
|
||||
}
|
||||
|
||||
// open collections, this is for migration only.
|
||||
final File textindexcollections = new File(indexPrimaryTextLocation, "RICOLLECTION");
|
||||
if (textindexcollections.exists()) {
|
||||
this.collections = new IndexCollection(
|
||||
textindexcollections,
|
||||
"collection",
|
||||
12,
|
||||
Base64Order.enhancedCoder,
|
||||
BufferedIndexCollection.maxCollectionPartition,
|
||||
ReferenceRow.urlEntryRow,
|
||||
false);
|
||||
if (this.collections.size() == 0) {
|
||||
// delete everything here
|
||||
this.collections.close();
|
||||
this.collections = null;
|
||||
String[] l = textindexcollections.list();
|
||||
File f;
|
||||
for (String s: l) {
|
||||
f = new File(textindexcollections, s);
|
||||
FileUtils.deletedelete(f);
|
||||
}
|
||||
FileUtils.deletedelete(textindexcollections);
|
||||
}
|
||||
} else {
|
||||
this.collections = null;
|
||||
}
|
||||
}
|
||||
|
||||
/* methods for interface Index */
|
||||
|
||||
public void add(final ReferenceContainer entries) throws IOException {
|
||||
assert (entries.row().objectsize == ReferenceRow.urlEntryRow.objectsize);
|
||||
|
||||
if (this.collections != null) {
|
||||
ReferenceContainer e = this.collections.delete(entries.getWordHash());
|
||||
if (e != null) {
|
||||
e.merge(entries);
|
||||
cell.add(e);
|
||||
} else {
|
||||
cell.add(entries);
|
||||
}
|
||||
} else {
|
||||
cell.add(entries);
|
||||
}
|
||||
}
|
||||
|
||||
public void add(final String wordHash, final ReferenceRow entry) throws IOException {
|
||||
if (this.collections != null) {
|
||||
ReferenceContainer e = this.collections.delete(wordHash);
|
||||
if (e != null) {
|
||||
e.add(entry);
|
||||
cell.add(e);
|
||||
} else {
|
||||
cell.add(wordHash, entry);
|
||||
}
|
||||
} else {
|
||||
cell.add(wordHash, entry);
|
||||
}
|
||||
}
|
||||
|
||||
public boolean has(final String wordHash) {
|
||||
if (this.collections != null) {
|
||||
ReferenceContainer e = this.collections.delete(wordHash);
|
||||
if (e != null) {
|
||||
try {
|
||||
cell.add(e);
|
||||
} catch (IOException e1) {
|
||||
e1.printStackTrace();
|
||||
}
|
||||
return true;
|
||||
} else {
|
||||
return cell.has(wordHash);
|
||||
}
|
||||
} else {
|
||||
return cell.has(wordHash);
|
||||
}
|
||||
}
|
||||
|
||||
public int count(String wordHash) {
|
||||
if (this.collections != null) {
|
||||
ReferenceContainer e = this.collections.delete(wordHash);
|
||||
if (e != null) {
|
||||
try {
|
||||
cell.add(e);
|
||||
} catch (IOException e1) {
|
||||
e1.printStackTrace();
|
||||
}
|
||||
return cell.count(wordHash);
|
||||
} else {
|
||||
return cell.count(wordHash);
|
||||
}
|
||||
} else {
|
||||
return cell.count(wordHash);
|
||||
}
|
||||
}
|
||||
|
||||
public ReferenceContainer get(final String wordHash, final Set<String> urlselection) throws IOException {
|
||||
if (wordHash == null) {
|
||||
// wrong input
|
||||
return null;
|
||||
}
|
||||
|
||||
if (this.collections != null) {
|
||||
ReferenceContainer e = this.collections.delete(wordHash);
|
||||
if (e != null) cell.add(e);
|
||||
}
|
||||
|
||||
return this.cell.get(wordHash, urlselection);
|
||||
}
|
||||
|
||||
public ReferenceContainer delete(final String wordHash) throws IOException {
|
||||
final ReferenceContainer c = new ReferenceContainer(
|
||||
wordHash,
|
||||
ReferenceRow.urlEntryRow,
|
||||
cell.count(wordHash));
|
||||
c.addAllUnique(cell.delete(wordHash));
|
||||
if (this.collections != null) c.merge(collections.delete(wordHash));
|
||||
return c;
|
||||
}
|
||||
|
||||
public boolean remove(final String wordHash, final String urlHash) throws IOException {
|
||||
if (this.collections != null) {
|
||||
ReferenceContainer e = this.collections.delete(wordHash);
|
||||
if (e != null) cell.add(e);
|
||||
}
|
||||
return cell.remove(wordHash, urlHash);
|
||||
}
|
||||
|
||||
public int remove(final String wordHash, final Set<String> urlHashes) throws IOException {
|
||||
if (this.collections != null) {
|
||||
ReferenceContainer e = this.collections.delete(wordHash);
|
||||
if (e != null) cell.add(e);
|
||||
}
|
||||
return cell.remove(wordHash, urlHashes);
|
||||
}
|
||||
|
||||
public synchronized CloneableIterator<ReferenceContainer> references(final String startHash, final boolean rot, final boolean ram) throws IOException {
|
||||
final CloneableIterator<ReferenceContainer> i = wordContainers(startHash, ram);
|
||||
if (rot) {
|
||||
return new RotateIterator<ReferenceContainer>(i, new String(Base64Order.zero(startHash.length())), cell.size() + ((ram) ? 0 : collections.size()));
|
||||
}
|
||||
return i;
|
||||
}
|
||||
|
||||
private synchronized CloneableIterator<ReferenceContainer> wordContainers(final String startWordHash, final boolean ram) throws IOException {
|
||||
final Order<ReferenceContainer> containerOrder = new ReferenceContainerOrder(cell.ordering().clone());
|
||||
containerOrder.rotate(ReferenceContainer.emptyContainer(startWordHash, 0));
|
||||
if (ram) {
|
||||
return cell.references(startWordHash, true);
|
||||
}
|
||||
if (collections == null) return cell.references(startWordHash, false);
|
||||
return new MergeIterator<ReferenceContainer>(
|
||||
cell.references(startWordHash, false),
|
||||
collections.references(startWordHash, false),
|
||||
containerOrder,
|
||||
ReferenceContainer.containerMergeMethod,
|
||||
true);
|
||||
}
|
||||
|
||||
public void clear() {
|
||||
try {
|
||||
cell.clear();
|
||||
} catch (IOException e1) {
|
||||
e1.printStackTrace();
|
||||
}
|
||||
if (collections != null) try {
|
||||
collections.clear();
|
||||
} catch (IOException e) {
|
||||
e.printStackTrace();
|
||||
}
|
||||
}
|
||||
|
||||
public void close() {
|
||||
cell.close();
|
||||
if (collections != null) collections.close();
|
||||
}
|
||||
|
||||
public int size() {
|
||||
return (collections == null) ? cell.size() : java.lang.Math.max(collections.size(), cell.size());
|
||||
}
|
||||
|
||||
public int minMem() {
|
||||
return 1024*1024 /* indexing overhead */ + cell.minMem() + ((collections == null) ? 0 : collections.minMem());
|
||||
}
|
||||
|
||||
|
||||
/*
|
||||
* methods for cache management
|
||||
*/
|
||||
|
||||
public int getBufferMaxReferences() {
|
||||
return cell.getBufferMaxReferences();
|
||||
}
|
||||
|
||||
public long getBufferMinAge() {
|
||||
return cell.getBufferMinAge();
|
||||
}
|
||||
|
||||
public long getBufferMaxAge() {
|
||||
return cell.getBufferMaxAge();
|
||||
}
|
||||
|
||||
public long getBufferSizeBytes() {
|
||||
return cell.getBufferSizeBytes();
|
||||
}
|
||||
|
||||
public void setBufferMaxWordCount(final int maxWords) {
|
||||
cell.setBufferMaxWordCount(maxWords);
|
||||
}
|
||||
|
||||
public int getBackendSize() {
|
||||
return (collections == null) ? cell.getBackendSize() : collections.size();
|
||||
}
|
||||
|
||||
public int getBufferSize() {
|
||||
return cell.getBufferSize();
|
||||
}
|
||||
|
||||
public ByteOrder ordering() {
|
||||
return cell.ordering();
|
||||
}
|
||||
|
||||
public CloneableIterator<ReferenceContainer> references(String startWordHash, boolean rot) {
|
||||
final Order<ReferenceContainer> containerOrder = new ReferenceContainerOrder(this.cell.ordering().clone());
|
||||
if (this.collections == null) return this.cell.references(startWordHash, rot);
|
||||
//else
|
||||
return new MergeIterator<ReferenceContainer>(
|
||||
this.cell.references(startWordHash, false),
|
||||
this.collections.references(startWordHash, false),
|
||||
containerOrder,
|
||||
ReferenceContainer.containerMergeMethod,
|
||||
true);
|
||||
}
|
||||
|
||||
public void cleanupBuffer(int time) {
|
||||
this.cell.cleanupBuffer(time);
|
||||
}
|
||||
}
|
||||
Loading…
Reference in new issue