v1.5.1

update performance test times to avoid accidental factors (#34)

v1.5.0

Improve performances of v1 (#32)

Try to improve the performance of the ordered map without generics. Apply the same approach already used for V2 in commit b46f20e44cbd130f70390d9ae9f253d64f441dc4.

v2.2.0

Performance improvements (#30)

Notes:
- avoid allocating an Element when iterating using (*Element).Next() and (*Element).Prev()
- avoid allocating an Element when calling (*OrderedMap).Front() and (*OrderedMap).Back()
- avoid computing the length of the doubly linked list since it is not strictly needed

Advantages:
- no need of (*Element).list field: save both memory and assignations
- avoid comparisons in (*Element).Next() and (*Element).Prev(): save time
- allow implicit initialization: style
- avoid comparisons in (*list).Front() and (*list).Back(): save time
- keep almost the same execution time for (*list).Remove(), (*list).PushFront() and (*list).PushBack()

v2.1.1

ci: Test on pull request (#31)

We also need to run tests on external pull requests.

v2.1.0

Require comparable interface instead of constraints.Ordered for map k…

…eys (#29)

v2.0.1

Adding Github Actions (#27)

This replaces the flakey Travis CI for testing.

v2.0.0

Added support for generics (#26)

Generics (in Go 1.18) are an ideal case for this library. It is provided
through a new version v2. If you need to support Go 1.17 or below you can
continue to use v1.

v1.4.0

Adds Copy() function (#19)

v1.3.0

Implement GetElement method (#17)

GetElement returns the element for a key. If the key does not exist, the
pointer will be nil.

Co-authored-by: Jyoti Shete <jyoti.shete@coursehero.com>

v1.2.2

Create LICENSE (#13)