42 #include <initializer_list> 67 template <
typename basic_
string_t>
68 struct is_basic_string : std::false_type
73 template <
typename value_t,
typename traits_t,
typename allocator_t>
74 struct is_basic_string<
std::basic_string<value_t, traits_t, allocator_t>> : std::true_type
79 template <
typename basic_
string_t>
80 constexpr
bool is_basic_string_v = is_basic_string<basic_string_t>::value;
88 template <
typename type>
90 concept sequence_container_concept_modified_by_const_iterator = requires (type val, type val2)
92 { val.insert(val.cbegin(), val2.front()) } ->
typename type::iterator;
93 { val.insert(val.cbegin(),
typename type::value_type{}) } ->
typename type::iterator;
94 { val.insert(val.cbegin(),
typename type::size_type{},
typename type::value_type{})} ->
typename type::iterator;
95 { val.insert(val.cbegin(), val2.begin(), val2.end()) } ->
typename type::iterator;
96 requires is_basic_string_v<type> || requires(type val)
99 { val.insert(val.cbegin(), std::initializer_list<typename type::value_type>{}) } ->
typename type::iterator;
101 { val.erase(val.cbegin()) } ->
typename type::iterator;
102 { val.erase(val.cbegin(), val.cend()) } ->
typename type::iterator;
104 { val.insert(val.begin(),
typename type::size_type{},
typename type::value_type{}) } ->
typename type::iterator;
105 { val.insert(val.begin(), val2.begin(), val2.end()) } ->
typename type::iterator;
121 template<
typename string_t = std::
string>
122 constexpr
bool sequence_container_concept_modified_by_const_iterator_bug =
123 is_basic_string_v<string_t> && !sequence_container_concept_modified_by_const_iterator<string_t>;
149 template <
typename type>
151 concept container_concept = requires (type val, type val2, type
const cval,
typename type::iterator it)
154 typename type::value_type;
155 typename type::reference;
156 typename type::const_reference;
178 { type{type{}} } -> type;
179 { val = val2 } -> type &;
180 { (&val)->~type() } -> void;
182 { val.
begin() } ->
typename type::iterator;
183 { val.end() } ->
typename type::iterator;
184 { cval.begin() } ->
typename type::const_iterator;
185 { cval.end() } ->
typename type::const_iterator;
186 { val.cbegin() } ->
typename type::const_iterator;
187 { val.cend() } ->
typename type::const_iterator;
189 { val == val2 } -> bool;
190 { val != val2 } -> bool;
192 { val.swap(val2) } -> void;
193 { swap(val, val2) } -> void;
194 { std::swap(val, val2) } -> void;
196 { val.size() } ->
typename type::size_type;
197 { val.max_size() } ->
typename type::size_type;
198 { val.empty() } -> bool;
214 template <
typename type>
216 concept sequence_container_concept = requires (type val, type val2, type
const cval)
218 requires container_concept<type>;
221 { type{
typename type::size_type{},
typename type::value_type{}} };
222 { type{val2.begin(), val2.end()} };
223 { type{std::initializer_list<typename type::value_type>{}} };
224 { val = std::initializer_list<typename type::value_type>{} } -> type &;
227 { val.assign(val2.begin(), val2.end()) };
228 { val.assign(std::initializer_list<typename type::value_type>{}) };
229 { val.assign(
typename type::size_type{},
typename type::value_type{}) };
235 { val.insert(val.begin(), val2.front()) } ->
typename type::iterator;
236 { val.insert(val.begin(),
typename type::value_type{}) } ->
typename type::iterator;
238 { val.insert(val.begin(),
typename type::size_type{},
typename type::value_type{}) };
239 { val.insert(val.begin(), val2.begin(), val2.end()) };
241 { val.insert(val.begin(), std::initializer_list<typename type::value_type>{}) };
242 { val.erase(val.begin()) } ->
typename type::iterator;
243 { val.erase(val.begin(), val.end()) } ->
typename type::iterator;
246 requires detail::sequence_container_concept_modified_by_const_iterator_bug<type> ||
247 detail::sequence_container_concept_modified_by_const_iterator<type>;
249 { val.push_back(val.front()) } ->
void;
250 { val.push_back(
typename type::value_type{}) } ->
void;
251 { val.pop_back() } -> void;
252 { val.clear() } -> void;
255 { val.front() } ->
typename type::reference;
256 { val.front() } ->
typename type::const_reference;
257 { cval.front() } ->
typename type::const_reference;
258 { val.back() } ->
typename type::reference;
259 { val.back() } ->
typename type::const_reference;
260 { cval.back() } ->
typename type::const_reference;
278 template <
typename type>
280 concept random_access_container_concept = requires (type val)
282 requires sequence_container_concept<type>;
285 { val[0] } ->
typename type::reference;
286 { val.at(0) } ->
typename type::reference;
289 { val.resize(0) } -> void;
290 { val.resize(0,
typename type::value_type{}) } ->
void;
304 template <
typename type>
306 concept reservable_container_concept = requires (type val)
308 requires random_access_container_concept<type>;
310 { val.capacity() } ->
typename type::size_type;
311 { val.reserve(0) } -> void;
312 { val.shrink_to_fit() } -> void;
Provides C++20 additions to the <iterator> header.
SeqAn specific customisations in the standard namespace.
Definition: align_result.hpp:221
The main SeqAn3 namespace.
Definition: aligned_sequence_concept.hpp:58
Definition: aligned_sequence_concept.hpp:288
Provides C++20 additions to the type_traits header.