Implementation of the
CascadingCache interface backed by a
java.util.LinkedHashMap configured to
evict the least recently used key.
That is, if duplicate keys are clustered near each other in the incoming tuple stream, this cache will provide the
most benefit as keys that begin to occur less frequently or not at all will be evicted as the key capacity is reached.
If the keys are very random, if not uniformly distributed in the stream, consider using the
cascading.util.cache.DirectMappedCache to reduce the amount of hash and equality comparisons.
This implementation is used by default by
cascading.pipe.assembly.Unique and
cascading.pipe.assembly.AggregateBy and their subclasses.