X-Git-Url: https://pd.if.org/git/?a=blobdiff_plain;f=README.md;h=c0de3d65bc6ce030aedd0f1ab3c7f21c3cf34a50;hb=07891352e2c84646ffe3071b4ebf708a97cf5c3e;hp=bd5b45dc746ba0602413c31d14d30aa304ed3769;hpb=06555f8de1409c22041b5b6f62f70fd186ebcba6;p=btree

diff --git a/README.md b/README.md
index bd5b45d..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:
 
-btree2q.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.