Change names from btree to larch.

1 files changed, 8 insertions, 8 deletions

diff --git a/insert-remove-test b/insert-remove-test
index b88b016..a398707 100755
--- a/insert-remove-test
+++ b/insert-remove-test
@@ -14,7 +14,7 @@
 # You should have received a copy of the GNU General Public License
 # along with this program.  If not, see <http://www.gnu.org/licenses/>.
 
-# Excercise my btree implementation, for simple benchmarking purposes.
+# Excercise my B-tree implementation, for simple benchmarking purposes.
 # The benchmark gets a location and an operation count as command line
 # arguments.
 #
@@ -34,7 +34,7 @@ import shutil
 import sys
 import time
 
-import btree
+import larch
 
 
 def do_it(keys, func, final):
@@ -52,7 +52,7 @@ def assert_refcounts_are_one(tree):
         node = tree.get_node(node_id)
         assert refcount == 1, 'type=%s id=%d refcount=%d' % (repr(node), 
                                                              node_id, refcount)
-        if isinstance(node, btree.IndexNode):
+        if isinstance(node, larch.IndexNode):
             for child_id in node.values():
                 helper(child_id)
     helper(tree.root.id)
@@ -78,7 +78,7 @@ def main():
         import logging
         import tracing
         tracing.trace_add_pattern('tree')
-        logging.basicConfig(filename='btree.log', level=logging.DEBUG)
+        logging.basicConfig(filename='larch.log', level=logging.DEBUG)
 
     location = sys.argv[1]
     n = int(sys.argv[2])
@@ -87,17 +87,17 @@ def main():
     value_size = 128
     node_size = 300
 
-    codec = btree.NodeCodec(key_size)
+    codec = larch.NodeCodec(key_size)
 
     if location == '':
-        ns = btree.NodeStoreMemory(node_size, codec)
+        ns = larch.NodeStoreMemory(node_size, codec)
     else:
         if os.path.exists(location):
             raise Exception('%s exists already' % location)
         os.mkdir(location)
-        ns = btree.NodeStoreDisk(node_size, codec, dirname=location)
+        ns = larch.NodeStoreDisk(node_size, codec, dirname=location)
 
-    forest = btree.Forest(ns)
+    forest = larch.Forest(ns)
     tree = forest.new_tree()
     logging.debug('min keys: %d' % tree.min_index_length)
     logging.debug('max keys: %d' % tree.max_index_length)