edges 0.9.1.1 → 0.10

raw patch · 4 files changed

+6/−6 lines, 4 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• edges.cabal +1/−1
• library/Edges/Functions.hs +2/−2
• library/Edges/NodeCounting.hs +1/−1
• library/Edges/Types.hs +2/−2

@@ -1,5 +1,5 @@ name: edges-version: 0.9.1.1+version: 0.10 category: Graphs synopsis: Tools for efficient immutable graphs description: A set of tools for constructing immutable graphs which are both memory and performance-efficient.

@@ -62,10 +62,10 @@   Edges bAmount $ runIdentity $ PrimMultiArray.create aAmount $ \ fold ->   Identity $ Foldl.fold fold foldable -nodeCountsList :: NodeCounts entity -> [Word32]+nodeCountsList :: NodeCounts entity -> [Word64] nodeCountsList (NodeCounts pa) = foldrPrimArray' (:) [] pa -nodeCountsUnboxedVector :: NodeCounts entity -> UnboxedVector.Vector Word32+nodeCountsUnboxedVector :: NodeCounts entity -> UnboxedVector.Vector Word64 nodeCountsUnboxedVector (NodeCounts pa) = PrimArray.toUnboxedVector pa  unindexNodeCounts :: (Eq entity, Hashable entity) => (Int -> Maybe entity) -> NodeCounts entity -> HashMap entity Int

@@ -50,7 +50,7 @@ This function can be used to reduce the amount of computation by excluding the nodes, which don't make much difference. -}-targetsWithMinSourceAmount :: Word32 -> Edges source target -> NodeCounts source -> NodeCounts target+targetsWithMinSourceAmount :: Word64 -> Edges source target -> NodeCounts source -> NodeCounts target targetsWithMinSourceAmount minSourceCount (Edges targetAmount edgesPma) (NodeCounts sourceCountsPa) =   unsafePerformIO $ do     targetCountsMpa <- newPrimArray targetAmount

@@ -10,9 +10,9 @@  newtype Node entity = Node Int -newtype NodeCounts entity = NodeCounts (PrimArray Word32)+newtype NodeCounts entity = NodeCounts (PrimArray Word64) -newtype EdgeCounts source target = EdgeCounts (PrimArray Word32)+newtype EdgeCounts source target = EdgeCounts (PrimArray Word64)  {-| Total amount of unique entities of the type