diff --git a/bytestring-tree-builder.cabal b/bytestring-tree-builder.cabal
--- a/bytestring-tree-builder.cabal
+++ b/bytestring-tree-builder.cabal
@@ -1,7 +1,7 @@
 name:
   bytestring-tree-builder
 version:
-  0.2.1.2
+  0.2.1.3
 category:
   ByteString
 synopsis:
diff --git a/library/ByteString/TreeBuilder.hs b/library/ByteString/TreeBuilder.hs
--- a/library/ByteString/TreeBuilder.hs
+++ b/library/ByteString/TreeBuilder.hs
@@ -20,13 +20,13 @@
 
 
 -- |
--- A binary-tree-based datastructure optimized for aggregation of bytestrings.
--- Implements the appending operation with /O(1)/ complexity.
+-- A binary-tree-based datastructure optimized for aggregation of bytestrings
+-- using the /O(1)/ appending operation.
 data Builder =
   Builder !Int !A.Tree
 
 -- |
--- Implements an /O(1)/ `mappend`.
+-- Implements `mappend` with /O(1)/ complexity.
 instance Monoid Builder where
   {-# INLINE mempty #-}
   mempty =
@@ -51,7 +51,7 @@
   Builder (B.length bytes) (A.Leaf bytes)
 
 -- |
--- Lifts a single bytestring into the builder.
+-- Lifts a single byte into the builder.
 {-# INLINE byte #-}
 byte :: Word8 -> Builder
 byte byte =
@@ -61,7 +61,7 @@
 -------------------------
 
 -- |
--- Performs a left-fold over the chunks of which the builder consists.
+-- Performs a left-fold over the aggregated chunks.
 {-# INLINE foldl #-}
 foldl :: (a -> ByteString -> a) -> a -> Builder -> a
 foldl step init (Builder length tree) =