diff options
| author | Linus Nordberg <linus@nordberg.se> | 2014-10-28 15:27:37 +0100 |
|---|---|---|
| committer | Linus Nordberg <linus@nordberg.se> | 2014-10-28 15:27:37 +0100 |
| commit | 44e14486eed7f5dc00cc758922207e1864352cae (patch) | |
| tree | 4836bf59f5740572ad52bc1328fd9d711ca0f1e1 | |
| parent | 6f477e27dcbb8ecf24947d473186e8984cf87867 (diff) | |
Fix tests which broke in b676b219.
Broke when we changed add/1 to take a hash instead of an entry.
| -rw-r--r-- | src/ht.erl | 12 |
1 files changed, 6 insertions, 6 deletions
@@ -423,12 +423,12 @@ test_init(L) -> add_test() -> lists:foreach( fun(X) -> L = lists:sublist(?TEST_VECTOR_LEAVES, X), - test_init(L), + test_init(lists:map(fun mkleafhash/1, L)), ?assertEqual(mth(L), root()) end, random_entries(length(?TEST_VECTOR_LEAVES))). old_versions_test() -> - test_init(?TEST_VECTOR_LEAVES), + test_init(lists:map(fun mkleafhash/1, (?TEST_VECTOR_LEAVES))), ?assertEqual(mth(?TEST_VECTOR_LEAVES), root()), lists:foreach( fun(X) -> ?assertEqual(mth(lists:sublist(?TEST_VECTOR_LEAVES, X)), @@ -437,7 +437,7 @@ old_versions_test() -> old_versions_bigger_test() -> LEAVES = [<<X:32>> || X <- lists:seq(0, 64)], % 1024 is not unreasonable - test_init(LEAVES), + test_init(lists:map(fun mkleafhash/1, LEAVES)), ?assertEqual(mth(LEAVES), root()), lists:foreach( fun(X) -> ?assertEqual(mth(lists:sublist(LEAVES, X)), @@ -467,7 +467,7 @@ old_versions_bigger_test() -> %% @doc Test paths on a single version 7 tree. path_test() -> - test_init(?TEST_VECTOR_LEAVES), + test_init(lists:map(fun mkleafhash/1, ?TEST_VECTOR_LEAVES)), foreach( fun(N) -> Test = lists:nth(N, ?TEST_VECTOR_PATHS), @@ -484,7 +484,7 @@ path_inc_test() -> fun(N) -> Test = lists:nth(N, ?TEST_VECTOR_PATHS), Leaves = lists:sublist(?TEST_VECTOR_LEAVES, element(2, Test)), - test_init(Leaves), + test_init(lists:map(fun mkleafhash/1, Leaves)), ?assertEqual( path_ref(element(1, Test) - 1, Leaves), path(element(1, Test) - 1, element(2, Test) - 1)) @@ -523,7 +523,7 @@ path_inc_test() -> %% @doc Test proofs on a single version 7 tree. consistency_test() -> - test_init(?TEST_VECTOR_LEAVES), + test_init(lists:map(fun mkleafhash/1, ?TEST_VECTOR_LEAVES)), foreach( fun(N) -> Test = lists:nth(N, ?TEST_VECTOR_PROOFS), |