Move headers to include, tests to test

ndpar · Jan 12, 2018 · fd3299e · fd3299e
1 parent add34d7
commit fd3299e
Show file tree

Hide file tree

Showing 9 changed files with 58 additions and 74 deletions.
diff --git a/src/Data.hrl → include/Data.hrl b/src/Data.hrl → include/Data.hrl
diff --git a/src/Debug.hrl → include/Debug.hrl b/src/Debug.hrl → include/Debug.hrl
diff --git a/src/Shapes.hrl → include/Shapes.hrl b/src/Shapes.hrl → include/Shapes.hrl
diff --git a/src/Trees.hrl → include/Trees.hrl b/src/Trees.hrl → include/Trees.hrl
diff --git a/src/trees_test.erl b/src/trees_test.erl
diff --git a/src/ets_tests.erl → test/ets_tests.erl b/src/ets_tests.erl → test/ets_tests.erl
diff --git a/src/recursion_tests.erl → test/recursion_tests.erl b/src/recursion_tests.erl → test/recursion_tests.erl
diff --git a/src/regex_tests.erl → test/regex_tests.erl b/src/regex_tests.erl → test/regex_tests.erl
diff --git a/test/trees_test.erl b/test/trees_test.erl
@@ -0,0 +1,58 @@
+%
+% F.Cesarini & S.Thomson, Erlang Programming, p.169.
+% Exercise 7-5: Binary Trees
+%
+-module(trees_test).
+-include("Trees.hrl").
+-include_lib("eunit/include/eunit.hrl").
+
+sum_undefined_tree_test() ->
+    ?assertEqual(0, trees:sum(undefined)).
+
+sum_balanced_tree_test() ->
+    Tree = #bintree{value = 5, left = #bintree{value = 6}, right = #bintree{value = 9}},
+    ?assertEqual(20, trees:sum(Tree)).
+
+sum_lined_tree_test() ->
+    Tree = #bintree{value = 5, left = #bintree{value = 6, left = #bintree{value = 9}}},
+    ?assertEqual(20, trees:sum(Tree)).
+
+max_undefined_tree_test() ->
+    ?assertEqual(0, trees:max(undefined)).
+
+max_balanced_tree_test() ->
+    Tree = #bintree{value = 5, left = #bintree{value = 6}, right = #bintree{value = 9}},
+    ?assertEqual(9, trees:max(Tree)).
+
+max_lined_tree_test() ->
+    Tree = #bintree{value = 5, left = #bintree{value = 6, left = #bintree{value = 9}}},
+    ?assertEqual(9, trees:max(Tree)).
+
+is_ordered_undefined_tree_test() ->
+    ?assert(trees:is_ordered(undefined)).
+
+is_ordered_false_test() ->
+    Tree = #bintree{value = 5, left = #bintree{value = 6}, right = #bintree{value = 9}},
+    ?assertNot(trees:is_ordered(Tree)).
+
+is_ordered_true_test() ->
+    Tree = #bintree{value = 5, left = #bintree{value = 4}, right = #bintree{value = 6}},
+    ?assert(trees:is_ordered(Tree)).
+
+insert_into_undefined_test() ->
+    ?assertEqual(#bintree{value = 5}, trees:insert(5, undefined)).
+
+insert_into_left_tree_test() ->
+    Tree = #bintree{value = 5, left = #bintree{value = 4}, right = #bintree{value = 6}},
+    ?assertEqual(#bintree{value = 5, left = #bintree{value = 4, left = #bintree{value = 3}}, right = #bintree{value = 6}},
+        trees:insert(3, Tree)).
+
+insert_equal_into_right_tree_test() ->
+    Tree = #bintree{value = 5, left = #bintree{value = 4}, right = #bintree{value = 6}},
+    ?assertEqual(#bintree{value = 5, left = #bintree{value = 4}, right = #bintree{value = 6, left = #bintree{value = 5}}},
+        trees:insert(5, Tree)).
+
+insert_greater_into_right_tree_test() ->
+    Tree = #bintree{value = 5, left = #bintree{value = 4}, right = #bintree{value = 6}},
+    ?assertEqual(#bintree{value = 5, left = #bintree{value = 4}, right = #bintree{value = 6, right = #bintree{value = 7}}},
+        trees:insert(7, Tree)).