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

diff --git a/README.md b/README.md
index c0de3d6..eff833d 100644
--- a/README.md
+++ b/README.md
@@ -5,9 +5,7 @@ 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.  Only deletes leaf level pages.
-
-btree2t.c       Single Threaded/MultiProcess version that removes keys all the way back to an original empty btree.
+btree2s.c       Single Threaded/MultiProcess version that removes keys all the way back to an original empty btree, placing removed nodes on a free list.
 
 threads2h.c     Multi-Threaded/Multi-Process with latching implemented by a latch manager with pthreads/SRW latches in the first few btree pages.