summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorNikitaVolkov <>2018-08-10 08:35:00 (GMT)
committerhdiff <hdiff@hdiff.luite.com>2018-08-10 08:35:00 (GMT)
commita7403f11fe4d6a8cf47d90a0f2d714578bc7143c (patch)
treedfd044396d5e28ecd3a596f62047fae191abe1dc
parentae7eb1967202518ee9f585db64276ade1d815c4c (diff)
version 0.100.10
-rw-r--r--edges.cabal2
-rw-r--r--library/Edges/Functions.hs4
-rw-r--r--library/Edges/NodeCounting.hs2
-rw-r--r--library/Edges/Types.hs4
4 files changed, 6 insertions, 6 deletions
diff --git a/edges.cabal b/edges.cabal
index ad558fe..6c64c1e 100644
--- a/edges.cabal
+++ b/edges.cabal
@@ -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.
diff --git a/library/Edges/Functions.hs b/library/Edges/Functions.hs
index 667ef7f..3af409a 100644
--- a/library/Edges/Functions.hs
+++ b/library/Edges/Functions.hs
@@ -62,10 +62,10 @@ primFoldableWithAmountsEdges aAmount bAmount foldable =
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
diff --git a/library/Edges/NodeCounting.hs b/library/Edges/NodeCounting.hs
index 17020ca..4b0a8d3 100644
--- a/library/Edges/NodeCounting.hs
+++ b/library/Edges/NodeCounting.hs
@@ -50,7 +50,7 @@ Count the occurrences of targets based on the occurrences of sources.
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
diff --git a/library/Edges/Types.hs b/library/Edges/Types.hs
index 6b44a8d..23d8c99 100644
--- a/library/Edges/Types.hs
+++ b/library/Edges/Types.hs
@@ -10,9 +10,9 @@ data Edges source target = Edges Int {- Target array size -} (PrimMultiArray Wor
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