|
|
|
@ -1,4 +1,4 @@
|
|
|
|
// plasmaSearchRankingProcess.java
|
|
|
|
// RankingProcess.java
|
|
|
|
// (C) 2007 by Michael Peter Christen; mc@yacy.net, Frankfurt a. M., Germany
|
|
|
|
// (C) 2007 by Michael Peter Christen; mc@yacy.net, Frankfurt a. M., Germany
|
|
|
|
// first published 07.11.2007 on http://yacy.net
|
|
|
|
// first published 07.11.2007 on http://yacy.net
|
|
|
|
//
|
|
|
|
//
|
|
|
|
@ -29,12 +29,12 @@ package de.anomic.search;
|
|
|
|
import java.io.File;
|
|
|
|
import java.io.File;
|
|
|
|
import java.io.IOException;
|
|
|
|
import java.io.IOException;
|
|
|
|
import java.util.ArrayList;
|
|
|
|
import java.util.ArrayList;
|
|
|
|
import java.util.Arrays;
|
|
|
|
|
|
|
|
import java.util.Comparator;
|
|
|
|
import java.util.Comparator;
|
|
|
|
import java.util.ConcurrentModificationException;
|
|
|
|
import java.util.ConcurrentModificationException;
|
|
|
|
import java.util.HashMap;
|
|
|
|
import java.util.HashMap;
|
|
|
|
import java.util.HashSet;
|
|
|
|
import java.util.HashSet;
|
|
|
|
import java.util.Iterator;
|
|
|
|
import java.util.Iterator;
|
|
|
|
|
|
|
|
import java.util.List;
|
|
|
|
import java.util.Map;
|
|
|
|
import java.util.Map;
|
|
|
|
import java.util.TreeSet;
|
|
|
|
import java.util.TreeSet;
|
|
|
|
import java.util.concurrent.BlockingQueue;
|
|
|
|
import java.util.concurrent.BlockingQueue;
|
|
|
|
@ -81,9 +81,10 @@ public final class RankingProcess extends Thread {
|
|
|
|
private final ConcurrentHashMap<String, SortStack<WordReferenceVars>> doubleDomCache; // key = domhash (6 bytes); value = like stack
|
|
|
|
private final ConcurrentHashMap<String, SortStack<WordReferenceVars>> doubleDomCache; // key = domhash (6 bytes); value = like stack
|
|
|
|
private final HashSet<String> handover; // key = urlhash; used for double-check of urls that had been handed over to search process
|
|
|
|
private final HashSet<String> handover; // key = urlhash; used for double-check of urls that had been handed over to search process
|
|
|
|
|
|
|
|
|
|
|
|
private final ConcurrentHashMap<String, Integer> ref; // reference score computation for the commonSense heuristic
|
|
|
|
private final Navigator ref; // reference score computation for the commonSense heuristic
|
|
|
|
private final ConcurrentHashMap<String, HostInfo> hostNavigator;
|
|
|
|
private final Navigator hostNavigator;
|
|
|
|
private final ConcurrentHashMap<String, AuthorInfo> authorNavigator;
|
|
|
|
private final Navigator authorNavigator;
|
|
|
|
|
|
|
|
private final Navigator namespaceNavigator;
|
|
|
|
private final ReferenceOrder order;
|
|
|
|
private final ReferenceOrder order;
|
|
|
|
|
|
|
|
|
|
|
|
public RankingProcess(final QueryParams query, final ReferenceOrder order, final int maxentries, final int concurrency) {
|
|
|
|
public RankingProcess(final QueryParams query, final ReferenceOrder order, final int maxentries, final int concurrency) {
|
|
|
|
@ -106,9 +107,10 @@ public final class RankingProcess extends Thread {
|
|
|
|
this.misses = new TreeSet<String>();
|
|
|
|
this.misses = new TreeSet<String>();
|
|
|
|
this.flagcount = new int[32];
|
|
|
|
this.flagcount = new int[32];
|
|
|
|
for (int i = 0; i < 32; i++) {this.flagcount[i] = 0;}
|
|
|
|
for (int i = 0; i < 32; i++) {this.flagcount[i] = 0;}
|
|
|
|
this.hostNavigator = new ConcurrentHashMap<String, HostInfo>();
|
|
|
|
this.hostNavigator = new Navigator();
|
|
|
|
this.authorNavigator = new ConcurrentHashMap<String, AuthorInfo>();
|
|
|
|
this.authorNavigator = new Navigator();
|
|
|
|
this.ref = new ConcurrentHashMap<String, Integer>();
|
|
|
|
this.namespaceNavigator = new Navigator();
|
|
|
|
|
|
|
|
this.ref = new Navigator();
|
|
|
|
//this.domZones = new int[8];
|
|
|
|
//this.domZones = new int[8];
|
|
|
|
//for (int i = 0; i < 8; i++) {this.domZones[i] = 0;}
|
|
|
|
//for (int i = 0; i < 8; i++) {this.domZones[i] = 0;}
|
|
|
|
this.feeders = concurrency;
|
|
|
|
this.feeders = concurrency;
|
|
|
|
@ -171,8 +173,7 @@ public final class RankingProcess extends Thread {
|
|
|
|
EventTracker.update("SEARCH", new ProfilingGraph.searchEvent(query.id(true), SearchEvent.NORMALIZING, index.size(), System.currentTimeMillis() - timer), false, 30000, ProfilingGraph.maxTime);
|
|
|
|
EventTracker.update("SEARCH", new ProfilingGraph.searchEvent(query.id(true), SearchEvent.NORMALIZING, index.size(), System.currentTimeMillis() - timer), false, 30000, ProfilingGraph.maxTime);
|
|
|
|
|
|
|
|
|
|
|
|
// iterate over normalized entries and select some that are better than currently stored
|
|
|
|
// iterate over normalized entries and select some that are better than currently stored
|
|
|
|
timer = System.currentTimeMillis();
|
|
|
|
timer = System.currentTimeMillis();
|
|
|
|
HostInfo hs;
|
|
|
|
|
|
|
|
String domhash;
|
|
|
|
String domhash;
|
|
|
|
boolean nav_hosts = this.query.navigators.equals("all") || this.query.navigators.indexOf("hosts") >= 0;
|
|
|
|
boolean nav_hosts = this.query.navigators.equals("all") || this.query.navigators.indexOf("hosts") >= 0;
|
|
|
|
Long r;
|
|
|
|
Long r;
|
|
|
|
@ -221,12 +222,7 @@ public final class RankingProcess extends Thread {
|
|
|
|
// get statistics for host navigator
|
|
|
|
// get statistics for host navigator
|
|
|
|
if (nav_hosts) {
|
|
|
|
if (nav_hosts) {
|
|
|
|
domhash = iEntry.urlHash.substring(6);
|
|
|
|
domhash = iEntry.urlHash.substring(6);
|
|
|
|
hs = this.hostNavigator.get(domhash);
|
|
|
|
this.hostNavigator.inc(domhash, iEntry.urlHash);
|
|
|
|
if (hs == null) {
|
|
|
|
|
|
|
|
this.hostNavigator.put(domhash, new HostInfo(iEntry.urlHash));
|
|
|
|
|
|
|
|
} else {
|
|
|
|
|
|
|
|
hs.inc();
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// accept
|
|
|
|
// accept
|
|
|
|
@ -377,6 +373,7 @@ public final class RankingProcess extends Thread {
|
|
|
|
public URIMetadataRow takeURL(final boolean skipDoubleDom, final int timeout) {
|
|
|
|
public URIMetadataRow takeURL(final boolean skipDoubleDom, final int timeout) {
|
|
|
|
// returns from the current RWI list the best URL entry and removes this entry from the list
|
|
|
|
// returns from the current RWI list the best URL entry and removes this entry from the list
|
|
|
|
long timeLimit = System.currentTimeMillis() + timeout;
|
|
|
|
long timeLimit = System.currentTimeMillis() + timeout;
|
|
|
|
|
|
|
|
int p = -1;
|
|
|
|
while (System.currentTimeMillis() < timeLimit) {
|
|
|
|
while (System.currentTimeMillis() < timeLimit) {
|
|
|
|
final SortStack<WordReferenceVars>.stackElement obrwi = takeRWI(skipDoubleDom);
|
|
|
|
final SortStack<WordReferenceVars>.stackElement obrwi = takeRWI(skipDoubleDom);
|
|
|
|
if (obrwi == null) {
|
|
|
|
if (obrwi == null) {
|
|
|
|
@ -444,17 +441,22 @@ public final class RankingProcess extends Thread {
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// add author to the author navigator
|
|
|
|
// add author to the author navigator
|
|
|
|
AuthorInfo in = this.authorNavigator.get(authorhash);
|
|
|
|
this.authorNavigator.inc(authorhash, pageauthor);
|
|
|
|
if (in == null) {
|
|
|
|
|
|
|
|
this.authorNavigator.put(authorhash, new AuthorInfo(pageauthor));
|
|
|
|
|
|
|
|
} else {
|
|
|
|
|
|
|
|
in.inc();
|
|
|
|
|
|
|
|
this.authorNavigator.put(authorhash, in);
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
} else if (this.query.authorhash != null) {
|
|
|
|
} else if (this.query.authorhash != null) {
|
|
|
|
continue;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// namespace navigation
|
|
|
|
|
|
|
|
String pagepath = metadata.url().getPath();
|
|
|
|
|
|
|
|
if ((p = pagepath.indexOf(':')) >= 0) {
|
|
|
|
|
|
|
|
pagepath = pagepath.substring(0,p);
|
|
|
|
|
|
|
|
p = pagepath.lastIndexOf('/');
|
|
|
|
|
|
|
|
if (p >= 0) {
|
|
|
|
|
|
|
|
pagepath = pagepath.substring(p + 1);
|
|
|
|
|
|
|
|
this.namespaceNavigator.inc(pagepath, pagepath);
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// accept url
|
|
|
|
// accept url
|
|
|
|
//System.out.println("handing over hash " + page.hash());
|
|
|
|
//System.out.println("handing over hash " + page.hash());
|
|
|
|
this.handover.add(page.hash()); // remember that we handed over this url
|
|
|
|
this.handover.add(page.hash()); // remember that we handed over this url
|
|
|
|
@ -525,68 +527,32 @@ public final class RankingProcess extends Thread {
|
|
|
|
return this.misses.iterator();
|
|
|
|
return this.misses.iterator();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
public class HostInfo {
|
|
|
|
public ArrayList<Navigator.Item> getNamespaceNavigator(int count) {
|
|
|
|
public int count;
|
|
|
|
if (!this.query.navigators.equals("all") && this.query.navigators.indexOf("namespace") < 0) return new ArrayList<Navigator.Item>(0);
|
|
|
|
public String hashsample;
|
|
|
|
|
|
|
|
public HostInfo(String urlhash) {
|
|
|
|
Navigator.Item[] hsa = this.namespaceNavigator.entries();
|
|
|
|
this.count = 1;
|
|
|
|
int rc = Math.min(count, hsa.length);
|
|
|
|
this.hashsample = urlhash;
|
|
|
|
ArrayList<Navigator.Item> result = new ArrayList<Navigator.Item>();
|
|
|
|
}
|
|
|
|
for (int i = 0; i < rc; i++) result.add(hsa[i]);
|
|
|
|
public void inc() {
|
|
|
|
return result;
|
|
|
|
this.count++;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
public class AuthorInfo {
|
|
|
|
|
|
|
|
public int count;
|
|
|
|
|
|
|
|
public String author;
|
|
|
|
|
|
|
|
public AuthorInfo(String author) {
|
|
|
|
|
|
|
|
this.count = 1;
|
|
|
|
|
|
|
|
this.author = author;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
public void inc() {
|
|
|
|
|
|
|
|
this.count++;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
public static final Comparator<HostInfo> hscomp = new Comparator<HostInfo>() {
|
|
|
|
public List<Navigator.Item> getHostNavigators(int count) {
|
|
|
|
public int compare(HostInfo o1, HostInfo o2) {
|
|
|
|
if (!this.query.navigators.equals("all") && this.query.navigators.indexOf("hosts") < 0) return new ArrayList<Navigator.Item>(0);
|
|
|
|
if (o1.count < o2.count) return 1;
|
|
|
|
|
|
|
|
if (o2.count < o1.count) return -1;
|
|
|
|
return this.hostNavigator.entries(10);
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
public static final Comparator<AuthorInfo> aicomp = new Comparator<AuthorInfo>() {
|
|
|
|
|
|
|
|
public int compare(AuthorInfo o1, AuthorInfo o2) {
|
|
|
|
|
|
|
|
if (o1.count < o2.count) return 1;
|
|
|
|
|
|
|
|
if (o2.count < o1.count) return -1;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
public class NavigatorEntry {
|
|
|
|
|
|
|
|
public int count;
|
|
|
|
|
|
|
|
public String name;
|
|
|
|
|
|
|
|
public NavigatorEntry(String name, int count) {
|
|
|
|
|
|
|
|
this.name = name;
|
|
|
|
|
|
|
|
this.count = count;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
public List<Navigator.Item> getHostNavigator(int count) {
|
|
|
|
public ArrayList<NavigatorEntry> getHostNavigator(int count) {
|
|
|
|
List<Navigator.Item> result = new ArrayList<Navigator.Item>();
|
|
|
|
if (!this.query.navigators.equals("all") && this.query.navigators.indexOf("hosts") < 0) return new ArrayList<NavigatorEntry>(0);
|
|
|
|
if (!this.query.navigators.equals("all") && this.query.navigators.indexOf("hosts") < 0) return result;
|
|
|
|
|
|
|
|
|
|
|
|
HostInfo[] hsa = this.hostNavigator.values().toArray(new HostInfo[this.hostNavigator.size()]);
|
|
|
|
List<Navigator.Item> hsa = this.hostNavigator.entries(10);
|
|
|
|
Arrays.sort(hsa, hscomp);
|
|
|
|
|
|
|
|
int rc = Math.min(count, hsa.length);
|
|
|
|
|
|
|
|
ArrayList<NavigatorEntry> result = new ArrayList<NavigatorEntry>();
|
|
|
|
|
|
|
|
URIMetadataRow mr;
|
|
|
|
URIMetadataRow mr;
|
|
|
|
DigestURI url;
|
|
|
|
DigestURI url;
|
|
|
|
String hostname;
|
|
|
|
String hostname;
|
|
|
|
Components metadata;
|
|
|
|
Components metadata;
|
|
|
|
loop: for (int i = 0; i < rc; i++) {
|
|
|
|
loop: for (Navigator.Item item: hsa) {
|
|
|
|
mr = this.query.getSegment().urlMetadata().load(hsa[i].hashsample, null, 0);
|
|
|
|
mr = this.query.getSegment().urlMetadata().load(item.name, null, 0);
|
|
|
|
if (mr == null) continue;
|
|
|
|
if (mr == null) continue;
|
|
|
|
metadata = mr.metadata();
|
|
|
|
metadata = mr.metadata();
|
|
|
|
if (metadata == null) continue;
|
|
|
|
if (metadata == null) continue;
|
|
|
|
@ -595,12 +561,13 @@ public final class RankingProcess extends Thread {
|
|
|
|
hostname = url.getHost();
|
|
|
|
hostname = url.getHost();
|
|
|
|
if (hostname == null) continue;
|
|
|
|
if (hostname == null) continue;
|
|
|
|
if (query.tenant != null && !hostname.contains(query.tenant) && !url.toNormalform(true, true).contains(query.tenant)) continue;
|
|
|
|
if (query.tenant != null && !hostname.contains(query.tenant) && !url.toNormalform(true, true).contains(query.tenant)) continue;
|
|
|
|
for (NavigatorEntry entry: result) if (entry.name.equals(hostname)) continue loop; // check if one entry already exists
|
|
|
|
for (Navigator.Item entry: result) if (entry.name.equals(hostname)) continue loop; // check if one entry already exists
|
|
|
|
result.add(new NavigatorEntry(hostname, hsa[i].count));
|
|
|
|
result.add(new Navigator.Item(hostname, item.count));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
public static final Comparator<Map.Entry<String, Integer>> mecomp = new Comparator<Map.Entry<String, Integer>>() {
|
|
|
|
public static final Comparator<Map.Entry<String, Integer>> mecomp = new Comparator<Map.Entry<String, Integer>>() {
|
|
|
|
public int compare(Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2) {
|
|
|
|
public int compare(Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2) {
|
|
|
|
if (o1.getValue().intValue() < o2.getValue().intValue()) return 1;
|
|
|
|
if (o1.getValue().intValue() < o2.getValue().intValue()) return 1;
|
|
|
|
@ -609,44 +576,29 @@ public final class RankingProcess extends Thread {
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
public Map<String, Integer> getTopics() {
|
|
|
|
public Map<String, Navigator.Item> getTopics() {
|
|
|
|
return this.ref;
|
|
|
|
return this.ref.map();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
@SuppressWarnings("unchecked")
|
|
|
|
public List<Navigator.Item> getTopicNavigator(final int count) {
|
|
|
|
public ArrayList<NavigatorEntry> getTopicNavigator(final int count) {
|
|
|
|
|
|
|
|
// create a list of words that had been computed by statistics over all
|
|
|
|
// create a list of words that had been computed by statistics over all
|
|
|
|
// words that appeared in the url or the description of all urls
|
|
|
|
// words that appeared in the url or the description of all urls
|
|
|
|
if (!this.query.navigators.equals("all") && this.query.navigators.indexOf("topics") < 0) return new ArrayList<NavigatorEntry>(0);
|
|
|
|
if (!this.query.navigators.equals("all") && this.query.navigators.indexOf("topics") < 0) return new ArrayList<Navigator.Item>(0);
|
|
|
|
|
|
|
|
|
|
|
|
Map.Entry<String, Integer>[] a = this.ref.entrySet().toArray(new Map.Entry[this.ref.size()]);
|
|
|
|
return this.ref.entries(10);
|
|
|
|
Arrays.sort(a, mecomp);
|
|
|
|
|
|
|
|
int rc = Math.min(count, a.length);
|
|
|
|
|
|
|
|
ArrayList<NavigatorEntry> result = new ArrayList<NavigatorEntry>();
|
|
|
|
|
|
|
|
Map.Entry<String, Integer> e;
|
|
|
|
|
|
|
|
int c;
|
|
|
|
|
|
|
|
for (int i = 0; i < rc; i++) {
|
|
|
|
|
|
|
|
e = a[i];
|
|
|
|
|
|
|
|
c = e.getValue().intValue();
|
|
|
|
|
|
|
|
if (c == 0) break;
|
|
|
|
|
|
|
|
result.add(new NavigatorEntry(e.getKey(), c));
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
return result;
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
public void addTopic(final String[] words) {
|
|
|
|
public void addTopic(final String[] words) {
|
|
|
|
String word;
|
|
|
|
String word;
|
|
|
|
for (int i = 0; i < words.length; i++) {
|
|
|
|
for (int i = 0; i < words.length; i++) {
|
|
|
|
word = words[i].toLowerCase();
|
|
|
|
word = words[i].toLowerCase();
|
|
|
|
Integer c;
|
|
|
|
|
|
|
|
if (word.length() > 2 &&
|
|
|
|
if (word.length() > 2 &&
|
|
|
|
"http_html_php_ftp_www_com_org_net_gov_edu_index_home_page_for_usage_the_and_".indexOf(word) < 0 &&
|
|
|
|
"http_html_php_ftp_www_com_org_net_gov_edu_index_home_page_for_usage_the_and_".indexOf(word) < 0 &&
|
|
|
|
!query.queryHashes.contains(Word.word2hash(word)) &&
|
|
|
|
!query.queryHashes.contains(Word.word2hash(word)) &&
|
|
|
|
word.matches("[a-z]+") &&
|
|
|
|
word.matches("[a-z]+") &&
|
|
|
|
!Switchboard.badwords.contains(word) &&
|
|
|
|
!Switchboard.badwords.contains(word) &&
|
|
|
|
!Switchboard.stopwords.contains(word)) {
|
|
|
|
!Switchboard.stopwords.contains(word)) {
|
|
|
|
c = ref.get(word);
|
|
|
|
ref.inc(word, word);
|
|
|
|
if (c == null) ref.put(word, 1); else ref.put(word, c.intValue() + 1);
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
@ -662,22 +614,12 @@ public final class RankingProcess extends Thread {
|
|
|
|
addTopic(descrcomps);
|
|
|
|
addTopic(descrcomps);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
public ArrayList<NavigatorEntry> getAuthorNavigator(final int count) {
|
|
|
|
public List<Navigator.Item> getAuthorNavigator(final int count) {
|
|
|
|
// create a list of words that had been computed by statistics over all
|
|
|
|
// create a list of words that had been computed by statistics over all
|
|
|
|
// words that appeared in the url or the description of all urls
|
|
|
|
// words that appeared in the url or the description of all urls
|
|
|
|
if (!this.query.navigators.equals("all") && this.query.navigators.indexOf("authors") < 0) return new ArrayList<NavigatorEntry>(0);
|
|
|
|
if (!this.query.navigators.equals("all") && this.query.navigators.indexOf("authors") < 0) return new ArrayList<Navigator.Item>(0);
|
|
|
|
|
|
|
|
|
|
|
|
AuthorInfo[] a = this.authorNavigator.values().toArray(new AuthorInfo[this.authorNavigator.size()]);
|
|
|
|
return this.authorNavigator.entries(count);
|
|
|
|
Arrays.sort(a, aicomp);
|
|
|
|
|
|
|
|
int rc = Math.min(count, a.length);
|
|
|
|
|
|
|
|
ArrayList<NavigatorEntry> result = new ArrayList<NavigatorEntry>();
|
|
|
|
|
|
|
|
AuthorInfo e;
|
|
|
|
|
|
|
|
for (int i = 0; i < rc; i++) {
|
|
|
|
|
|
|
|
e = a[i];
|
|
|
|
|
|
|
|
//System.out.println("*** DEBUG Author = " + e.author + ", count = " + e.count);
|
|
|
|
|
|
|
|
result.add(new NavigatorEntry(e.author, e.count));
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
return result;
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
public static void loadYBR(final File rankingPath, final int count) {
|
|
|
|
public static void loadYBR(final File rankingPath, final int count) {
|
|
|
|
@ -733,12 +675,3 @@ public final class RankingProcess extends Thread {
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
|
|
|
|
Thread= Thread-937 id=4224 BLOCKED
|
|
|
|
|
|
|
|
Thread= Thread-919 id=4206 BLOCKED
|
|
|
|
|
|
|
|
Thread= Thread-936 id=4223 BLOCKED
|
|
|
|
|
|
|
|
at net.yacy.kelondro.util.SortStack.pop(SortStack.java:118)
|
|
|
|
|
|
|
|
at de.anomic.search.RankingProcess.takeRWI(RankingProcess.java:310)
|
|
|
|
|
|
|
|
at de.anomic.search.RankingProcess.takeURL(RankingProcess.java:371)
|
|
|
|
|
|
|
|
at de.anomic.search.ResultFetcher$Worker.run(ResultFetcher.java:161)
|
|
|
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
orbiter
15 years ago