Least Frequently Used algorithm for cache eviction.
Note that this algorithm is not thread-safe.

This algorithm relies on maxNodes and minNodes to operate correctly.
Eviction takes place using Least Frequently Used algorithm. A node A
that is used less than a node B is evicted sooner.

The minNodes property defines a threshold for eviction. If minNodes = 100,
the LFUAlgorithm will not evict the cache to anything less than 100 elements
still left in cache. The maxNodes property defines the maximum number of nodes
the cache will accept before eviction. maxNodes = 0 means that this region is
unbounded. minNodes = 0 means that the eviction queue will attempt to bring
the cache of this region to 0 elements (evict all elements) whenever it is run.

This algorithm uses a sorted eviction queue. The eviction queue is sorted in
ascending order based on the number of times a node is visited. The more frequently
a node is visited, the less likely it will be evicted.