 
   # Write a delete object. Calculate the serialized JSON string length of the
   # inserted record and add it to the in memory JSON size of the page and the in
-  # memory b-tree as a whole.
+  # memory b&#x2011;tree as a whole.
   #
   # TODO Document `ghost`.
   writeDelete: (fd, page, index, ghost, _) ->

# the left sibling. Remove the merge sibling from its parent. Delete the key
# from where we found it, so it can be looked up again.
#
# Before we lose track of the sub-tree we're in, we descend to the poteinally
# new left most leaf of the parent, and obtain its key to repeat the process.
#
# #### Filling the Root Page

# To merge a leaf page, we start by obtaining the key value of the first record.
# We can do this by acquiring a read lock on the page, without performing a
# descent. The balancer gets to break some rules since it knows that we know
# that the b&#x2011;tree is not being otherwise balanced.
#
# With that key, we descend the b&#x2011;tree. We know that the key value cannot
# change, because it is the balancer that alters keys. The first record may be
# deleted by editing, but a ghost of the first record is preserved for the key
# value, which is the key value of the page.
