Merge branch 'master' of https://github.com/malbrain/Btree-source-code.git

diff --cc README.md
index 7b2ba8494ba565b07a52c87c3cbc0ef2c3b398e6,37383fc1e66481ead5d43fc85b40c6a0e438b3a3..691c7b7710e00b0c72fd5712c4046f6330e1a46b
--- 1/README.md
--- 2/README.md
+++ b/README.md
@@@ -6,15 -6,14 +6,20 @@@ A working project for High-concurrency 
  There are three major code sets in the btree source code:
  
  btree2q.c       Single Threaded/MultiProcess with latching supplied by advisory file locking.  Works with network file systems.
++
  threads2h.c     Multi-Threaded/Multi-Process with latching implemented with test & set locks in the btree pages.
+ 
 +threads2i.c     Multi-Threaded/Multi-Process with latching implemented with test & set locks in the btree pages with Linux futex system calls for contention.
 +
  The Foster set includes three types of latching:
  
  Fosterbtreee.c  Multi-Threaded/Single Process with latches hosted by the buffer pool manager
++
  Fosterbtreef.c  Multi-Threaded/Multi-Process with latches hosted by a latch manager using the first few pages of the btree.
++
  Fosterbtreeg.c  Multi-Threaded/Multi-Process with latches implemented with test & set locks in the btree pages.
  
++
  Compilation is achieved on linux or Windows by:
  
  gcc -D STANDALONE threads2h.c -lpthread