| org.archive.util.fingerprint.LongFPSet
All known Subclasses: org.archive.util.fingerprint.MemLongFPSet, org.archive.util.fingerprint.ArrayLongFPCache, org.archive.util.AbstractLongFPSet,
| LongFPSet | | public interface LongFPSet (Code) | | Set for holding primitive long fingerprints.
author:
Gordon Mohr |
| Method Summary | |
| boolean | add(long l)
Add a fingerprint to the set. | | boolean | contains(long l)
Does this set contain a given fingerprint. | | long | count()
| | boolean | quickContains(long fp)
Do a contains() check that doesn't require laggy
activity (eg disk IO). | | boolean | remove(long l)
|
| add | | boolean add(long l)(Code) | | Add a fingerprint to the set. Note that subclasses can implement
different policies on how to add - some might grow the available space,
others might implement some type of LRU caching.
In particular, you cannot on the
LongFPSet.count() method returning
1 greater than before the addition.
Parameters:
l - the fingerprint to add true if set has changed with this addition |
| contains | | boolean contains(long l)(Code) | | Does this set contain a given fingerprint.
Parameters:
l - the fingerprint to check for true if the fingerprint is in the set |
| count | | long count()(Code) | | get the number of elements in the Set
the number of elements in the Set |
| quickContains | | boolean quickContains(long fp)(Code) | | Do a contains() check that doesn't require laggy
activity (eg disk IO). If this returns true,
fp is definitely contained; if this returns
false, fp *MAY* still be contained -- must use
full-cost contains() to be sure.
Parameters:
fp - the fingerprint to check for true if contains the fingerprint |
| remove | | boolean remove(long l)(Code) | | Remove a fingerprint from the set, if it is there
Parameters:
l - the fingerprint to remove true if we removed the fingerprint |
|
|