|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
Interface Summary | |
---|---|
CloseableIterator<T> | |
ICacheExpungeHook<K,V> | Created by IntelliJ IDEA. |
ICachetable<K,V> |
Class Summary | |
---|---|
AbstractStatsDeque | |
BitSetSerializer | |
BloomCalculations | The following calculations are taken from: http://www.cs.wisc.edu/~cao/papers/summary-cache/node8.html "Bloom Filters - the math" This class's static methods are meant to facilitate the use of the Bloom Filter class by helping to choose correct values of 'bits per element' and 'number of hash functions, k'. |
BloomCalculations.BloomSpecification | A wrapper class that holds two key parameters for a Bloom Filter: the number of hash functions used, and the number of buckets per element used. |
BloomFilter | |
BoundedStatsDeque | not threadsafe. |
Cachetable<K,V> | |
DestructivePQIterator<T> | |
FBUtilities | |
FileUtils | |
FileUtils.Deleter | |
FileUtils.FileComparator | |
Filter | |
GuidGenerator | |
HashingSchemes | Created by IntelliJ IDEA. |
Log4jLogger | Log4j configurations may change while the application is running, potentially invalidating a logger's appender(s). |
LogUtil | |
MerkleTree | A MerkleTree implemented as a binary tree. |
MerkleTree.RowHash | Hash value representing a row, to be used to pass hashes to the MerkleTree. |
MerkleTree.TreeRange | The public interface to a range in the tree. |
MerkleTree.TreeRangeIterator | Performs a depth-first, inorder traversal of invalid nodes under the given root and intersecting the given range. |
MurmurHash | This is a very fast, non-cryptographic hash suitable for general hash-based lookup. |
Pair<T1,T2> | |
ReducingIterator<T1,T2> | reduces equal values from the source iterator to a single (optionally transformed) instance. |
SafeMessageDigest | |
SimpleCondition | |
TimedStatsDeque | threadsafe. |
XMLUtils |
|
||||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |