AbstractSieve.| Interface | Description |
|---|---|
| AbstractSieve.NewFlowReceiver<K> |
An object that can receive a new flow of hash/key pairs and that
acts as a listener for the
AbstractSieve. |
| AbstractSieve.UpdateStrategy<K,V> |
An update strategy: it determines how a stored value should be updated in the presence of duplicate keys.
|
| ByteSerializerDeserializer<V> |
A light for of serialization based on
InputStream/OutputStream (and
FastBufferedInputStream for fast skipping). |
| Class | Description |
|---|---|
| AbstractSieve<K,V> |
A sort of a map, that handles (key,value) pairs of generic type.
|
| AbstractSieve.DefaultUpdateStrategy<K,V> | |
| AbstractSieve.DiskNewFlow<T> |
A basic, on-disk
AbstractSieve.NewFlowReceiver. |
| AbstractSieve.SieveEntry<K,V> |
A (key,value) pair.
|
| ByteArrayListByteSerializerDeserializer |
A
ByteSerializerDeserializer based on ByteArrayList. |
| CharSequenceByteSerializerDeserializer |
An example of
ByteSerializerDeserializer. |
| IdentitySieve<K,V> |
A sieve that simply (and immediately) copies enqueued keys to the new flow receiver.
|
| MercatorSieve<K,V> |
A concrete implementation of an
AbstractSieve that stores hash
data on disk, much in the same way as it was suggested by Allan Heydon and Marc Najork in
“Mercator: A Scalable, Extensible Web Crawler”,
World Wide Web, (2)4:219−229, 1999, Springer. |