1

first release

0.2.0

Add support for LRUCache.

LruCache Least Recently Used (LRU) is a common caching strategy.
It defines the policy to evict elements from the cache to make room for new elements when the cache is full, meaning it discards the least recently used items first.

0.1.3

Refactor priority queue, and improve linked list.

0.1.2

Introduce LinkedList type

0.1.1

Make more clear how to use

SortedStructList

in ASC/DESC mode

0.1.0

Breaking change is how we handle sorted list now. We needed to enable sort direction, so we need to refactor sorted list implementation that was based on slices to be now structs. It's done now for

SimpleSortedList

and

SortedList

Both structs have ToList[T] method which returns elements in 0(1) time it should be used for iteration over collection.

• More method will be added to this structs in next version to align them with same interface.

0.0.5

Implement AddOrReplace on List struct.
AddOrReplace element in the list under some condition. Applies only to first element found under this condition.

• Try to find element that satisfied condition in function provided as argument to this function call
• If found replace with new provided element.

0.0.4

• Add RemoveAt to SimpleSortedList
• Utilise RemoveAt function
• Insert method of List type accept now one or more params

0.0.3

• Bug fix for RemoveAt
• Adding new functions on almost all collection Types.
• Migrate Stack and Queue to be slice based.

0.0.2

Minor changes, move Stack and Queue implementation to implemented as extension on slice, not as structs.