Visualisation of working with LinkedHashMap

Author: mmoschenskikh

CMakeLists.txt

@@ -3,4 +3,4 @@ project(linked_hash_map C)
 
 set(CMAKE_C_STANDARD 11)
 
-add_executable(linked_hash_map main.c linked_hash_map_entry.h linked_hash_map_struct.h linked_hash_map_put.c linked_hash_map_put.h linked_hash_map_utils.c linked_hash_map_utils.h linked_hash_map.c linked_hash_map.h linked_hash_map_get.c linked_hash_map_get.h linked_hash_map_remove.c linked_hash_map_remove.h)
+add_executable(linked_hash_map main.c linked_hash_map_entry.h linked_hash_map_struct.h linked_hash_map_put.c linked_hash_map_put.h linked_hash_map_utils.c linked_hash_map_utils.h linked_hash_map.c linked_hash_map.h linked_hash_map_get.c linked_hash_map_get.h linked_hash_map_remove.c linked_hash_map_remove.h tests.c tests.h)

main.c

@@ -1,6 +1,6 @@
-#include <stdio.h>
+#include "tests.h"
 
 int main() {
- printf("Hello, World!\n");
+ test();
  return 0;
 }

tests.c

@@ -0,0 +1,66 @@
+#include "tests.h"
+
+void test() {
+ struct LinkedHashMap *map = createHashMap();
+
+ testAdd(map);
+ testGet(map);
+ testRemove(map);
+
+ deleteMap(map);
+}
+
+void testAdd(struct LinkedHashMap *map) {
+ printf("\nRunning put test on the following map:\n");
+ print(map);
+
+ for (int i = 0; i < 10; ++i) {
+ printf("Adding pair (%d, %d) to the map\n", i, 10 - i);
+ put(map, i, 10 - i);
+ print(map);
+ }
+ int present = map->head->after->after->after->key;
+ int value = 25;
+ printf("Adding pair with existing key (%d, %d) to the map\n", present, value);
+ put(map, present, value);
+ print(map);
+}
+
+void testGet(struct LinkedHashMap *map) {
+ printf("\nRunning get test on the following map:\n");
+ print(map);
+
+ int key = 8;
+ printf("Requested key: %d; value for the key: %d\n", key, get(map, key)->value);
+ key = 2;
+ printf("Requested key: %d; value for the key: %d\n", key, get(map, key)->value);
+ key = 9;
+ printf("Requested key: %d; value for the key: %d\n", key, get(map, key)->value);
+}
+
+void testRemove(struct LinkedHashMap *map) {
+ printf("\nRunning remove test on the following map:\n");
+ print(map);
+
+ int key = 4;
+ printf("Removing entry with key %d:\n", key);
+ removeEntry(map, key);
+ print(map);
+
+ key = 0;
+ printf("Removing entry with key %d:\n", key);
+ removeEntry(map, key);
+ print(map);
+
+ key = 9;
+ printf("Removing entry with key %d:\n", key);
+ removeEntry(map, key);
+ print(map);
+
+ printf("Removing all entries:\n");
+ while (!isEmpty(map)) {
+ removeEntry(map, map->head->key);
+ }
+
+ print(map);
+}

tests.h

@@ -0,0 +1,15 @@
+#ifndef LINKED_HASH_MAP_TESTS_H
+#define LINKED_HASH_MAP_TESTS_H
+
+#include "linked_hash_map.h"
+#include <time.h>
+
+void test();
+
+void testAdd(struct LinkedHashMap *map);
+
+void testGet(struct LinkedHashMap *map);
+
+void testRemove(struct LinkedHashMap *map);
+
+#endif //LINKED_HASH_MAP_TESTS_H