Persistence 2.0.2 → 2.0.3

raw patch · 3 files changed

+3/−3 lines, 3 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• Persistence.cabal +1/−1
• src/Persistence/Filtration.hs +1/−1
• src/Persistence/SimplicialComplex.hs +1/−1

@@ -7,7 +7,7 @@ -- hash: 8b7fcc7836b916f046653da257033f5fbdeb90a49069ff85be71bca358f359c0  name:           Persistence-version:        2.0.2+version:        2.0.3 category:       Data, Math synopsis:       A versatile library for topological data analysis. description:    A topological data analysis library motivated by flexibility when it comes to the type of data being analyzed. If your data comes with a meaningful binary function into an ordered set, you can use Persistence to analyze your data. The library also provides functions for analyzing directed\/undirected, weighted\/unweighted graphs. See the README for resources on learning about topological data anlysis.

@@ -665,7 +665,7 @@                     -> Vector (Vector (BarCode a))                     -> Vector (Maybe (Extended b)) bottleNeckDistances metric diagrams1 diagrams2 =-  let d = (L.length diagrams1) - (L.length diagrams2)+  let d = (V.length diagrams1) - (V.length diagrams2)   in     if d >= 0     then (V.zipWith (bottleNeckDistance metric) diagrams1 diagrams2) V.++ (V.replicate d Nothing)

@@ -527,7 +527,7 @@           if i == dim then evalPar (snd $ V.last ranks) (calc i1) --see Util for evalPar           else evalPar ((snd $ ranks ! i1) - (fst $ ranks ! i)) (calc i1)   in-    if L.null $ snd sc then [fst sc]+    if V.null $ snd sc then [fst sc]     else L.reverse $ calc dim  --gets the first boundary operator