packages feed

haskey-btree 0.3.0.0 → 0.3.0.1

raw patch · 1 files changed

+3/−3 lines, 1 filesdep ~hashabledep ~textPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependency ranges changed: hashable, text

API changes (from Hackage documentation)

- Data.BTree.Primitives.Exception: instance GHC.Exception.Exception Data.BTree.Primitives.Exception.KeyTooLargeError
- Data.BTree.Primitives.Exception: instance GHC.Exception.Exception Data.BTree.Primitives.Exception.TreeAlgorithmError
- Data.BTree.Primitives.Index: instance (GHC.Classes.Eq node, GHC.Classes.Eq key) => GHC.Classes.Eq (Data.BTree.Primitives.Index.Index key node)
- Data.BTree.Primitives.Index: instance (GHC.Show.Show node, GHC.Show.Show key) => GHC.Show.Show (Data.BTree.Primitives.Index.Index key node)
- Data.BTree.Primitives.Index: instance (GHC.Show.Show val, GHC.Show.Show key) => GHC.Show.Show (Data.BTree.Primitives.Index.IndexCtx key val)
+ Data.BTree.Primitives.Exception: instance GHC.Exception.Type.Exception Data.BTree.Primitives.Exception.KeyTooLargeError
+ Data.BTree.Primitives.Exception: instance GHC.Exception.Type.Exception Data.BTree.Primitives.Exception.TreeAlgorithmError
+ Data.BTree.Primitives.Index: instance (GHC.Classes.Eq key, GHC.Classes.Eq node) => GHC.Classes.Eq (Data.BTree.Primitives.Index.Index key node)
+ Data.BTree.Primitives.Index: instance (GHC.Show.Show key, GHC.Show.Show node) => GHC.Show.Show (Data.BTree.Primitives.Index.Index key node)
+ Data.BTree.Primitives.Index: instance (GHC.Show.Show key, GHC.Show.Show val) => GHC.Show.Show (Data.BTree.Primitives.Index.IndexCtx key val)
- Data.BTree.Alloc.Class: allocOverflow :: (AllocM m, (Value val)) => val -> m OverflowId
+ Data.BTree.Alloc.Class: allocOverflow :: (AllocM m, Value val) => val -> m OverflowId
- Data.BTree.Alloc.Class: readOverflow :: (AllocReaderM m, (Value val)) => OverflowId -> m val
+ Data.BTree.Alloc.Class: readOverflow :: (AllocReaderM m, Value val) => OverflowId -> m val
- Data.BTree.Alloc.Debug: SomeNode :: (Height h) -> (Node h k v) -> SomeNode
+ Data.BTree.Alloc.Debug: SomeNode :: Height h -> Node h k v -> SomeNode
- Data.BTree.Impure: [Tree] :: {treeHeight :: Height height A term-level witness for the type-level height index., treeRootId :: Maybe (NodeId height key val) An empty tree is represented by 'Nothing'. Otherwise it's 'Just' a 'NodeId' pointer the root.} -> Tree key val
+ Data.BTree.Impure: [Tree] :: {treeHeight :: Height height " A term-level witness for the type-level height index.", treeRootId :: Maybe (NodeId height key val) " An empty tree is represented by 'Nothing'. Otherwise it's 'Just' a 'NodeId' pointer the root."} -> Tree key val
- Data.BTree.Impure.Internal.Structures: [Tree] :: {treeHeight :: Height height A term-level witness for the type-level height index., treeRootId :: Maybe (NodeId height key val) An empty tree is represented by 'Nothing'. Otherwise it's 'Just' a 'NodeId' pointer the root.} -> Tree key val
+ Data.BTree.Impure.Internal.Structures: [Tree] :: {treeHeight :: Height height " A term-level witness for the type-level height index.", treeRootId :: Maybe (NodeId height key val) " An empty tree is represented by 'Nothing'. Otherwise it's 'Just' a 'NodeId' pointer the root."} -> Tree key val
- Data.BTree.Impure.NonEmpty: [NonEmptyTree] :: {treeHeight :: Height height A term-level witness for the type-level height index., treeRootId :: NodeId height key val An empty tree is represented by 'Nothing'. Otherwise it's 'Just' a 'NodeId' pointer the root.} -> NonEmptyTree key val
+ Data.BTree.Impure.NonEmpty: [NonEmptyTree] :: {treeHeight :: Height height " A term-level witness for the type-level height index.", treeRootId :: NodeId height key val " An empty tree is represented by 'Nothing'. Otherwise it's 'Just' a 'NodeId' pointer the root."} -> NonEmptyTree key val
- Data.BTree.Primitives.Index: Index :: !(Vector key) -> !(Vector node) -> Index key node
+ Data.BTree.Primitives.Index: Index :: !Vector key -> !Vector node -> Index key node
- Data.BTree.Primitives.Index: IndexCtx :: !(Vector key) -> !(Vector key) -> !(Vector val) -> !(Vector val) -> IndexCtx key val
+ Data.BTree.Primitives.Index: IndexCtx :: !Vector key -> !Vector key -> !Vector val -> !Vector val -> IndexCtx key val
- Data.BTree.Primitives.Index: [indexCtxLeftKeys] :: IndexCtx key val -> !(Vector key)
+ Data.BTree.Primitives.Index: [indexCtxLeftKeys] :: IndexCtx key val -> !Vector key
- Data.BTree.Primitives.Index: [indexCtxLeftVals] :: IndexCtx key val -> !(Vector val)
+ Data.BTree.Primitives.Index: [indexCtxLeftVals] :: IndexCtx key val -> !Vector val
- Data.BTree.Primitives.Index: [indexCtxRightKeys] :: IndexCtx key val -> !(Vector key)
+ Data.BTree.Primitives.Index: [indexCtxRightKeys] :: IndexCtx key val -> !Vector key
- Data.BTree.Primitives.Index: [indexCtxRightVals] :: IndexCtx key val -> !(Vector val)
+ Data.BTree.Primitives.Index: [indexCtxRightVals] :: IndexCtx key val -> !Vector val
- Data.BTree.Primitives.Leaf: splitLeafManyPred :: (Key key) => (a -> Bool) -> (Map key val -> a) -> Map key val -> Maybe (Index key a)
+ Data.BTree.Primitives.Leaf: splitLeafManyPred :: Key key => (a -> Bool) -> (Map key val -> a) -> Map key val -> Maybe (Index key a)

Files

haskey-btree.cabal view
@@ -1,5 +1,5 @@ name:                haskey-btree-version:             0.3.0.0+version:             0.3.0.1 synopsis:            B+-tree implementation in Haskell. description:     This package provides two B+-tree implementations. The first one is a pure@@ -68,10 +68,10 @@     binary                  >=0.6  && <0.9 || >0.9 && <1,     bytestring              >=0.10 && <1,     containers              >=0.5  && <1,-    hashable                >=1.2  && <1.3,+    hashable                >=1.2  && <2,     mtl                     >=2.1  && <3,     semigroups              >=0.12 && <1,-    text                    >=1.2 && <2,+    text                    >=1.2.1 && <2,     transformers            >=0.3  && <1,     vector                  >=0.10 && <1