- Gitpod support by @cartermp in #172
- Fix a typo in a comment by @viebel in #190
- Testing on Net6 by @sergey-tihon in #193
- Add
PersistentVector.mapi
by @njlr in #186 - RoseTree. Fix a broken link in the comments. by @ScottHutchinson in #195
- Fantomas5 formatting by @sergey-tihon in #194
- Make the NuGet package consumable from Fable by @njlr in #187
- Add release NuGet publish from CI by @gdziadkiewicz in #199
- Fix choice2s #184. Thanks @sideeffffect
- Deque.Tail performance tweaks
- Fast path for single back element. Avoid traversing list for length multiple times. Use Unchecked.defaultOf<_> rather than an actual element. Thanks @simendsjo
- Expose PersistentVector.rangedIterator. Thanks @simendsjo
- Seq extensions: add tryHeadTail #176. Thanks @knocte
- some helper functions #92. Thanks @sideeffffect
- Enable PersistentVector in Fable #182. Thanks @njlr
- Dependencies update
- Build and test with .NET 5 & Node 14
- RandomAccessLists zip, reduce, map2
- doc projects netcoreapp3.1 build, thanks Grzegorz Dziadkiewicz
- Fix FSharp.Core assembly reference version
- Fix FSharp.Core dependency version
- target net45 and netstandard2.0, thanks Grzegorz Dziadkiewicz
- BREAKING CHANGE: only netstandard2.0 supported
- PersistentHashMap implements Count (issues/12)
- add compareWith and areEqual to LazyList (issues/114) thanks teo-tsirpanis
- fix experimental RoseTree equality (issues/114) thanks teo-tsirpanis
- fix Nop thread comparison in PersistentHashMap (issues/66)
- make RandomAccessList serializable (issue 127) thanks teo-tsirpanis
- Implemented CHAMP algorithm for a persistent hash map, thanks bsomes
- Implement IReadOnlyList and IReadOnlyCollection for the RandomAccessList (issue 130) thanks teo-tsirpanis
- LazyListbased on the BCL's Lazy type, thanks teo-tsirpanis
- pairwise DList, thanks Brendan Fahy
- target net45 and netstandard2.0 (beta1 incorrectly targetted net461)
- Microsoft.NET.Sdk projects
- target net45 and netstandard2.0
- BREAKING CHANGE: RequireQualifiedAccess
- BREAKING CHANGE: type RealTimeQueue under Experimental namespace
- BREAKING CHANGE: type BootstrappedQueue under Experimental namespace
- BREAKING CHANGE: type ListZipper under Experimental namespace
- BREAKING CHANGE: types BinaryTree, TreeDirection, BinaryTreeZipper under Experimental namespace
- BREAKING CHANGE: type ImplicitQueue under Experimental namespace
- BREAKING CHANGE: type BinaryRandomAccessList under Experimental namespace
- BREAKING CHANGE: type Digit for BinaryRandomAccessList renamed TreeBRALDigit
- PERFORMANCE: NonEmptyList Collect had poor performance - #75
- New tagged structures - #69
- Use FSharp.Core 4.0
- Couple of new helper functions - #64 #63
- Improved RandomAccessList API with some functions from PersistentVector - #54
- Faster NonEmptyList implementation - #62
- Allow 4.0 FSharp.Core
- Distinct and DistinctBy functions for ResizeArray - #56
- Add zip to NonEmptyList - #46
- Fixed enumerating empty RandomAccessList - #45
- ResizeArray.collect made to take seq as an input - #41
- Made conflict resolution explicit in variable names - #39
- LazyList.fold - #34
- New SkewBinomialHeap - #36
- New Block resize array functions - #37
- Added profile 259 and fixed profile 47 folder name - #26
- Bump version due to broken logo link - #21
- Bump version due to broken package meta data - #21
- Add Profile47
- Tail recursive implementation of Heap.Tail - #17
- Fixing nuget package
- Initial release from new location; previous contributor history lost