detail.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 <seqan3/alphabet/concept.hpp>
#include <seqan3/utility/concept/exposition_only/core_language.hpp>
#include <seqan3/utility/type_list/type_list.hpp>
#include <seqan3/utility/type_traits/lazy_conditional.hpp>
 
namespace seqan3::detail
{
 
// ------------------------------------------------------------------
// alphabet_tuple_like
// ------------------------------------------------------------------
 
template <typename t>
concept alphabet_tuple_like = requires
{
    requires t::seqan3_alphabet_tuple_like;
};
 
// ------------------------------------------------------------------
// required_types
// ------------------------------------------------------------------
 
template <typename t>
struct required_types
{
    using type = type_list<>;
};
 
template <typename t>
    requires requires { typename t::seqan3_required_types; }
struct required_types<t>
{
    using type = typename t::seqan3_required_types;
};
 
template <typename t>
using required_types_t = typename required_types<t>::type;
 
// ------------------------------------------------------------------
// recursive_required_types
// ------------------------------------------------------------------
 
//TODO: This can be replaced with metaprogramming magic once a few more functions land in list_traits.
 
template <typename t>
struct recursive_required_types
{
    using type = type_list<>;
};
 
template <typename t>
    requires requires
    {
        typename t::seqan3_recursive_required_types;
    }
struct recursive_required_types<t>
{
    using type = typename t::seqan3_recursive_required_types;
};
 
template <typename t>
using recursive_required_types_t = typename recursive_required_types<t>::type;
 
// ------------------------------------------------------------------
// Callable concept helpers for meta::invoke
// ------------------------------------------------------------------
 
template <typename T>
struct constructible_from
{
    template <typename type>
    using invoke = std::integral_constant<bool, std::is_constructible_v<type, T>>;
};
 
template <typename T>
struct implicitly_convertible_from
{
    template <typename type>
    using invoke = std::integral_constant<bool, implicitly_convertible_to<T, type>>;
};
 
template <typename T>
struct assignable_from
{
    template <typename type>
    using invoke = std::integral_constant<bool, weakly_assignable_from<type, T>>;
};
 
template <typename T>
struct weakly_equality_comparable_with_
{
    template <typename type>
    using invoke = std::integral_constant<bool, weakly_equality_comparable_with<type, T>>;
};
 
template <typename T>
struct weakly_ordered_with_
{
    template <typename type>
    using invoke = std::integral_constant<bool, weakly_ordered_with<type, T>>;
};
 
} // namespace seqan3::detail
 
// ------------------------------------------------------------------
// Forwards
// ------------------------------------------------------------------
 
namespace seqan3
{
 
// forward
template <typename ...alternative_types>
    requires (detail::writable_constexpr_alphabet<alternative_types> && ...) &&
             (std::regular<alternative_types> && ...) &&
             (sizeof...(alternative_types) >= 2)
class alphabet_variant;
 
template <typename derived_type,
          typename ...component_types>
    requires (detail::writable_constexpr_semialphabet<component_types> && ...) &&
             (std::regular<component_types> && ...)
class alphabet_tuple_base;
 
} // namespace seqan3