Skip to content

Latest commit

 

History

History
142 lines (109 loc) · 3.79 KB

changes.md

File metadata and controls

142 lines (109 loc) · 3.79 KB

change log

5.0.2

  • readme update

5.0.1

  • bounded-nat → >= 35.0.0
  • typesafe-array → >= 34.0.0

5.0.0

  • KeysSet
    • IdentitySet add
    • switch from ( keys, keysToKey ) to key keysToKey keys where the key keysToKey isn't necessary if there's just one key
  • Keys
    • KeysWithFocus, KeysBeingBuiltWithFocus add
    • key add
    • switch from ( keys, keysToKey ) to key keysToKey keys where the key keysToKey isn't necessary if there's just one key

4.0.2

  • typesafe-array upgrade to >= 33.0.0
  • bounded-nat upgrade to >= 34.0.0

4.0.1

  • typesafe-array upgrade to >= 32.0.0

4.0.0

  • KeysSet
    • fold remove
    • foldFrom, foldFromOne aren't order-independent anymore. Instead they now take a key and direction
    • foldUntilCompleteFrom, foldUntilCompleteFromOne add
    • fold2s use AndOr
    • fold2FromOne add
    • mapTry name → fillsMap
    • toKeys return keys as Keys.Identity
  • Keys
    • each key stores an access function instead of an index
    • keyIndex → keyElement
  • Char.Order
    • alphabetically name → aToZ
  • Int.Order, Float.Order
    • increasing → up, decreasing → down
  • typesafe-array upgrade to >= 31.0.0

3.0.4

  • readme prior art expand

3.0.3

  • miniBill/elm-generic-dict disadvantages correct

3.0.2

  • linear-direction → >= 11.0.0
  • typesafe-array → >= 30.0.0

3.0.1

  • readme goodies add

3.0.0

  • KeySet, KeysSet merge
    • 👍 KeysSet functionality while still running in log n
    • 👎 more complex API
    • elementRemove name → remove
    • only name → one
    • mapTry type result keep possiblyOrNever
  • .Order modules move from linear-direction
    • module Maybe.Order remove
    • module Case move into Char.Linear
    • on add
    • integrate tag into Order, so that simple sets don't require opaque tags, for example
    intKeys : Keys.Identity Int Int.Order.Increasing
intKeys =
    Keys.identity Int.Order.increasing
      - 👎 chaining with `onTie` is a bit more verbose than `onTieNext [ ... ]`
  - 👍 chaining with `onTie` is more obvious and easier to read than `onTieNext [ ... ]`

2.1.1

  • readme KeySet example ordering correct

2.1.0

  • KeySet add

2.0.0

  • indirection ElementsWithUniquenessPromises remove
  • when remove
    • in favor of mapTry
  • set |> isUnique element → element |> allDifferentFrom set
  • equal a b → a |> isEqualTo b
  • at door key → element ( door, key )
  • update door key → elementAlter ( door, key )
  • updateAll name → alter
  • remove name → elementRemove
  • insertAll name → insertList
  • mapTry add
  • lue-bird/elm-typed-value dependency remove
    • in favor of opaque type immune to internal changes
  • performance improve

1.0.0

  • removed KeysDict.toDict

  • removed KeysDict.serialize

  • removed KeysDict.Uniqueness.violated

  • changed KeysDict.enterBy { door, key } to at door key

  • changed KeysDict.remove { door, key } to remove door key

  • renamed KeysDict to KeysSet

  • moved KeysDict.Uniqueness.Uniqueness to KeysSet.Uniqueness

  • moved KeysDict.Uniqueness.unique to KeysSet.unique

  • renamed KeysDict.foldHouses to fold

  • renamed KeysDict.countHouses to size

  • renamed KeysDict.houses to toList

  • renamed KeysDict.enterableBy to promising

  • added KeysSet.insertAll

  • added KeysSet.update

  • added KeysSet.updateAll

  • added KeysSet.where

  • added KeysSet.isUnique

  • added KeysSet.all

  • added KeysSet.any

  • added KeysSet.isEmpty

before

indique/elm-keysdict → lue-bird/elm-keysset