From 5705309ac72dd5145510387095eb643586389607 Mon Sep 17 00:00:00 2001 From: Harun Mustafa Date: Fri, 8 Sep 2023 10:18:24 +0200 Subject: [PATCH] remove superfluous asserts --- .../src/graph/alignment/aligner_seeder_methods.cpp | 10 ---------- 1 file changed, 10 deletions(-) diff --git a/metagraph/src/graph/alignment/aligner_seeder_methods.cpp b/metagraph/src/graph/alignment/aligner_seeder_methods.cpp index 8a71663832..3e711a7492 100644 --- a/metagraph/src/graph/alignment/aligner_seeder_methods.cpp +++ b/metagraph/src/graph/alignment/aligner_seeder_methods.cpp @@ -626,9 +626,6 @@ It merge_into_mums(const DeBruijnGraph &graph, using seed_t = std::remove_reference_t; if constexpr(std::is_same_v) { - assert(std::all_of(begin, end, [&](const auto &a) { - return a.is_valid(graph, &config); - })); // first, move all inexact matches to the front and ignore them begin = std::partition(begin, end, [](const auto &a) { const auto &cigar = a.get_cigar().data(); @@ -651,12 +648,6 @@ It merge_into_mums(const DeBruijnGraph &graph, return end; } - if constexpr(std::is_same_v) { - assert(std::all_of(begin, end, [&](const auto &a) { - return Alignment(a, config).is_valid(graph, &config); - })); - } - ssize_t graph_k = graph.get_k(); std::sort(begin, end, [](const auto &a, const auto &b) { return std::pair(a.get_query_view().end(), a.get_query_view().begin()) @@ -910,7 +901,6 @@ It merge_into_mums(const DeBruijnGraph &graph, c += coord_diff; } } - assert(inserted_seed.is_valid(graph, &config)); a_i.splice(std::move(inserted_seed)); assert(a_i.size()); assert(a_i.label_column_diffs.empty());