switch to pkg/sorta

Signed-off-by: George Lemon <georgelemon@protonmail.com>

Author: georgelemon

README.md

@@ -13,7 +13,7 @@
 </p>
 
 ## 😍 Key Features
-- Red-black tree ordered storage of rows and Hash Tables for fast lookups
+- BTrees storage and Hash Tables for fast lookups
 - Write-ahead log (WAL) for durability and crash recovery
 - Simple API for inserting, updating, deleting, and querying records
 - Configurable options for performance tuning, such as batch sizes and flush intervals
@@ -23,9 +23,6 @@
 >[!NOTE]
 > Boogie is an experimental project mostly made with the chatbot for fun and learning. It is still in early stages, so expect data loss and breaking changes. Use at your own risk.
 
->[!NOTE]
-> Fun fact, this package is using [pkg/rbtree](https://github.com/Nycto/RBTreeNim), a 11-year-old Nim package that implements a red-black tree. It is a great example of how the Nim ecosystem has some hidden gems that can be used in new projects. 📦
-
 This can be used as a simple embedded database for your Nim applications. If you want, you can use [openpeeps/e2ee](https://github.com/openpeeps/e2ee) to encrypt the data before inserting it into Boogie database.
 
 ## Examples

boogie.nimble

@@ -10,5 +10,5 @@ srcDir        = "src"
 # Dependencies
 
 requires "nim >= 2.2.0"
-requires "rbtree"
+requires "sorta"
 requires "flatty"

src/boogie.nim

@@ -4,7 +4,7 @@
 #          Made by Humans from OpenPeeps
 #          https://github.com/openpeeps/boogie
 
-import pkg/rbtree
+import pkg/sorta
 import ./boogie/[store, wal]
 
-export rbtree, store, wal
+export sorta, store, wal

src/boogie/store.nim

@@ -7,7 +7,7 @@
 import std/[tables, options, strformat,
             json, strutils, os, sets]
 
-import pkg/[flatty, rbtree]
+import pkg/[flatty, sorta]
 import ./wal
 
 ## This module implements a simple WAL-based embedded database for Nim.
@@ -66,7 +66,7 @@ type
     pk: string
     cols: RowData
 
-  RowIndex* = RedBlackTree[RowRecord, string]
+  RowIndex* = SortedTable[RowRecord, string]
     ## An ordered index of rows in a table, keyed by primary key value. This allows for efficient
     ## ordered iteration and range queries.
 
@@ -142,7 +142,7 @@ proc cmp(a, b: RowRecord): int = cmp(a.pk, b.pk)
 proc extract(r: RowRecord): string = r.pk
 
 proc `==`*(a, b: RowRecord): bool =
-  ## Equality comp for RowRecord. Used by the RBTree to determine
+  ## Equality comp for RowRecord. Used by the SortedTable to determine
   ## if two records are the same. We consider two records equal if
   ## their primary keys are equal, since the primary key is the unique
   ## identifier for a row.
@@ -268,7 +268,7 @@ proc newTable*(name: string, primaryKey: string, columns: openArray[ColumnDef],
       pkSequence: 0'u64,
       columns: colsSeq,
       columnsByName: colsByName,
-      rows: newRBTree[RowRecord, string](),
+      rows: initSortedTable[RowRecord, string](),
     )
   else:
     DbTable(
@@ -277,7 +277,7 @@ proc newTable*(name: string, primaryKey: string, columns: openArray[ColumnDef],
       pkType: pkmManual,
       columns: colsSeq,
       columnsByName: colsByName,
-      rows: newRBTree[RowRecord, string](),
+      rows: initSortedTable[RowRecord, string](),
     )
 
 proc newColumn*(name: string, kind: DataType, nullable: bool): ColumnDef =
@@ -527,9 +527,9 @@ proc ensureOrderIndex(t: DbTable) =
   # be called before any operation that requires ordered access to rows.
   if not t.orderIndexDirty:
     return
-  t.rows = newRBTree[RowRecord, string]()
+  t.rows = initSortedTable[RowRecord, string]()
   for _, rec in t.rowsByPk.pairs:
-    t.rows.insert(rec)
+    t.rows[rec] = rec.pk
   t.orderIndexDirty = false
 
 proc insertRowNoWal(t: DbTable, pk: string, data: RowData): string =
@@ -736,7 +736,7 @@ iterator allRows*(t: DbTable): (string, RowData) =
   ## Iterate over all rows in the table in primary key order. This will be fast
   ## if the order index is clean, but may be slower if the index needs to be rebuilt.
   t.ensureOrderIndex()
-  for rec in t.rows:
+  for rec in t.rows.keys:
     yield (rec.pk, rec.cols)
 
 iterator allRowsByPk*(t: DbTable): (string, RowData) =