From fad3e15bc6f340578ebb04cc3408d3daf10dad98 Mon Sep 17 00:00:00 2001
From: Arya GJ <aryakvg@gmail.com>
Date: Sun, 15 Oct 2023 22:00:03 -0700
Subject: [PATCH] Changed default chain in ChainingHashTableTests.java to be
BinarySearchTree instead of MTFList
---
src/test/java/provided/ChainingHashTableTests.java | 8 ++++++--
1 file changed, 6 insertions(+), 2 deletions(-)
diff --git a/src/test/java/provided/ChainingHashTableTests.java b/src/test/java/provided/ChainingHashTableTests.java
index 2335930..226990e 100644
--- a/src/test/java/provided/ChainingHashTableTests.java
+++ b/src/test/java/provided/ChainingHashTableTests.java
@@ -1,6 +1,7 @@
package provided;
import cse332.datastructures.containers.Item;
+import cse332.datastructures.trees.BinarySearchTree;
import cse332.interfaces.misc.Dictionary;
import datastructures.dictionaries.ChainingHashTable;
import datastructures.dictionaries.MoveToFrontList;
@@ -25,8 +26,11 @@ public class ChainingHashTableTests {
@Test()
@Timeout(value = 3000, unit = TimeUnit.MILLISECONDS)
public void test_insertFind_manyElements_correctStructure() {
- ChainingHashTable<String, Integer> list = new ChainingHashTable<>(MoveToFrontList::new);
-
+ /*
+ Replace BinarySearchTree with your own Dictionary implementations like MoveToFrontList or AVLTree
+ to test them as chains for the ChainingHashTable (highly recommended to find potential bugs)
+ * */
+ ChainingHashTable<String, Integer> list = new ChainingHashTable<>(BinarySearchTree::new);
int n = 1000;
// Add them
--
GitLab