repr
0.1
Reconstructable string representations and more
Toggle main menu visibility
Main Page
Installation
Usage
Customization
Extending
FAQ
CI Results
Test
Benchmark
API Documentation
Namespace List
Namespace List
Namespace Members
All
_
a
c
d
e
f
g
i
l
m
n
o
p
r
s
t
u
v
w
Functions
_
a
c
d
e
f
g
i
l
m
n
o
r
s
t
u
v
w
Variables
Typedefs
Enumerations
Concept List
Class List
Class List
Class Index
Class Hierarchy
Class Members
All
_
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
q
r
s
t
u
v
w
~
Functions
_
a
c
e
f
g
i
l
m
n
o
p
r
s
t
v
w
~
Variables
a
b
c
d
e
f
g
i
k
l
m
n
o
p
q
r
s
t
u
v
Typedefs
a
c
d
e
f
g
h
l
m
p
r
s
t
u
v
w
Enumerations
Enumerator
Related Symbols
File List
File List
File Members
All
_
l
n
o
r
u
Variables
Macros
_
l
o
r
u
Examples
Source Code
•
All
Classes
Namespaces
Files
Functions
Variables
Typedefs
Enumerations
Enumerator
Friends
Macros
Pages
Concepts
Loading...
Searching...
No Matches
concepts.h
Go to the documentation of this file.
#pragma once
#include <
concepts
>
#include <
type_traits
>
#include <
string
>
namespace
librepr::detail
{
template
<
typename
T>
concept
pair_like
=
requires
(T t) {
t.first;
t.second;
requires
std::is_same_v
<
typename
T::first_type,
decltype
(t.first)>;
requires
std::is_same_v
<
typename
T::second_type,
decltype
(t.second)>;
};
concept
pair_like
=
requires
(T t) {
…
}
template
<
typename
T>
concept
has_repr_member
=
requires
(T
const
&
obj
) {
{
obj
.repr() } -> std::same_as<std::string>;
};
concept
has_repr_member
=
requires
(T
const
&
obj
) {
…
}
template
<
typename
T>
concept
is_scoped_enum
= !std::is_convertible_v<T, std::underlying_type_t<T>>;
template
<
typename
T, std::
size_t
N>
concept
is_tuple_element
=
requires
(T t) {
typename
std::tuple_element_t<N, std::remove_const_t<T>>;
{
get<N>
(t) } -> std::convertible_to<std::tuple_element_t<N, T>
const
&>;
};
concept
is_tuple_element
=
requires
(T t) {
…
}
template
<
typename
T>
concept
tuple_like
= !std::is_reference_v<T> &&
requires
{
typename
std::tuple_size<T>::type;
requires
std::same_as<
decltype
(std::tuple_size_v<T>),
size_t
>;
} && []<
std::size_t
...
I
>(
std::index_sequence
<
I
...>) {
return
(
is_tuple_element<T, I>
&& ...);
}(
std::make_index_sequence<std::tuple_size_v<T>
>{});
concept
tuple_like
= !std::is_reference_v<T> &&
requires
{
…
}
}
// namespace librepr::detail
include
librepr
util
concepts.h
Generated by
1.9.8, using the excellent
Doxygen Awesome
Theme