From: Karl Malbrain <malbrain@cal.berkeley.edu>
Date: Wed, 5 Feb 2014 17:50:21 +0000 (-0800)
Subject: Introduce btree2t.c
X-Git-Url: https://pd.if.org/git/?p=btree;a=commitdiff_plain;h=ee4614afd14a66051f51bfcf600b06648e0141f6

Introduce btree2t.c
---

diff --git a/README.md b/README.md
index b2fd536..c0de3d6 100644
--- a/README.md
+++ b/README.md
@@ -5,7 +5,9 @@ A working project for High-concurrency B-tree source code in C
 
 There are four major code sets in the standard btree source code:
 
-btree2s.c       Single Threaded/MultiProcess with latching supplied by advisory file locking.  Works with network file systems.
+btree2s.c       Single Threaded/MultiProcess with latching supplied by advisory file locking.  Works with network file systems.  Only deletes leaf level pages.
+
+btree2t.c       Single Threaded/MultiProcess version that removes keys all the way back to an original empty btree.
 
 threads2h.c     Multi-Threaded/Multi-Process with latching implemented by a latch manager with pthreads/SRW latches in the first few btree pages.