search_scheme_algorithm.hpp

Go to the documentation of this file.

// -----------------------------------------------------------------------------------------------------
// Copyright (c) 2006-2021, Knut Reinert & Freie Universität Berlin
// Copyright (c) 2016-2021, Knut Reinert & MPI für molekulare Genetik
// This file may be used, modified and/or redistributed under the terms of the 3-clause BSD-License
// shipped with this file and also available at: https://github.com/seqan/seqan3/blob/master/LICENSE.md
// -----------------------------------------------------------------------------------------------------
 
#pragma once
 
#include <type_traits>
 
#include <seqan3/search/detail/search_common.hpp>
#include <seqan3/search/detail/search_scheme_precomputed.hpp>
#include <seqan3/search/detail/search_traits.hpp>
#include <seqan3/search/fm_index/bi_fm_index.hpp>
#include <seqan3/search/fm_index/concept.hpp>
#include <seqan3/utility/type_traits/detail/transformation_trait_or.hpp>
#include <seqan3/utility/views/slice.hpp>
 
namespace seqan3::detail
{
 
template <typename configuration_t, typename index_t, typename ...policies_t>
    requires (template_specialisation_of<typename index_t::cursor_type, bi_fm_index_cursor>)
class search_scheme_algorithm : protected policies_t...
{
private:
    using traits_t = search_traits<configuration_t>;
    using search_result_type = typename traits_t::search_result_type;
 
    static_assert(!std::same_as<search_result_type, empty_type>, "The search result type was not configured.");
 
public:
    search_scheme_algorithm() = default; 
    search_scheme_algorithm(search_scheme_algorithm const &) = default; 
    search_scheme_algorithm(search_scheme_algorithm &&) = default; 
    search_scheme_algorithm & operator=(search_scheme_algorithm const &) = default; 
    search_scheme_algorithm & operator=(search_scheme_algorithm &&) = default; 
    ~search_scheme_algorithm() = default; 
 
    search_scheme_algorithm(configuration_t const & cfg, index_t const & index) : policies_t{cfg}...
    {
        stratum = cfg.get_or(search_cfg::hit_strata{0}).stratum;
        index_ptr = std::addressof(index);
    }
 
    template <tuple_like indexed_query_t, typename callback_t>
        requires (std::tuple_size_v<indexed_query_t> == 2) &&
                 std::ranges::forward_range<std::tuple_element_t<1, indexed_query_t>> &&
                 std::invocable<callback_t, search_result_type>
    void operator()(indexed_query_t && indexed_query, callback_t && callback)
    {
        auto && [query_idx, query] = indexed_query;
        auto error_state = this->max_error_counts(query); // see policy_max_error
 
        // construct internal delegate for collecting hits for later filtering (if necessary)
        std::vector<typename index_t::cursor_type> internal_hits{};
        auto on_hit_delegate = [&internal_hits] (auto const & it)
        {
            internal_hits.push_back(it);
        };
 
        perform_search_by_hit_strategy(internal_hits, query, error_state, on_hit_delegate);
 
        // Invoke the callback on the generated result.
        this->make_results(std::move(internal_hits), query_idx, callback); // see policy_search_result_builder
    }
 
private:
    index_t const * index_ptr{nullptr};
 
    uint8_t stratum{};
 
    // forward declaration
    template <bool abort_on_hit, typename query_t, typename delegate_t>
    inline void search_algo_bi(query_t & query, search_param const error_left, delegate_t && delegate);
 
