Persistence 1.1.4 → 1.1.4.1

raw patch · 3 files changed

+15/−9 lines, 3 files

Files

• ChangeLog.md +6/−0
• Persistence.cabal +1/−1
• Persistence.hs +8/−8

@@ -27,3 +27,9 @@  - Fixed spelling error. - Persistence now exports the constructors for `Extended a`.++## 1.1.4.1 -- 2018-09-15++### Changed++- Fixed all spelling errors, should actually build now

@@ -2,7 +2,7 @@ -- documentation, see http://haskell.org/cabal/users-guide/  name:                Persistence-version:             1.1.4+version:             1.1.4.1 synopsis:            Quickly detect clusters and holes in data. description:         Persistence is a topological data analysis library motivated by flexibility when it comes to the type of data being analyzed. If you have data that comes with a meaningful function into something of the Ord typeclass, you can use Persistence to detect clusters and holes in the data. You can also use the library to analyze the topology of directed\/undirected weighted\/unweighted graphs, and compare topologies of different data sets. license:             BSD3

@@ -35,10 +35,10 @@   , filterByWeightsLight   , makeVRFiltrationLight   , persistentHomology-  , bottelNeckDistance-  , bottelNeckDistances-  , safeBottelNeckDistance-  , safeBottelNeckDistances+  , bottleNeckDistance+  , bottleNeckDistances+  , safeBottleNeckDistance+  , safeBottleNeckDistances   ) where  import Util@@ -303,8 +303,8 @@ bottleNeckDistances diagrams1 diagrams2 =   let d = (L.length diagrams1) - (L.length diagrams2)   in-    if d >= 0 then (L.zipWith bottelNeckDistance diagrams1 diagrams2) L.++ (L.replicate d Infinity)-    else (L.zipWith bottelNeckDistance diagrams1 diagrams2) L.++ (L.replicate (-d) Infinity)+    if d >= 0 then (L.zipWith bottleNeckDistance diagrams1 diagrams2) L.++ (L.replicate d Infinity)+    else (L.zipWith bottleNeckDistance diagrams1 diagrams2) L.++ (L.replicate (-d) Infinity)   -- | If the number of barcodes is the same, return the maximum of minimum distances bewteen the bar codes. Otherwise return nothing.@@ -328,5 +328,5 @@ safeBottleNeckDistances diagrams1 diagrams2 =   let d = (L.length diagrams1) - (L.length diagrams2)   in-    if d >= 0 then (L.zipWith safeBottelNeckDistance diagrams1 diagrams2) L.++ (L.replicate d Nothing)-    else (L.zipWith safeBottelNeckDistance diagrams1 diagrams2) L.++ (L.replicate (-d) Nothing)+    if d >= 0 then (L.zipWith safeBottleNeckDistance diagrams1 diagrams2) L.++ (L.replicate d Nothing)+    else (L.zipWith safeBottleNeckDistance diagrams1 diagrams2) L.++ (L.replicate (-d) Nothing)