fix test cases

Author: Banyc

src/MiniSQL.BufferManager/Program.cs

@@ -14,11 +14,11 @@ static void Main(string[] args)
         {
             Console.WriteLine("[BufferManager] Test Begin");
 
-            // TestPager();
+            TestPager();
 
-            // TestPagerSwapping();
+            TestPagerSwapping();
 
-            // TestFreeList();
+            TestFreeList();
 
             Console.WriteLine("[BufferManager] Test End");
         }

src/MiniSQL.IndexManager/Models/B-Tree/BTreeTestCases.cs

@@ -14,8 +14,8 @@ public static class BTreeTestCases
     {
         public static void TestAll()
         {
-            // TestLeafTableNode();
-            // TestMaxHeightBTree();
+            TestLeafTableNode();
+            TestMaxHeightBTree();
         }
 
         static void TestMaxHeightBTree()

src/MiniSQL.IndexManager/Program.cs

@@ -5,6 +5,7 @@
 using MiniSQL.BufferManager.Controllers;
 using MiniSQL.BufferManager.Models;
 using MiniSQL.IndexManager.Controllers;
+using MiniSQL.IndexManager.Interfaces;
 using MiniSQL.IndexManager.Models;
 using MiniSQL.IndexManager.Utilities;
 using MiniSQL.Library.Models;
@@ -17,44 +18,42 @@ static void Main(string[] args)
         {
             Console.WriteLine("[IndexManager] Test Begin");
 
-            //BTreeTestCases.TestAll();
+            // BTreeTestCases.TestAll();
 
             // TestMaxHeightBTree(8, false, true, true);
 
-            //BugTest1();
+            BugTest1();
 
-            // Bugtest2();
+            Bugtest2();
 
-            // BugTest3();
+            BugTest3();
 
-            //TestExpressionFind();
+            TestExpressionFind();
 
-            //TestExpressionDelete();
+            TestExpressionDelete();
 
-            //TestInsertSplit(200);
+            TestBTreeInsert();
 
-            //TestBTreeInsert();
-
-            //TestBTreeDelete();
+            TestBTreeDelete();
 
             HardTestForBTree();
 
-            // TestDBRecord();
+            TestDBRecord();
+
+            TestLeafTableCell();
 
-            // TestLeafTableCell();
+            TestInternalTableCell();
 
-            // TestInternalTableCell();
+            TestInternalIndexCell();
 
-            // TestInternalIndexCell();
+            TestLeafIndexCell();
 
-            // TestLeafIndexCell();
+            TestInsertIntoAndDeletionInsideBTreeNode();
 
             // TestPager();
 
             // TestPagerSwapping();
 
-            //TestInsertIntoAndDeletionInsideBTreeNode();
-
             // TestFreeList();
 
             Console.WriteLine("[IndexManager] Test End");
@@ -102,7 +101,7 @@ record = GetTestBRecord(2);
             record = GetTestBRecord(4);
             keyRecord = GetTestBRecord(4);
             root = controller.InsertCell(root, keyRecord, record);
-            
+
             BTreeNodeHelper.VisualizeIntegerTree(pager, root);
             // test 5
             // keyRecord = GetTestBRecord(1109110087);
@@ -356,6 +355,7 @@ record = GetTestRecord_expression(i, "www", (float)1.3);
 
             BTreeNodeHelper.VisualizeIntegerTree(pager, root);
 
+            pager.Close();
         }
 
         static void TestExpressionFind()
@@ -414,6 +414,7 @@ record = GetTestRecord_expression(i, "www", (float)1.3);
                 Console.WriteLine();
             }
 
+            pager.Close();
         }
 
         private static DBRecord GetTestRecord_expression(int value_1, string value_2, float value_3)
@@ -612,6 +613,7 @@ static void TestBTreeDelete()
             Debug.Assert(result != null);
             Debug.Assert(result.Key.GetValues()[0].IntegerValue == 7);
 
+            pager.Close();
         }
 
         static void HardTestForBTree()
@@ -620,14 +622,14 @@ static void HardTestForBTree()
             File.Delete(dbPath);
             Pager pager = new Pager(dbPath);
             FreeList freeList = new FreeList(pager);
-            BTreeController controller = new BTreeController(pager, freeList);
+            BTreeController controller = new BTreeController(pager, freeList, 4);
             BTreeNode root = null;
             LeafTableCell result = null;
 
             //Construct BTree
             for (int i = 1; i < 20; i++)
             {
-                DBRecord record = GetTestBRecord(i+100);
+                DBRecord record = GetTestBRecord(i + 100);
                 DBRecord keyRecord = GetTestBRecord(i);
                 root = controller.InsertCell(root, keyRecord, record);
 
@@ -636,13 +638,31 @@ static void HardTestForBTree()
                 Debug.Assert(result.Key.GetValues()[0].IntegerValue == i);
 
             }
+            // test inserting records with repeated primary keys
             DBRecord record_D = GetTestBRecord(103);
             DBRecord keyRecord_D = GetTestBRecord(3);
-            root = controller.InsertCell(root, keyRecord_D, record_D);
-             
+            bool isError = false;
+            try
+            {
+                root = controller.InsertCell(root, keyRecord_D, record_D);
+            }
+            catch (RepeatedKeyException)
+            {
+                isError = true;
+            }
+            Debug.Assert(isError == true);
+
+            isError = false;
             record_D = GetTestBRecord(105);
             keyRecord_D = GetTestBRecord(5);
-            root = controller.InsertCell(root, keyRecord_D, record_D);
+            try
+            {
+                root = controller.InsertCell(root, keyRecord_D, record_D);
+            }
+            catch (RepeatedKeyException)
+            {
+                isError = true;
+            }
 
             BTreeNodeHelper.VisualizeIntegerTree(pager, root);
 
@@ -714,10 +734,9 @@ static void HardTestForBTree()
 
             }
 
+            pager.Close();
         }
 
-
-
         static void TestBTreeInsert()
         {
             LeafTableCell result = null;

src/MiniSQL.Library/Program.cs

@@ -116,11 +116,13 @@ private static void TestAndList()
 
         private static Expression GetAndsExpression()
         {
+            // __expression__
+            // ((32 != a) and (b <= "str")) and (6.6 > c)
             // __tree structure__
-            //             and 1
-            //        and 2,     > 3
-            //     != 4, <= 5, 6.6 6, c 7
-            // 32 8, a, 9, b 10, "str" 11
+            //                       and 1
+            //            and 2,                    > 3
+            //     != 4,        <= 5,           6.6 6, c 7
+            // 32 8, a 9,    b 10, "str" 11
 
             // 32
             Expression node8 = new Expression();

src/MiniSQL.RecordManager/Program.cs

@@ -3,7 +3,6 @@
 using System.Diagnostics;
 using System.IO;
 using MiniSQL.BufferManager.Controllers;
-using MiniSQL.BufferManager.Models;
 using MiniSQL.IndexManager.Controllers;
 using MiniSQL.IndexManager.Models;
 using MiniSQL.IndexManager.Utilities;