forked from I2P_Developers/i2p.i2p
note that these will be moved to router.jar at some point
This commit is contained in:
@ -17,6 +17,8 @@ import org.xlattice.crypto.filters.BloomSHA1;
|
||||
* this may be refactored to allow tighter control of the size necessary for the
|
||||
* contained bloom filters.
|
||||
*
|
||||
* Deprecated for use outside of the router; to be moved to router.jar.
|
||||
*
|
||||
* See main() for an analysis of false positive rate.
|
||||
* See BloomFilterIVValidator for instantiation parameters.
|
||||
* See DecayingHashSet for a smaller and simpler version.
|
||||
|
@ -55,6 +55,8 @@ import net.i2p.data.DataHelper;
|
||||
*
|
||||
* This performs about twice as fast as DBF in the test below.
|
||||
*
|
||||
* Deprecated for use outside of the router; to be moved to router.jar.
|
||||
*
|
||||
* @author zzz
|
||||
*/
|
||||
public class DecayingHashSet extends DecayingBloomFilter {
|
||||
|
@ -37,6 +37,7 @@ import java.util.concurrent.LinkedBlockingQueue;
|
||||
*
|
||||
* Note that this is used only by DecayingBloomFilter, which uses only
|
||||
* the unsynchronized locked_foo() methods.
|
||||
* Deprecated for use outside of the router; to be moved to router.jar.
|
||||
*
|
||||
* As of 0.8.11, the locked_foo() methods are thread-safe, in that they work,
|
||||
* but there is a minor risk of false-negatives if two threads are
|
||||
|
Reference in New Issue
Block a user