    template <typename query_t, typename delegate_t>
    void perform_search_by_hit_strategy(std::vector<typename index_t::cursor_type> & internal_hits,
                                        query_t & query,
                                        search_param error_state,
                                        delegate_t const & on_hit_delegate)
    {
        if constexpr (!traits_t::search_all_hits)
        {
            auto max_total = error_state.total;
            error_state.total = 0; // start search with less errors
            while (internal_hits.empty() && error_state.total <= max_total)
            {
                // * If you only want the best hit (traits_t::search_single_best_hit), you stop after finding the
                //   first hit, the hit with the least errors (`abort_on_hit` is true).
                // * If you are in strata mode (traits_t::search_strata_hits), you do the same as with best hits,
                //   but then do the extra step afterwards (`abort_on_hit` is true).
                // * If you want all best hits (traits_t::search_all_best_hits), you do not stop after the first
                //   hit but continue the current search algorithm/max_error pattern (`abort_on_hit` is true).
                constexpr bool abort_on_hit = !traits_t::search_all_best_hits;
                search_algo_bi<abort_on_hit>(query, error_state, on_hit_delegate);
                ++error_state.total;
            }
            if constexpr (traits_t::search_strata_hits)
            {
                if (!internal_hits.empty())
                {
                    internal_hits.clear(); // TODO:don't clear when using Optimum Search Schemes with lower error bounds
                    error_state.total += stratum - 1;
                    search_algo_bi<false>(query, error_state, on_hit_delegate);
                }
            }
        }
        else // detail::search_mode_all
        {
            // If you want to find all hits, you cannot stop once you found any hit (<false>)
            // since you have to find all paths in the search tree that satisfy the hit condition.
            search_algo_bi<false>(query, error_state, on_hit_delegate);
        }
    }
};
 
inline std::vector<search_dyn> compute_ss(uint8_t const min_error, uint8_t const max_error)
{
    // TODO: Replace this at least by the pigeonhole principle or even better by 01*0 schemes.
    // NOTE: Make sure that the searches are sorted by their asymptotical running time (i.e. upper error bound string),
    //       s.t. easy to compute searches come first. This improves the running time of algorithms that abort after the
    //       first hit (e.g. search strategy: best). Even though it is not guaranteed, this seems to be a good greedy
    //       approach.
    std::vector<search_dyn> scheme{{{1}, {min_error}, {max_error}}};
    return scheme;
}
 
template <typename search_scheme_t>
inline auto search_scheme_block_info(search_scheme_t const & search_scheme, size_t const query_length)
{
    using blocks_length_type = typename search_scheme_t::value_type::blocks_length_type;
 
    bool constexpr is_dyn_scheme = std::same_as<search_scheme_t, search_scheme_dyn_type>;
 
    // Either store information in an array (for search schemes known at compile time) or in a vector otherwise.
    using result_type = std::conditional_t<is_dyn_scheme,
                                           std::vector<std::tuple<blocks_length_type, size_t>>,
                                           std::array<std::tuple<blocks_length_type, size_t>,
                                                      transformation_trait_or_t<std::tuple_size<search_scheme_t>,
                                                                                std::false_type>::value>>;
 
    result_type result;
    if constexpr (is_dyn_scheme)
        result.resize(search_scheme.size());
 
    uint8_t const blocks      {search_scheme[0].blocks()};
    size_t  const block_length{query_length / blocks};
    uint8_t const rest        {static_cast<uint8_t>(query_length % blocks)};
 
    blocks_length_type blocks_length;
    // set all blocks_length values to block_length
    // resp. block_length + 1 for the first `rest = block_length % blocks` values
    if constexpr (is_dyn_scheme)
        blocks_length.resize(blocks, block_length);
    else
        blocks_length.fill(block_length);
 
    for (uint8_t block_id = 0; block_id < rest; ++block_id)
        ++blocks_length[block_id];
 
    for (uint8_t search_id = 0; search_id < search_scheme.size(); ++search_id)
    {
        auto const & search = search_scheme[search_id];
 
        auto & [search_blocks_length, start_pos] = result[search_id];
 
        // compute cumulative blocks_length and starting position
        start_pos = 0;
        if constexpr (is_dyn_scheme)
            search_blocks_length.resize(blocks);
        search_blocks_length[0] = blocks_length[search.pi[0] - 1];
        for (uint8_t i = 1; i < blocks; ++i)
        {
            search_blocks_length[i] = blocks_length[search.pi[i] - 1] + search_blocks_length[i - 1];
            if (search.pi[i] < search.pi[0])
                start_pos += search_blocks_length[i] - search_blocks_length[i - 1];
        }
    }
 
    return result;
}
 
// forward declaration
template <bool abort_on_hit, typename cursor_t, typename query_t, typename search_t, typename blocks_length_t,
          typename delegate_t>
inline bool search_ss(cursor_t cur, query_t & query,
                      typename cursor_t::size_type const lb, typename cursor_t::size_type const rb,
                      uint8_t const errors_spent, uint8_t const block_id, bool const go_right, search_t const & search,
                      blocks_length_t const & blocks_length, search_param const error_left, delegate_t && delegate);
 
template <bool abort_on_hit, typename cursor_t, typename query_t, typename search_t, typename blocks_length_t,
          typename delegate_t>
inline bool search_ss_exact(cursor_t cur, query_t & query,
                            typename cursor_t::size_type const lb, typename cursor_t::size_type const rb,
                            uint8_t const errors_spent, uint8_t const block_id, bool const go_right,
                            search_t const & search, blocks_length_t const & blocks_length,
                            search_param const error_left, delegate_t && delegate)
{
    using size_type = typename cursor_t::size_type;
 
    uint8_t const block_id2 = std::min<uint8_t>(block_id + 1, search.blocks() - 1);
    bool const go_right2 = (block_id < search.blocks() - 1) && (search.pi[block_id + 1] > search.pi[block_id]);
 
    if (go_right)
    {
        size_type const infix_lb = rb - 1; // inclusive
        size_type const infix_rb = lb + blocks_length[block_id] - 1; // exclusive
 
        if (!cur.extend_right(query | views::slice(infix_lb, infix_rb + 1)))
            return false;
 
        if (search_ss<abort_on_hit>(cur, query, lb, infix_rb + 2, errors_spent, block_id2, go_right2, search,
                                    blocks_length, error_left, delegate) && abort_on_hit)
        {
            return true;
        }
    }
    else
    {
        size_type const infix_lb = rb - blocks_length[block_id] - 1; // inclusive
        size_type const infix_rb = lb - 1; // inclusive
 
        if (!cur.extend_left(query | views::slice(infix_lb, infix_rb + 1)))
            return false;
 
        if (search_ss<abort_on_hit>(cur, query, infix_lb, rb, errors_spent, block_id2, go_right2, search, blocks_length,
                                    error_left, delegate) && abort_on_hit)
        {
            return true;
        }
    }
    return false;
}
 
template <bool abort_on_hit, typename cursor_t, typename query_t, typename search_t, typename blocks_length_t,
          typename delegate_t>
inline bool search_ss_deletion(cursor_t cur, query_t & query,
                               typename cursor_t::size_type const lb, typename cursor_t::size_type const rb,
                               uint8_t const errors_spent, uint8_t const block_id, bool const go_right,
                               search_t const & search, blocks_length_t const & blocks_length,
                               search_param const error_left, delegate_t && delegate)
{
    uint8_t const max_error_left_in_block = search.u[block_id] - errors_spent;
    uint8_t const min_error_left_in_block = std::max(search.l[block_id] - errors_spent, 0);
 
    // Switch to the next block when the min number of errors is reached
    if (min_error_left_in_block == 0)
    {
        uint8_t const block_id2 = std::min<uint8_t>(block_id + 1, search.blocks() - 1);
        bool const go_right2 = block_id2 == 0 ? true : search.pi[block_id2] > search.pi[block_id2 - 1];
 
        if (search_ss<abort_on_hit>(cur, query, lb, rb, errors_spent, block_id2, go_right2, search, blocks_length,
                                    error_left, delegate) && abort_on_hit)
        {
            return true;
        }
    }
 
    // Insert deletions into the current block as long as possible
    // Do not allow deletions at the beginning of the leftmost block
    // Do not allow deletions at the end of the rightmost block
    if (!(search.pi[block_id] == 1 && !go_right) &&
        !(search.pi[block_id] == search.blocks() && go_right) &&
        max_error_left_in_block > 0 && error_left.total > 0 && error_left.deletion > 0 &&
        ((go_right && cur.extend_right()) || (!go_right && cur.extend_left())))
    {
        search_param error_left2{error_left};
        error_left2.total--;
        error_left2.deletion--;
        do
        {
            if (search_ss_deletion<abort_on_hit>(cur, query, lb, rb, errors_spent + 1, block_id, go_right, search,
                                                 blocks_length, error_left2, delegate) && abort_on_hit)
            {
                return true;
            }
        } while ((go_right && cur.cycle_back()) || (!go_right && cur.cycle_front()));
    }
    return false;
}
 
template <bool abort_on_hit, typename cursor_t, typename query_t, typename search_t, typename blocks_length_t,
          typename delegate_t>
inline bool search_ss_children(cursor_t cur, query_t & query,
                               typename cursor_t::size_type const lb, typename cursor_t::size_type const rb,
                               uint8_t const errors_spent, uint8_t const block_id, bool const go_right,
                               uint8_t const min_error_left_in_block, search_t const & search,
                               blocks_length_t const & blocks_length, search_param const error_left,
                               delegate_t && delegate)
{
    using size_type = typename cursor_t::size_type;
    if ((go_right && cur.extend_right()) || (!go_right && cur.extend_left()))
    {
        size_type const chars_left = blocks_length[block_id] - (rb - lb - 1);
 
        size_type lb2 = lb - !go_right;
        size_type rb2 = rb + go_right;
 
        do
        {
            bool const delta = cur.last_rank() != to_rank(query[(go_right ? rb : lb) - 1]);
 
            // skip if there are more min errors left in the current block than characters in the block
            // i.e. chars_left - 1 < min_error_left_in_block - delta
            // TODO: move that outside the if / do-while struct
            // TODO: incorporate error_left.deletion into formula
            if (error_left.deletion == 0 && chars_left + delta < min_error_left_in_block + 1u)
                continue;
 
            if (!delta || error_left.substitution > 0)
            {
                search_param error_left2{error_left};
                error_left2.total -= delta;
                error_left2.substitution -= delta;
 
                // At the end of the current block
                if (rb - lb == blocks_length[block_id])
                {
                    // Leave the possibility for one or multiple deletions at the end of a block.
                    // Thus do not change the direction (go_right) yet.
                    if (error_left.deletion > 0)
                    {
                        if (search_ss_deletion<abort_on_hit>(cur, query, lb2, rb2, errors_spent + delta, block_id,
                                                             go_right, search, blocks_length, error_left2, delegate) &&
                            abort_on_hit)
                        {
                            return true;
                        }
                    }
                    else
                    {
                        uint8_t const block_id2 = std::min<uint8_t>(block_id + 1, search.blocks() - 1);
                        bool const go_right2 = block_id2 == 0 ? true : search.pi[block_id2] > search.pi[block_id2 - 1];
 
                        if (search_ss<abort_on_hit>(cur, query, lb2, rb2, errors_spent + delta, block_id2, go_right2,
                                                    search, blocks_length, error_left2, delegate) &&
                            abort_on_hit)
                        {
                            return true;
                        }
                    }
                }
                else
                {
                    if (search_ss<abort_on_hit>(cur, query, lb2, rb2, errors_spent + delta, block_id, go_right, search,
                                                blocks_length, error_left2, delegate) && abort_on_hit)
                    {
                        return true;
                    }
                }
            }
 
            // Deletion
            // TODO: check whether the conditions for deletions at the beginning/end of the query are really necessary
            // No deletion at the beginning of the leftmost block.
            // No deletion at the end of the rightmost block.
            if (error_left.deletion > 0 &&
                !(go_right && (rb == 1 || rb == std::ranges::size(query) + 1)) &&
                !(!go_right && (lb == 0 || lb == std::ranges::size(query))))
            {
                search_param error_left3{error_left};
                error_left3.total--;
                error_left3.deletion--;
                search_ss<abort_on_hit>(cur, query, lb, rb, errors_spent + 1, block_id, go_right, search, blocks_length,
                                        error_left3, delegate);
            }
        } while ((go_right && cur.cycle_back()) || (!go_right && cur.cycle_front()));
    }
    return false;
}
 
template <bool abort_on_hit, typename cursor_t, typename query_t, typename search_t,
          typename blocks_length_t, typename delegate_t>
inline bool search_ss(cursor_t cur, query_t & query,
                      typename cursor_t::size_type const lb, typename cursor_t::size_type const rb,
                      uint8_t const errors_spent, uint8_t const block_id, bool const go_right, search_t const & search,
                      blocks_length_t const & blocks_length, search_param const error_left, delegate_t && delegate)
{
    uint8_t const max_error_left_in_block = search.u[block_id] - errors_spent;
    uint8_t const min_error_left_in_block = std::max(search.l[block_id] - errors_spent, 0); // NOTE: changed
 
    // Done.
    if (min_error_left_in_block == 0 && lb == 0 && rb == std::ranges::size(query) + 1)
    {
        delegate(cur);
        return true;
    }
    // Exact search in current block.
    else if (((max_error_left_in_block == 0) && (rb - lb - 1 != blocks_length[block_id])) ||
             (error_left.total == 0 && min_error_left_in_block == 0))
    {
        if (search_ss_exact<abort_on_hit>(cur, query, lb, rb, errors_spent, block_id, go_right, search, blocks_length,
                                          error_left, delegate) && abort_on_hit)
        {
            return true;
        }
    }
    // Approximate search in current block.
    // i.e. blocks_length[block_id] - (rb - lb - (lb != rb)) >= min_error_left_in_block
    else if (error_left.total > 0)
    {
        // Insertion
        if (error_left.insertion > 0)
        {
            using size_type = typename cursor_t::size_type;
 
            size_type const lb2 = lb - !go_right;
            size_type const rb2 = rb + go_right;
 
            search_param error_left2{error_left};
            error_left2.total--;
            error_left2.insertion--;
            // At the end of the current block
            if (rb - lb == blocks_length[block_id])
            {
                // Leave the possibility for one or multiple deletions at the end of a block.
                // Thus do not change the direction (go_right) yet.
                // TODO: benchmark the improvement on preventing insertions followed by a deletion and vice versa. Does
                // it pay off the additional complexity and documentation for the user? (Note that the user might only
                // allow for insertions and deletion and not for mismatches).
                if (search_ss_deletion<abort_on_hit>(cur, query, lb2, rb2, errors_spent + 1, block_id, go_right, search,
                                                     blocks_length, error_left2, delegate) && abort_on_hit)
                {
                    return true;
                }
            }
            else
            {
                if (search_ss<abort_on_hit>(cur, query, lb2, rb2, errors_spent + 1, block_id, go_right, search,
                                            blocks_length, error_left2, delegate) && abort_on_hit)
                {
                    return true;
                }
            }
        }
        if (search_ss_children<abort_on_hit>(cur, query, lb, rb, errors_spent, block_id, go_right,
                                             min_error_left_in_block, search, blocks_length, error_left, delegate) &&
            abort_on_hit)
        {
            return true;
        }
    }
    return false;
}
 
template <bool abort_on_hit, typename index_t, typename query_t, typename search_scheme_t, typename delegate_t>
inline void search_ss(index_t const & index, query_t & query, search_param const error_left,
                      search_scheme_t const & search_scheme, delegate_t && delegate)
{
    // retrieve cumulative block lengths and starting position
    auto const block_info = search_scheme_block_info(search_scheme, std::ranges::size(query));
 
    for (uint8_t search_id = 0; search_id < search_scheme.size(); ++search_id)
    {
        auto const & search = search_scheme[search_id];
        auto const & [blocks_length, start_pos] = block_info[search_id];
 
        bool const hit = search_ss<abort_on_hit>(
                             index.cursor(),           // cursor on the index
                             query,                    // query to be searched
                             start_pos, start_pos + 1, // infix range already searched (open interval)
                                                       // the first character of `query` has the index 1 (not 0)
                             0,                        // errors spent
                             0,                        // current block id in search scheme
                             true,                     // search the first block from left to right
                             search, blocks_length,     // search scheme information
                             error_left,               // errors left (broken down by error types)
                             delegate                  // delegate function called on hit
                         );
 
        if (abort_on_hit && hit)
            return;
    }
}
 
template <typename configuration_t, typename index_t, typename ...policies_t>
template <bool abort_on_hit, typename query_t, typename delegate_t>
inline void search_scheme_algorithm<configuration_t, index_t, policies_t...>::search_algo_bi(
    query_t & query,
    search_param const error_left,
    delegate_t && delegate)
{
    switch (error_left.total)
    {
        case 0:
            search_ss<abort_on_hit>(*index_ptr, query, error_left, optimum_search_scheme<0, 0>, delegate);
            break;
        case 1:
            search_ss<abort_on_hit>(*index_ptr, query, error_left, optimum_search_scheme<0, 1>, delegate);
            break;
        case 2:
            search_ss<abort_on_hit>(*index_ptr, query, error_left, optimum_search_scheme<0, 2>, delegate);
            break;
        case 3:
            search_ss<abort_on_hit>(*index_ptr, query, error_left, optimum_search_scheme<0, 3>, delegate);
            break;
        default:
            auto const & search_scheme{compute_ss(0, error_left.total)};
            search_ss<abort_on_hit>(*index_ptr, query, error_left, search_scheme, delegate);
            break;
    }
}
 
} // namespace seqan3::detail