- Add map2/lift2 for all monad transformers
- Add Tuple2 and Tuple3 extensions
- Add non-generic operator for Validation, mainly intended to be used for applicative validation in Fable
- Fix: issue with generic intercalate function
- Fix: traverse for seq of asyncs
- Fix: issue with equality for DLists in Fable
- Add Nullable module and map and bind overloads for Nullable
- Add <= and >= Applicative Math operators
- Fix: issue with Fable consumption of the library
- Bitraversable abstraction
- Fix: compatibility issue with 1.0 in a separate branch (from which it will be released)
- Generic lift2 function made extensible and usable from F#5 preview's applicative CEs
- Polymorphic itemX and mapItemX function working in Fable
- More Traverse/Sequence overloads for extensions
- Add Dictionary/Lazy extensions and some additionals for ResizeArray
- Convert NonEmptyList builder empty list error in a compile-time error
- ZipList as Alternative
- ZipList without Equality
- Conversion functions for NonEmptyList, replacing Unchecked module from previous RC
- Fix: zero and empty for DList
- Fix: defaults for zero function
- Fix: ofSeq/ofList for IEnumerables
- Rename LeftZero for Traversable/Alternative, fixed some issues and add some instances
- Retarget Fable compilation to Extensions, some types from Data and abstractions Comonad, Invariant and Bind
- Lens new functions: choosed and non
- Fix: _item (from Lens)
- Generic choice function made extensible and already working with semigroups
- More operations on NonEmptyList and nel builder
- Added missing operations for Computation Expressions to some types
- Fix: signature for curry, uncurry and State.modify
- Fix: traverse operation when derived from sequence operation
- Short-circuit mechanism for Traversable and Alternatives
- More extension functions: Result.bindError, Choice.bindChoice2Of2 and Array.apply
- Fix and rename optional function to opt
- Rename liftA2 to lift2
- More ZipFunctor instances and better Unzip internals
- Some tweaks to Free (internals)
- Add functions gets and modify for stateful computations
- Better type inference for lift
- Some functions deprecated in Validation and Extensions
- Fix: swap type parameteres of Bifunctor and Bifoldable for Choice / Result
- Default Monoid for bool (xor)
- Some minor bug fixes
- Better signatures and xml descriptions
- Initial Fable support for Extensions
- Add generic bind, try/findIndex and try/findSliceIndex functions
- Traverse and TraverseIndexed for Map<_,_>
- Lens: fix foldOf and add maximumOf/minimumOf
- Add intersect functions for Map/Dictionaries
- Add polyvariadic memoizationN, curryN/uncurryN functions
- Add polyvariadic parsing functions (scanf family)
- Add Dict.containsKey, IReadOnlyDictionary.containsKey
- More lens for Map and Set
- Extend String and Task modules
- Task as ZipFunctor and Applicative
- Improve performace for union on dictionaries and maps
- Add unary negation operator for applicative maths
- Fix: add missing CE members to Monad Transformers
- Fix: infinite seq of asyncs can now be traversed
- Fix: generic sum function works with any monoid
- Fix 'use' for strict builders
- Add Invariant Abstraction
- Some convenient conversion functions between Option and Result
- OfSeq for IReadOnlyDictionary
- OfList for all same instances as OfSeq
- Add some ReadOnly Collections related functions
- Fix some type inference problems
- More Xml docs and type annotations
- Lens with less constraints (speed up compile time)
- More generic Foldable functions
- More extensions and abstractions with IReadOnlyDictionary
- Option as ZipFunctor
- More Async extensions
- More clean signatures supported
- Removed tuple size limitations
- Add generic functions 'maximum' and 'minimum' for Foldable
- Fix: generic 'scan' signature
- Fix: bug in '<|>' for Choice
- Optimized Foldable/Collection generic functions by adding specific overloads
- Async as ZipFunctor
- More Async extensions
- Fix culture neutrality of TryParse functions
- More integration with ReadOnly Collections
- More extensions for Map, IDictionary and ReadOnly collections
- Map and Dictionary as ZipFunctor
- Result and Choice as Semigroup and Alt
- Exceptions and AggregateExceptions as Semigroup
- Public 1.0.0 release that includes a better architected API and numerous bug fixes
- Re-introduce Choice based monad transformers with ChoiceT
- Generic split function is now bigeneric
- Bug fix in OptionT execution
- A hoist function was added to some Monad Transformers
- Bug Fixes
- Accumulative Validations
- DList<'T> implementation changed
- C# Extension Methods removed
-
Require operators instead of named methods:
- (>>=) instead of Bind
- (=>>) instead of Extend
- (<|>) instead of Append
-
Custom operations:
- sortBy renamed to orderBy
- first and nth removed
- top operator added
- Unify Second with Map
- Defaults improved
- Identity<'T> is now in FSharpPlus.Data
- More flexibility in Computation Expressions
- Dictionary extensions
- Bug fixes
- Wrappers compiled as structs
- New tryItem operation for Indexable types
- Better default methods
- Bug fixes
- Rename ErrorT to ResultT
- Removed Haskell Compatibility
- IEnumerator functions
- Applicative Math: new syntax, more operators
- Function sequenceA renamed to sequence
- More types: DList, Multiplication monoid
- Changes in either function (args swapped)
- Namespaces renamed
- Lens functions renamed
- Removed function toString
- Some Delayed Monad Transformers
- Bug fixes
- New execution model for Computation Expressions
- Use F# new Result Type to model failures
- Functions minValue and maxValue are now generic constants
- Many String and other extensions
- Targeting Netstandard 2.0
- (0, +) as default monoid for numerics
-
Rename:
- Empty, Append and Concat to MEmpty, MAppend and MConcat
- MZero and MPlus to Empty and Append.
- mempty and mappend to zero and plus
- mconcat and mfold to Seq.sum and sum
- Generic constants (empty, zero, app, ...)
- Compose for applicative functors
- Unify RMap with Map and LMap with Contramap
- Functions create, singleton and traverse (Traversable) for NonEmptyList
- Reader<'R, 'T> and Writer<'Monad<'T * 'Monoid>> as Comonads
- IDictionary<'Key,'Value> as Functor and Monoid
- Standard signature for Join
- Enhancements in Traversable, including bug fixed and more infinite seqs cases
- Adapt code to be usable (no regressions) and able to be compiled from F# 4.1
- Extensive documentation, including tutorials and a classepedia (abstractions) diagram (WIP)
- Builders support MonadPlus and FX computations
- Bin path for sample files corrected
- Added Delay implementation for Cont
- Added Invokables for builders: TryWith, TryFinally and Using
- Fix overloads for Task
- Improve functor's map resolution in presence of interfaces
- Generalize Unzip to any functor
- Initial release using ProjectScaffold