     next.previous = previous
     previous.next = next
     entry
-
-  # Generate a file name for a tier file with an optional suffix for temporary
-  # rewrite files. Tier file names are generated from the tier address.
-  filename: (address, suffix) ->
-    suffix or= ""
-    padding = "00000000".substring(0, 8 - String(address).length)
-    "#{@directory}/segment#{padding}#{address}#{suffix}"
-
-  allocateBranches: (penultimate) ->
-    address = @nextAddress++
-    tier = @link({ penultimate, address, addresses: [], cache: {} })
-    @cache[address] = tier
 
   allocateLeaves: (addresses, right) ->
     address = @nextAddress++

# Terms specific to our implementation will be introduced as they are
# encountered in the document. 
#
# ### What is a b-tree?
#
# This documentation assumes that you understand the theory behind the b-tree,
# and know the variations of implementation. If you are interested in learning

# since no suitable partition exists. The page will be allowed to grow beyond
# the maximum page size.
#
# ### Branch Pages
#
# Branch pages contain links to other pages. To find the a record in the b-tree,
# we first use branch pages to find the leaf page that contains our record.
