fm_index_cursor.hpp

Go to the documentation of this file.

// -----------------------------------------------------------------------------------------------------
// Copyright (c) 2006-2020, Knut Reinert & Freie Universität Berlin
// Copyright (c) 2016-2020, 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 <tuple>
#include <type_traits>
 
#include <seqan3/core/platform.hpp>
 
namespace seqan3::detail
{
 
template <typename index_t>
struct fm_index_cursor_node
{
    using size_type = typename index_t::size_type;
    using sdsl_char_type = typename index_t::sdsl_char_type;
 
    size_type lb;
    size_type rb;
    size_type depth;
    sdsl_char_type last_char;
 
    bool operator==(fm_index_cursor_node const & rhs) const
    {
        // NOTE: last_char is implementation specific for cycle_back().
        // lb, rb and depth already determine the node in the suffix tree.
        // Thus there is no need to compare last_char.
        return std::tie(lb, rb, depth) == std::tie(rhs.lb, rhs.rb, rhs.depth);
    }
 
    bool operator!=(fm_index_cursor_node const & rhs) const
    {
        return !(*this == rhs);
    }
};
 
// std::tuple get_suffix_array_range(fm_index_cursor<index_t> const & it)
// {
//     return {node.lb, node.rb};
// }
//
// std::tuple get_suffix_array_range(bi_fm_index_cursor<index_t> const & it)
// {
//     return {node.lb, node.rb};
// }
 
 
 
}