mirror of
https://github.com/yacy/yacy_search_server.git
synced 2024-09-21 00:00:13 +02:00
788288eb9e
The default schema uses only some of them and the resting search index has now the following properties: - webgraph size will have about 40 times as much entries as default index - the complete index size will increase and may be about the double size of current amount As testing showed, not much indexing performance is lost. The default index will be smaller (moved fields out of it); thus searching can be faster. The new index will cause that some old parts in YaCy can be removed, i.e. specialized webgraph data and the noload crawler. The new index will make it possible to: - search within link texts of linked but not indexed documents (about 20 times of document index in size!!) - get a very detailed link graph - enhance ranking using a complete link graph To get the full access to the new index, the API to solr has now two access points: one with attribute core=collection1 for the default search index and core=webgraph to the new webgraph search index. This is also avaiable for p2p operation but client access is not yet implemented.
115 lines
3.9 KiB
Java
115 lines
3.9 KiB
Java
// ImageEntry.java
|
|
// -----------------------------
|
|
// (C) by Michael Peter Christen; mc@yacy.net
|
|
// first published on http://www.anomic.de
|
|
// Frankfurt, Germany, 2006
|
|
//
|
|
// $LastChangedDate$
|
|
// $LastChangedRevision$
|
|
// $LastChangedBy$
|
|
//
|
|
// 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.document.parser.html;
|
|
|
|
import java.util.Comparator;
|
|
|
|
import net.yacy.kelondro.data.meta.DigestURI;
|
|
|
|
public class ImageEntry implements Comparable<ImageEntry>, Comparator<ImageEntry> {
|
|
|
|
private final DigestURI url;
|
|
private final String alt;
|
|
private final int width, height;
|
|
private final long fileSize;
|
|
|
|
public ImageEntry(final DigestURI url, final String alt, final int width, final int height, long fileSize) {
|
|
assert url != null;
|
|
this.url = url;
|
|
this.alt = alt;
|
|
this.width = width;
|
|
this.height = height;
|
|
this.fileSize = fileSize;
|
|
}
|
|
|
|
public DigestURI url() {
|
|
return this.url;
|
|
}
|
|
|
|
public String alt() {
|
|
return this.alt;
|
|
}
|
|
|
|
public int width() {
|
|
return this.width;
|
|
}
|
|
|
|
public int height() {
|
|
return this.height;
|
|
}
|
|
|
|
public long fileSize() {
|
|
return this.fileSize;
|
|
}
|
|
|
|
@Override
|
|
public String toString() {
|
|
return "<img url=\"" + this.url.toNormalform(false) + "\"" +
|
|
(this.alt != null && this.alt.length() > 0 ? " alt=\"" + this.alt + "\"" : "") +
|
|
(this.width >= 0 ? " width=\"" + this.width + "\"" : "") +
|
|
(this.height >= 0 ? " height=\"" + this.height + "\"" : "") +
|
|
">";
|
|
}
|
|
|
|
@Override
|
|
public int hashCode() {
|
|
// if htmlFilterImageEntry elements are stored in a TreeSet, the biggest images shall be listed first
|
|
// this hash method therefore tries to compute a 'perfect hash' based on the size of the images
|
|
// unfortunately it can not be ensured that all images get different hashes, but this should appear
|
|
// only in very rare cases
|
|
if (this.width < 0 || this.height < 0)
|
|
return /*0x7FFF0000 |*/ (this.url.hashCode() & 0xFFFF);
|
|
return ((0x7FFF - (((this.width * this.height) >> 9) & 0x7FFF)) << 16) | (this.url.hashCode() & 0xFFFF);
|
|
}
|
|
|
|
@Override
|
|
public int compareTo(final ImageEntry h) {
|
|
// this is needed if this object is stored in a TreeSet
|
|
// this method uses the image-size ordering from the hashCode method
|
|
// assuming that hashCode would return a 'perfect hash' this method would
|
|
// create a total ordering on images with respect on the image size
|
|
assert (this.url != null);
|
|
if (this.url.toNormalform(true).equals((h).url.toNormalform(true))) return 0;
|
|
final int thc = this.hashCode();
|
|
final int ohc = (h).hashCode();
|
|
if (thc < ohc) return -1;
|
|
if (thc > ohc) return 1;
|
|
return this.url.toString().compareTo((h).url.toString());
|
|
}
|
|
|
|
@Override
|
|
public int compare(ImageEntry o1, ImageEntry o2) {
|
|
return o1.compareTo(o2);
|
|
}
|
|
|
|
@Override
|
|
public boolean equals(final Object o) {
|
|
if(o != null && o instanceof ImageEntry) {
|
|
return compareTo((ImageEntry) o) == 0;
|
|
}
|
|
return super.equals(o);
|
|
}
|
|
}
|