SeqAn3  3.0.0
The Modern C++ library for sequence analysis.
std::ContiguousIterator Interface Reference

The concept ContiguousIterator refines std::RandomAccessIterator by requiring that for every iterator i and distance n where (a + n) is a valid iterator *(a + n) is equivalent to *(std::addressof(*a) + n). More...

+ Inheritance diagram for std::ContiguousIterator:

Related Functions

(Note that these are not member functions.)

Requirements for std::Swappable

You can expect these functions on all types that implement std::Swappable.

void swap (t &lhs, t &rhs)
 Swaps the contents of two objects. More...
 
Requirements for std::EqualityComparable

You can expect these functions on all types that implement std::Equality_comparable.

bool operator== (type const &lhs, type const &rhs)
 (In-)Equality comparison. More...
 
bool operator!= (type const &lhs, type const &rhs)
 (In-)Equality comparison. More...
 
Requirements for std::StrictTotallyOrdered

You can expect these functions on all types that implement std::StrictTotallyOrdered.

bool operator< (type const &lhs, type const &rhs)
 Less-than, greater-than and -or-equal comparisons. More...
 
bool operator<= (type const &lhs, type const &rhs)
 Less-than, greater-than and -or-equal comparisons. More...
 
bool operator> (type const &lhs, type const &rhs)
 Less-than, greater-than and -or-equal comparisons. More...
 
bool operator>= (type const &lhs, type const &rhs)
 Less-than, greater-than and -or-equal comparisons. More...
 

Detailed Description

The concept ContiguousIterator refines std::RandomAccessIterator by requiring that for every iterator i and distance n where (a + n) is a valid iterator *(a + n) is equivalent to *(std::addressof(*a) + n).

See also
https://en.cppreference.com/w/cpp/iterator/ContiguousIterator

The documentation for this interface was generated from the following file: