diff --git a/ChangeLog.md b/ChangeLog.md
--- a/ChangeLog.md
+++ b/ChangeLog.md
@@ -32,4 +32,10 @@
 
 ### Changed
 
-- Fixed all spelling errors, should actually build now
+- Fixed all spelling errors, should actually build now.
+
+## 1.1.4.2 -- 2018-09-15
+
+### Changed
+
+- Fixed non-exhaustive pattern match in `BottleNeckDistance` functions.
diff --git a/Persistence.cabal b/Persistence.cabal
--- a/Persistence.cabal
+++ b/Persistence.cabal
@@ -2,7 +2,7 @@
 -- documentation, see http://haskell.org/cabal/users-guide/
 
 name:                Persistence
-version:             1.1.4.1
+version:             1.1.4.2
 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
diff --git a/Persistence.hs b/Persistence.hs
--- a/Persistence.hs
+++ b/Persistence.hs
@@ -290,6 +290,7 @@
   let v1 = V.fromList diagram1
       v2 = V.fromList diagram2
 
+      metric (x1, Nothing) (x2, Nothing) = Finite $ fromIntegral $ abs $ x1 - x2
       metric (x1, Just y1) (x2, Nothing) = Infinity
       metric (x1, Nothing) (x2, Just y1) = Infinity
       metric (x1, Just y1) (x2, Just y2) =
@@ -315,6 +316,7 @@
     let v1 = V.fromList diagram1
         v2 = V.fromList diagram2
 
+        metric (x1, Nothing) (x2, Nothing) = Finite $ fromIntegral $ abs $ x1 - x2
         metric (x1, Just y1) (x2, Nothing) = Infinity
         metric (x1, Nothing) (x2, Just y1) = Infinity
         metric (x1, Just y1) (x2, Just y2) =