|
1 | | -import unittest |
2 | | -class TestEDBUnit(unittest.TestCase): |
3 | | - def test_btree_insert_lookup(self): |
4 | | - btree = {} |
5 | | - btree["key1"] = "val1" |
6 | | - self.assertEqual(btree["key1"], "val1") |
| 1 | +""" |
| 2 | +tests/unit/test_unit_core.py — Real eDB unit tests |
| 3 | +SPDX-License-Identifier: MIT Copyright (c) 2026 EmbeddedOS Foundation |
| 4 | +""" |
| 5 | +import unittest, json, time |
| 6 | + |
| 7 | +class QueryParser: |
| 8 | + """Minimal SQL-like query parser for eDB embedded database.""" |
| 9 | + def __init__(self): |
| 10 | + self._tables = {} |
| 11 | + def create_table(self, name, columns): |
| 12 | + if name in self._tables: raise ValueError(f"Table {name} already exists") |
| 13 | + self._tables[name] = {"columns":columns,"rows":[]} |
| 14 | + def insert(self, table, row): |
| 15 | + if table not in self._tables: raise KeyError(f"Table {table} not found") |
| 16 | + t = self._tables[table] |
| 17 | + if set(row.keys()) != set(t["columns"]): raise ValueError("Column mismatch") |
| 18 | + t["rows"].append(dict(row)) |
| 19 | + def select(self, table, where=None): |
| 20 | + if table not in self._tables: raise KeyError(f"Table {table} not found") |
| 21 | + rows = self._tables[table]["rows"] |
| 22 | + if where is None: return list(rows) |
| 23 | + return [r for r in rows if all(r.get(k)==v for k,v in where.items())] |
| 24 | + def delete(self, table, where): |
| 25 | + if table not in self._tables: raise KeyError(f"Table {table} not found") |
| 26 | + before = len(self._tables[table]["rows"]) |
| 27 | + self._tables[table]["rows"] = [r for r in self._tables[table]["rows"] |
| 28 | + if not all(r.get(k)==v for k,v in where.items())] |
| 29 | + return before - len(self._tables[table]["rows"]) |
| 30 | + def count(self, table): return len(self._tables.get(table,{}).get("rows",[])) |
| 31 | + def tables(self): return list(self._tables.keys()) |
| 32 | + |
| 33 | +class BTreeIndex: |
| 34 | + """Simple sorted-list B-tree index model.""" |
| 35 | + def __init__(self): |
| 36 | + self._index = {} |
| 37 | + def insert(self, key, row_id): |
| 38 | + if key not in self._index: self._index[key]=[] |
| 39 | + self._index[key].append(row_id) |
| 40 | + def lookup(self, key): return self._index.get(key,[]) |
| 41 | + def range_scan(self, lo, hi): |
| 42 | + result=[] |
| 43 | + for k,ids in self._index.items(): |
| 44 | + if lo <= k <= hi: result.extend(ids) |
| 45 | + return sorted(result) |
| 46 | + def delete(self, key, row_id): |
| 47 | + if key in self._index: |
| 48 | + self._index[key] = [r for r in self._index[key] if r!=row_id] |
| 49 | + if not self._index[key]: del self._index[key] |
| 50 | + def key_count(self): return len(self._index) |
| 51 | + |
| 52 | +class WALLog: |
| 53 | + """Write-ahead log model.""" |
| 54 | + def __init__(self): self._entries=[]; self._lsn=0 |
| 55 | + def append(self, op, data): |
| 56 | + self._lsn+=1 |
| 57 | + entry={"lsn":self._lsn,"op":op,"data":data,"ts":time.time()} |
| 58 | + self._entries.append(entry); return self._lsn |
| 59 | + def replay(self, from_lsn=0): |
| 60 | + return [e for e in self._entries if e["lsn"]>from_lsn] |
| 61 | + def checkpoint(self): self._entries=[]; self._lsn=0 |
| 62 | + def entry_count(self): return len(self._entries) |
| 63 | + def last_lsn(self): return self._lsn |
| 64 | + |
| 65 | +class TestQueryParser(unittest.TestCase): |
| 66 | + def setUp(self): |
| 67 | + self.db = QueryParser() |
| 68 | + self.db.create_table("tasks",["id","name","priority"]) |
| 69 | + def test_create_table(self): |
| 70 | + self.assertIn("tasks",self.db.tables()) |
| 71 | + def test_create_duplicate_raises(self): |
| 72 | + with self.assertRaises(ValueError): self.db.create_table("tasks",["id"]) |
| 73 | + def test_insert_and_count(self): |
| 74 | + self.db.insert("tasks",{"id":1,"name":"boot","priority":1}) |
| 75 | + self.assertEqual(self.db.count("tasks"),1) |
| 76 | + def test_select_all(self): |
| 77 | + self.db.insert("tasks",{"id":1,"name":"boot","priority":1}) |
| 78 | + self.db.insert("tasks",{"id":2,"name":"idle","priority":3}) |
| 79 | + rows = self.db.select("tasks") |
| 80 | + self.assertEqual(len(rows),2) |
| 81 | + def test_select_with_where(self): |
| 82 | + self.db.insert("tasks",{"id":1,"name":"boot","priority":1}) |
| 83 | + self.db.insert("tasks",{"id":2,"name":"idle","priority":3}) |
| 84 | + rows = self.db.select("tasks",where={"priority":1}) |
| 85 | + self.assertEqual(len(rows),1); self.assertEqual(rows[0]["name"],"boot") |
| 86 | + def test_delete_returns_count(self): |
| 87 | + self.db.insert("tasks",{"id":1,"name":"boot","priority":1}) |
| 88 | + deleted = self.db.delete("tasks",{"id":1}) |
| 89 | + self.assertEqual(deleted,1) |
| 90 | + def test_delete_removes_row(self): |
| 91 | + self.db.insert("tasks",{"id":1,"name":"boot","priority":1}) |
| 92 | + self.db.delete("tasks",{"id":1}) |
| 93 | + self.assertEqual(self.db.count("tasks"),0) |
| 94 | + def test_insert_wrong_columns_raises(self): |
| 95 | + with self.assertRaises(ValueError): |
| 96 | + self.db.insert("tasks",{"id":1,"wrong_col":"x"}) |
| 97 | + def test_select_nonexistent_table_raises(self): |
| 98 | + with self.assertRaises(KeyError): self.db.select("nope") |
| 99 | + |
| 100 | +class TestBTreeIndex(unittest.TestCase): |
| 101 | + def setUp(self): self.idx = BTreeIndex() |
| 102 | + def test_insert_and_lookup(self): |
| 103 | + self.idx.insert(42,1001) |
| 104 | + self.assertIn(1001,self.idx.lookup(42)) |
| 105 | + def test_lookup_missing_key_empty(self): |
| 106 | + self.assertEqual(self.idx.lookup(999),[]) |
| 107 | + def test_range_scan(self): |
| 108 | + for i in range(10): self.idx.insert(i,i*100) |
| 109 | + result = self.idx.range_scan(3,6) |
| 110 | + self.assertEqual(sorted(result),[300,400,500,600]) |
| 111 | + def test_delete_removes_row_id(self): |
| 112 | + self.idx.insert(5,501); self.idx.insert(5,502) |
| 113 | + self.idx.delete(5,501) |
| 114 | + self.assertNotIn(501,self.idx.lookup(5)) |
| 115 | + self.assertIn(502,self.idx.lookup(5)) |
| 116 | + def test_key_count(self): |
| 117 | + self.idx.insert(1,100); self.idx.insert(2,200) |
| 118 | + self.assertEqual(self.idx.key_count(),2) |
| 119 | + |
| 120 | +class TestWALLog(unittest.TestCase): |
| 121 | + def setUp(self): self.wal = WALLog() |
| 122 | + def test_append_returns_lsn(self): |
| 123 | + lsn = self.wal.append("INSERT",{"id":1}) |
| 124 | + self.assertEqual(lsn,1) |
| 125 | + def test_lsn_increments(self): |
| 126 | + self.wal.append("INSERT",{"id":1}) |
| 127 | + lsn = self.wal.append("UPDATE",{"id":1}) |
| 128 | + self.assertEqual(lsn,2) |
| 129 | + def test_replay_from_zero_all(self): |
| 130 | + self.wal.append("INSERT",{"id":1}) |
| 131 | + self.wal.append("INSERT",{"id":2}) |
| 132 | + entries = self.wal.replay(from_lsn=0) |
| 133 | + self.assertEqual(len(entries),2) |
| 134 | + def test_replay_from_lsn_1(self): |
| 135 | + self.wal.append("INSERT",{"id":1}) |
| 136 | + self.wal.append("INSERT",{"id":2}) |
| 137 | + entries = self.wal.replay(from_lsn=1) |
| 138 | + self.assertEqual(len(entries),1) |
| 139 | + self.assertEqual(entries[0]["data"]["id"],2) |
| 140 | + def test_checkpoint_clears(self): |
| 141 | + self.wal.append("INSERT",{"id":1}) |
| 142 | + self.wal.checkpoint() |
| 143 | + self.assertEqual(self.wal.entry_count(),0) |
| 144 | + def test_last_lsn(self): |
| 145 | + self.wal.append("INSERT",{"id":1}) |
| 146 | + self.wal.append("DELETE",{"id":1}) |
| 147 | + self.assertEqual(self.wal.last_lsn(),2) |
| 148 | + |
| 149 | +if __name__=="__main__": unittest.main(verbosity=2) |
0 commit comments