Whether a type behaves like a tuple.
More...
#include <seqan3/core/concept/tuple.hpp>

(Note that these are not member functions.)


You can expect these (meta)functions on all types that implement seqan3::tuple_like.

size_t  tuple_size_v 
 A unary type trait that holds the number of elements in the tuple. More...


 tuple_elment_t 
 A transformation trait that holds the type of elements in the tuple. More...


auto &&  get (type &&val) 
 Return the ith element of the tuple. More...


Whether a type behaves like a tuple.
Types that meet this concept are for example std::tuple, std::pair, std::array, seqan3::pod_tuple, seqan3::record. The std::totally_ordered will only be required if all types contained in the tuplelike data structure are themselves strict totally ordered.
◆ get()
auto && get< i > 
( 
type && 
val  ) 


related 
Return the ith element of the tuple.
 Template Parameters

i  The index of the element to return (of type size_t ). 
 Parameters

[in,out]  val  The tuplelike object to operate on. 
 Returns
 The ith value in the tuple.
 Attention
 This is a concept requirement, not an actual function (however types satisfying this concept will provide an implementation).

This constraint is not enforced since empty tuples are valid.
◆ tuple_elment_t()
A transformation trait that holds the type of elements in the tuple.
 Template Parameters

i  Index of the queried element type. 
type  The tuplelike type. 
 Attention
 This is a concept requirement, not an actual function (however types satisfying this concept will provide an implementation).

This constraint is not enforced since empty tuples are valid.
◆ tuple_size_v()
A unary type trait that holds the number of elements in the tuple.
 Template Parameters

 Attention
 This is a concept requirement, not an actual function (however types satisfying this concept will provide an implementation).
The documentation for this interface was generated from the following file: