All Versions
21
Latest Version
Avg Release Cycle
-
Latest Release
-

Changelog History
Page 1

  • v0.3.1 Changes

    • Define Set interface for data structures with member method
    • ๐Ÿšš Rewrite zoom function with right adjunction and move it to Inventory module
    • ๐Ÿšš Move Adjoint instance for (:*:) and (->) to Paradigm.Primary.Functor module
    • โœ‚ Remove Schematic module and move Schematic type family to Interpreted module
    • ๐Ÿ”„ Change arity of Schematic type family
    • โœ‚ Remove lay method of Monadic type class, use lift instead
    • โœ‚ Remove flick method of Comonadic type class, use lower instead
    • ๐Ÿ”„ Change lift constraint: from Covariant to Traversable
  • v0.3.0 Changes

    • ๐Ÿ“‡ Rename Root datatype to Location with Head (stack) and Root (tree) constructors
    • Define represent as lens in Representable containers
    • Define Equivalence datatype and define Contravariant instance for it
    • Define swop for Wye (useful if you want to invert binary tree with hoist swap)
    • โž• Add experimental Monotonic typeclass
    • Implement delete method for Stack
    • Define Comprehension wrapper for data structures that can behave like list comprehensions
    • Define experimental Insertable typeclass
    • Define Day convolution datatype in Transformer module
    • Define experimental methods: <*+>, <**+>, <***+>
    • ๐Ÿ“‡ Rename Bindable method >>=$ to <>>=
    • ๐Ÿšš Move Comprehension wrapper from Construction to Structure.Ability module
  • v0.2.9 Changes

    • Define Zipper type family to walk datastructures with context
    • Define Tap datatype for context dependent values
    • Define type synonyms for TU, UT, TUT and UTU joint schemes
    • ๐Ÿšš Move Schemes module to Paradigm submodule
    • ๐Ÿšš Move $ definition from Divariant to Category
    • ๐Ÿ†“ Define generalized point free combinators in Covariant module
    • ๐Ÿ“‡ Rename Joint module To Effect
    • Define left and right zig, zig-zig and zig-zag Splay rotations for Binary tree
    • Define experimental methods in Extendable class - $=>> and <<=$
    • Define Rotatable typeclass to rotate trees
    • ๐Ÿ“‡ Rename sub method of Substructure typeclass to substructure
    • Define sub method which doesn't involve Tagged
    • ๐Ÿ”„ Change Focusable typeclass - now it's possible to point not only top/root
  • v0.2.8 Changes

    • ๐Ÿ†“ Define Outline free applicative transformer
    • Define Delta datatype
    • Define Wedge datatype
    • ๐Ÿ“‡ Rename Variation to These
    • Define two experimental methods in Bindable class - $>>= and >>=$
    • Define here and there methods from Wedge to Maybe
    • ๐Ÿšš Move Boolean definition to its own module
    • ๐Ÿšš Move Ordering definition to its own module
    • ๐Ÿ“‡ Rename Variation submodule to Ability and create umbrella-module
    • Define Focusable typeclass for getting root and creating singleton
    • Replace top method of Stack structure with Focusable instance
    • โž• Add Covariant constraint on natural transformation in Hoistable typeclass
  • v0.2.7 Changes

    • Replace Lan and Ran with Kan data family
    • ๐Ÿ“‡ Rename Free to Instruction and its constructors: Pure to Enter and Impure to Instruct
    • Define Ring typeclass with Group superclass
    • Define Weighted type family and define instance for Graph
    • โž• Add Leap to Edges to indicate a connection with only the first vertex
    • โœ‚ Remove Graph structure and Weighted type family
    • Define Reverse type to run Traversable in reverse order with Backwards
    • ๐Ÿ“‡ Rename Twister to Construction (in contrast of Instruction)
    • Split Basis on Functor and Transformer modules in Primary
    • ๐Ÿ“‡ Rename untwist to deconstruct in Construction
    • Define Rose tree structure
    • Replace UT joint scheme with TU in data structures
    • ๐Ÿ”„ Change sub method of Substructure - it always returns Tagged value
    • ๐Ÿ“‡ Rename Construction constructor of Construction to Construct
  • v0.2.6 Changes

    • ๐Ÿ”„ Change order of arguments for TUT joint schema
    • Binary trees can be empty
    • Define left_sub_tree and right_sub_tree lenses of Binary tree
    • ๐Ÿ›  Fix insert function: Binary tree should not contain duplicate values
    • โœ‚ Remove Cartesian type class
    • ๐Ÿšš Move Nonempty module to Variation submodule
    • โœ‚ Remove Specific module
    • โž• Add functional dependency to Nonempty type family and distribute instances
    • Define left and right natural transformations from Wye to Maybe
    • Define experimental Substructure type class
    • Remove left_sub_tree and right_sub_tree lenses of Binary tree
    • Define this and that methods from Variation to Maybe
    • Define Backwards type to run Applicative actions in reverse order
  • v0.2.5 Changes

    • Define Semiring typeclass
    • Define Stream module and type
    • ๐Ÿšš Move Liftable and Lowerable modules from Functor to Transformer submodule
    • Define Hoistable module and typeclass
    • ๐Ÿ“‡ Rename TUV joint schema to TUT
    • Modify UTU joint schema internals
    • โœ‚ Remove && and || Boolean operators (use * and + instead)
    • Define precedence for * and +
    • ๐Ÿ”„ Change superclass of Group class - Quasiring instead of Monoid
    • ๐Ÿ“‡ Rename Jet's constructor to Jet (previously - :-)
    • ๐Ÿ“‡ Rename Group's method from inverse to invert
    • โœ‚ Remove not method of Boolean, (use invert instead)
    • โœ‚ Remove Injective and Has type families
    • ๐Ÿ”„ Change superclasseses for Liftable and Lowerable classes to provide a law
  • v0.2.4 Changes

    • โœ‚ Remove Pandora.Core.Transformation module and move ~> to Functor module
    • Define Adaptable instances for comonad transformer schemes
    • ๐Ÿ‘‰ Make position and access methods of Store adaptable
    • ๐Ÿ“‡ Rename unwrap method of Interpreted type class to run
    • Define Bivariant functor type class
    • Define zoom optical operator - apply lens within some part of State
    • ๐Ÿ‘‰ Make top method of Stack data structure a lens
    • ๐Ÿ‘‰ Make zoom method of Optics adaptable for bigger state
    • Define Traced for adaptable Environment comonad
    • Define cata, ana and hylo methods of Fix
    • Define Equipment datatype to use Comonad Product transformer
    • Define adaptable retrieve method of Equipment
    • ๐Ÿ–จ Extract Imprint from Environment module
  • v0.2.3 Changes

    • Define Category type class with identity and . methods
    • ๐Ÿ”„ Change >-> signature: a -> b to v a d and c -> d to v c d
    • Extract Schema from Transformer type class as Schematic type family
    • ๐Ÿ“‡ Rename Transformer type class to Monadic
    • Define Comonadic type class for comonad transformers
    • Define Transformer umbrella module and type family
    • ๐Ÿ“‡ Rename :< data constructor to Twister to not confuse it with comonad transformer type operator
    • ๐Ÿ‘‰ Use UT joint scheme for Stack and Graph data structures
    • โœ‚ Remove Variant type in favor of Covariant and Contravariant constraints in joint schemes
    • โž• Add Covariant constraint on schema parameter in Adaptable type class
    • ๐Ÿ“‡ Rename Storage type to Store
    • Define Interpreted, Schematic and Comonadic instances for Store type
  • v0.2.2 Changes

    • ๐Ÿ”„ Change types of lay and wrap methods of Transformer class
    • Define Adaptable type class for fitting effects in schemas
    • Define Failable and failure for adaptable Conclusion
    • Define Optional and nothing for adaptable Maybe
    • ๐Ÿ“‡ Rename Stateful to State, get to current, put to replace
    • Define Stateful adaptable constraint and adapt get, modify and put
    • ๐Ÿ“‡ Rename Environmental to Environment
    • ๐Ÿšš Make env adaptable effect and remove local
    • Define Accumulator effect and it's adaptable gather method
    • Define |-> (Coalgebra) and <-| (Algebra) type synonyms
    • โœ‚ Remove oblige in favor of Liftable instance of Continuation
    • โœ‚ Remove environmentally in favor of Interpreted instance for Environment
    • โœ‚ Remove statefully in favor of Interpreted instance for State