Move temporary test code (to database project).

Author: evoskuil

test/chain/block.cpp

@@ -812,92 +812,6 @@ BOOST_AUTO_TEST_CASE(block__merkle_branch__maximum_non_overflow__expected)
     BOOST_REQUIRE_EQUAL(branch.back().width, power2(sub1(sub1(bits<size_t>))));
 }
 
-// TODO: unused.
-hash_digest get_hash(size_t /* height */) NOEXCEPT
-{
-    return {};
-}
-
-// TODO: database query, limited to interval heights, txs table.
-hash_digest get_interval(size_t /* last */) NOEXCEPT
-{
-    return {};
-}
-
-// TODO: database query, chase ancestry.
-hashes get_segment(size_t first, size_t count) NOEXCEPT
-{
-    BC_ASSERT(!is_add_overflow(first, count));
-
-    hashes out{};
-    out.reserve(count);
-    for (auto height = first; height < (first + count); ++height)
-        out.push_back(get_hash(height));
-
-    return out;
-}
-
-void push(hashes& branch, hashes&& hashes, size_t first,
-    size_t count) NOEXCEPT
-{
-    for (const auto& row: block::merkle_branch(first, count))
-    {
-        const auto it = std::next(hashes.begin(), row.sibling * row.width);
-        const auto mover = std::make_move_iterator(it);
-        branch.push_back(merkle_root({ mover, std::next(mover, row.width) }));
-    }
-}
-
-// Compute branch for target given checkpoint and merkle tree (hashes).
-hashes compute_merkle_proof(hashes roots, size_t checkpoint,
-    size_t target) NOEXCEPT
-{
-    constexpr auto depth = 11u;
-    constexpr auto size = power2(depth);
-    const auto local = target % size;
-    const auto index = target / size;
-    const auto start = index * size;
-    const auto end = std::min(sub1(start + size), checkpoint);
-    const auto length = add1(end - start);
-
-    hashes branch{};
-    branch.reserve(ceilinged_log2(length) + ceilinged_log2(roots.size()));
-    push(branch, get_segment(start, length), local, length);
-    push(branch, std::move(roots), index, roots.size());
-    return branch;
-}
-
-hashes compute_merkle_roots(size_t checkpoint) NOEXCEPT
-{
-    constexpr auto depth = 11u;
-    constexpr auto size = power2(depth);
-    const auto total = add1(checkpoint);
-
-    hashes roots{};
-    roots.reserve(ceilinged_divide(total, size));
-    for (size_t start{}; start < total; start += size)
-    {
-        const auto end = std::min(sub1(start + size), checkpoint);
-        const auto length = add1(end - start);
-        roots.push_back(length == size ? get_interval(end) :
-            merkle_root(get_segment(start, length)));
-    }
-
-    return roots;
-}
-
-// Computes root and branch (proof) for a block height up to a checkpoint.
-std::pair<hash_digest, hashes> compute_root_and_branch(size_t checkpoint,
-    size_t height) NOEXCEPT
-{
-    BC_ASSERT(height <= checkpoint);
-
-    auto roots = compute_merkle_roots(checkpoint);
-    auto proof = compute_merkle_proof(roots, checkpoint, height);
-    auto root = merkle_root(std::move(roots));
-    return { std::move(root), std::move(proof) };
-}
-
 // is_overweight
 // is_invalid_coinbase_script
 // is_hash_limit_exceeded