v1.4.0

• Implement func (c *Cache) OrderedRange(f func(key, value interface{}) bool)
• Use insertion order as default ordering
• Make LFU ordering optional through WithLFU builder option
• Standardize the list implementation

v1.3.0

• Implement func (c *Cache) Set(key, value interface{}, ttl time.Duration)
• Use safe delete when expiring records to guard against concurrent Evict/Fetch "flap". The LFU eviction is kept flappy by reasoning that it's not likely that the least frequently used or eldest key is concurrently evicted and fetched again in separate steps.

v.1.2.0

• Increase safety, make invariants stricter.
• Clean up the ring implementation.
• Prevent Evict/Fetch "flap" when Fetch fails with an error and concurrently the same key is evicted and set again.
  Normally the failed fetch will try to remove the stored record after LoadOrStore succeeds and FetchCallback fails but will not if another record had been set under the same key.
• Add tests for consistency under concurrent load.

v1.1.0

• Make a slow FetchCallback not block Range and background loop by skipping a record which might block

v1.0.1

• Fixes a race condition where not all records were evicted after closing the cache

v1.0.0

• Ran go mod tidy to remove debugging packages.
• Bump major version to account for earlier API changes.

v0.1.4

• Prevent ring from overflowing.

v0.1.3

• Implement Range method

v0.1.2

• Use an LFU ring where inserts and deletes are sync, promotes are async
• Pool records, reuse ring elements and waitgroups
• Hopefully fix race conditions and deadlocks

evcache/v.0.1.1

Removes unused ttl field from record struct
Breaks out record expiry into a separate method