concept.hpp

Go to the documentation of this file.

// -----------------------------------------------------------------------------------------------------
// Copyright (c) 2006-2022, Knut Reinert & Freie Universität Berlin
// Copyright (c) 2016-2022, 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 <ranges>
 
#include <seqan3/core/platform.hpp>
 
namespace seqan3
{
template <typename type>
concept const_iterable_range =
    std::ranges::input_range<std::remove_const_t<type>> && std::ranges::input_range<type const>
    && (std::ranges::forward_range<std::remove_const_t<type>> == std::ranges::forward_range<type const>)
    && (std::ranges::bidirectional_range<std::remove_const_t<type>> == std::ranges::bidirectional_range<type const>)
    && (std::ranges::random_access_range<std::remove_const_t<type>> == std::ranges::random_access_range<type const>);
 
template <typename iterator_t>
concept pseudo_random_access_iterator = std::forward_iterator<iterator_t> && !
std::is_base_of_v<std::random_access_iterator_tag, typename std::iterator_traits<iterator_t>::iterator_category> &&
    std::totally_ordered<iterator_t> &&
        std::sized_sentinel_for<iterator_t, iterator_t> && requires (iterator_t i,
                                                                     iterator_t const j,
                                                                     std::iter_difference_t<iterator_t> const n) {
                                                               requires std::same_as<decltype(i += n), iterator_t &>;
                                                               requires std::same_as<decltype(j + n), iterator_t>;
                                                               requires std::same_as<decltype(n + j), iterator_t>;
                                                               requires std::same_as<decltype(--i), iterator_t &>;
                                                               requires std::same_as<decltype(i--), iterator_t>;
                                                               requires std::same_as<decltype(i -= n), iterator_t &>;
                                                               requires std::same_as<decltype(j - n), iterator_t>;
                                                               requires std::same_as<decltype(j[n]),
                                                                                     std::iter_reference_t<iterator_t>>;
                                                           };
 
template <typename rng_t>
concept pseudo_random_access_range =
    std::ranges::forward_range<rng_t> && pseudo_random_access_iterator<std::ranges::iterator_t<rng_t>>;
} // namespace seqan3