mirror of
https://github.com/yacy/yacy_search_server.git
synced 2024-09-19 00:01:41 +02:00
0d363a94d7
this makes YaCy search results VERY fast for all verify=false search cases and it enhances the search speed also for all other snippet-fetch cases. With this change my peer performed 100 Queries Per Second (!!!) while doing 10 queries simultanously (!!!) in an intranet index of 20000 URLs on my 16-core Mac Check this yourself by doing: cd bin ./searchtestmulti.sh after finishing the run, divide 1000 by the given time per query (which is the qps for one thread) and then multiply again by 10 (because 10 search threads has been started) git-svn-id: https://svn.berlios.de/svnroot/repos/yacy/trunk@7231 6c8d7289-2bf4-0310-a012-ef5d649a1542
56 lines
1.6 KiB
Java
56 lines
1.6 KiB
Java
/**
|
|
* Phrase.java
|
|
* Copyright 2008 by Michael Peter Christen, mc@yacy.net, Frankfurt am Main, Germany
|
|
* First released 26.03.2008 at http://yacy.net
|
|
*
|
|
* This library is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
*
|
|
* This library 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
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
* along with this program in the file lgpl21.txt
|
|
* If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
package net.yacy.document;
|
|
|
|
import java.util.HashSet;
|
|
|
|
public class Phrase {
|
|
// object carries statistics for words and sentences
|
|
|
|
private int count; // number of occurrences
|
|
private final int handle; // unique handle, is initialized with sentence counter
|
|
private final HashSet<Integer> hash; //
|
|
|
|
public Phrase(final int handle) {
|
|
this.count = 1;
|
|
this.handle = handle;
|
|
this.hash = new HashSet<Integer>();
|
|
}
|
|
|
|
public int handle() {
|
|
return this.handle;
|
|
}
|
|
|
|
public int occurrences() {
|
|
return count;
|
|
}
|
|
|
|
public void inc() {
|
|
count++;
|
|
}
|
|
|
|
public void check(final int i) {
|
|
hash.add(LargeNumberCache.valueOf(i));
|
|
}
|
|
|
|
|
|
}
|