updated readme

README.md

@@ -4,18 +4,26 @@ An implementation of the Log-Structured Merge Tree (LSM tree) data structure in
 
 **Table of Contents**
 
-1. [Sorted String Table](#SSTable)
-2. [Skip-List](#Skip-List)
-3. [Tree](#Tree)
+1. [Architecture](#Architecture)
+    1. [SSTable](#SSTable)
+    2. [Skip-List](#Skip-List)
+    3. [Tree](#Tree)
 4. [Benchmarks](#Benchmarks)
+    1. [SSTable](#sstable-1)
+    2. [Skip-List](#skip-list-1)
+    3. [Tree](#tree-1)
 5. [Implementation status](#Implementation-status)
 
+## Console
+
 To interact with a toy tree you can use `./gradlew run -q` to spawn a console.
 
 ![console.png](misc%2Fconsole.png)
 
 ---
 
+# Architecture
+
 ## SSTable
 
 Sorted String Table (SSTable) is a collection of files modelling key-value pairs in sorted order by key.

src/main/java/com/tomfran/lsm/Main.java

@@ -33,10 +33,10 @@ public static void main(String[] args) {
         String help = """
                       Commands:
                         - s/set  <key> <value> : insert a key-value pair;
-                        - g/get  <key>         : get a value for a key;
-                        - d/del  <key>         : delete a key-value pair;
-                        - e/exit               : exit the application;
-                        - d/help               : show this list.
+                        - g/get  <key>         : get a key value;
+                        - d/del  <key>         : delete a key;
+                        - e/exit               : stop the console;
+                        - d/help               : show this message.
                       """;
 
         System.out.println(intro);