boxtec
/
yacy_search_server
mirror of https://github.com/yacy/yacy_search_server
4
1
Fork 0
Code Issues Projects Releases Wiki Activity

fix for http://forum.yacy-websuche.de/viewtopic.php?p=15555#p15555

Browse Source 
git-svn-id: https://svn.berlios.de/svnroot/repos/yacy/trunk@6024 6c8d7289-2bf4-0310-a012-ef5d649a1542
pull/1/head
orbiter 16 years ago
parent 42ae40b9f6
commit c062385552
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File

4
source/de/anomic/yacy/dht/VerticalWordPartitionScheme.java
Unescape View File

@ -63,8 +63,8 @@ public class VerticalWordPartitionScheme implements PartitionScheme {
assert partitionExponent > 0; assert partitionExponent > 0;
long partitionMask = (1L << (Long.SIZE - 1 - partitionExponent)) - 1L; long partitionMask = (1L << (Long.SIZE - 1 - partitionExponent)) - 1L;
// compute the position using a specific fragment of the word hash and the url hash: // compute the position using a specific fragment of the word hash and the url hash:
// - from the word hash take the (63 - <partitionExponent>) lower bits // - from the word hash take the 63 - <partitionExponent> lower bits
// - from the url hash take the (63 - <partitionExponent>) higher bits // - from the url hash take the <partitionExponent> higher bits
// in case that the partitionExpoent is 1, only one bit is taken from the urlHash, // in case that the partitionExpoent is 1, only one bit is taken from the urlHash,
// which means that the partition is in two parts. // which means that the partition is in two parts.
// With partitionExponent = 2 it is divided in four parts and so on. // With partitionExponent = 2 it is divided in four parts and so on.

Write Preview
Loading…
Cancel
Save