Update README.md

README.md

@@ -10,7 +10,6 @@ An efficient [B-tree](https://en.wikipedia.org/wiki/B-tree) implementation in Go
 - `Map` and `Set` types for ordered key-value maps and sets,
 - Fast bulk loading for pre-ordered data using the `Load()` method.
 - `Copy()` method with copy-on-write support.
-- Thread-safe operations.
 - [Path hinting](PATH_HINT.md) optimization for operations with nearby keys.
 
 ## Using
@@ -27,16 +26,15 @@ This package includes the following types of B-trees:
 
 - [`btree.Map`](#btreemap):
 A fast B-tree for storing ordered key value pairs.
-Go 1.18+ 
+
 - [`btree.Set`](#btreeset):
 Like `Map`, but only for storing keys.
-Go 1.18+
-- [`btree.BTreeG`](#btreegeneric):
-A feature-rich B-tree for storing data using a custom comparator.
-Go 1.18+
+
+- [`btree.BTreeG`](#btreebtreeg):
+A feature-rich B-tree for storing data using a custom comparator. Thread-safe.
+
 - [`btree.BTree`](#btreebtree):
-Like `BTreeG` but uses the `interface{}` type for data. Backwards compatible.
-Go 1.16+
+Like `BTreeG` but uses the `interface{}` type for data. Backwards compatible. Thread-safe.
 
 ### btree.Map