diff --git a/Data/Queue/TrieQueue/TrieLabel.hs b/Data/Queue/TrieQueue/TrieLabel.hs
--- a/Data/Queue/TrieQueue/TrieLabel.hs
+++ b/Data/Queue/TrieQueue/TrieLabel.hs
@@ -6,10 +6,10 @@
 import qualified Data.Sequence as Seq
 import qualified Data.Foldable as Fold
 
-type Split e x = Label e	-- ^ common prefix
-		-> e -> Label e	-- ^ truncated suffix of xs
-		-> e -> Label e	-- ^ truncated suffix of xs
-		-> x		-- ^ split trie
+type Split e x = Label e	-- common prefix
+		-> e -> Label e	-- truncated suffix of xs
+		-> e -> Label e	-- truncated suffix of xs
+		-> x		-- split trie
 
 type Tail e x = e -> Label e	-- left over suffix
 		-> x		-- trie
diff --git a/queuelike.cabal b/queuelike.cabal
--- a/queuelike.cabal
+++ b/queuelike.cabal
@@ -1,5 +1,5 @@
 name:		queuelike
-version:	1.0.8
+version:	1.0.9
 synopsis:	A library of queuelike data structures, both functional and stateful.
 description:	Contains several implementations of data structures implementing a /single-in, single-out/ paradigm.  Intended to be a better, more useful replacement for pqueue-mtl.
 		In particular, includes an experimental and possibly genuinely new trie-based priority queue on strings.  Feedback is appreciated.
@@ -26,7 +26,7 @@
 	Data.MQueue.SyncQueue
 	Data.MQueue.Chan
 	Data.MQueue
-other-modules: 
+other-modules:
 	Data.Semigroup
 	Data.Queue.QueueHelpers
 --	Data.Queue.TrieQueue.Edge