wrapper class for accessing contiguous data as a container of OrderedPairs; note that it does not own the underlying data
More...
#include <OrderedPair.hpp>
wrapper class for accessing contiguous data as a container of OrderedPairs; note that it does not own the underlying data
Definition at line 83 of file OrderedPair.hpp.
◆ OrderedPairContainerRef() [1/2]
pwiz::math::OrderedPairContainerRef::OrderedPairContainerRef |
( |
const void * |
begin, |
|
|
const void * |
end |
|
) |
| |
|
inline |
constructor for wrapping array of contiguous data
Definition at line 88 of file OrderedPair.hpp.
89 :
begin_(
reinterpret_cast<const OrderedPair*
>(
begin)),
90 end_(
reinterpret_cast<const OrderedPair*
>(
end))
◆ OrderedPairContainerRef() [2/2]
template<typename T >
pwiz::math::OrderedPairContainerRef::OrderedPairContainerRef |
( |
const std::vector< T > & |
v | ) |
|
|
inline |
template constructor for automatic conversion from vector; e.g.
vector<double>, vector<OrderedPair>, vector<CustomPair>
Definition at line 96 of file OrderedPair.hpp.
97 :
begin_(
reinterpret_cast<const OrderedPair*
>(&v[0])),
98 end_(
reinterpret_cast<const OrderedPair*
>(&v[0]+v.size()))
◆ begin()
◆ end()
◆ size()
size_t pwiz::math::OrderedPairContainerRef::size |
( |
| ) |
const |
|
inline |
◆ operator[]()
const OrderedPair& pwiz::math::OrderedPairContainerRef::operator[] |
( |
size_t |
index | ) |
const |
|
inline |
◆ const_iterator
const typedef OrderedPair* pwiz::math::OrderedPairContainerRef::const_iterator |
◆ begin_
const OrderedPair* pwiz::math::OrderedPairContainerRef::begin_ |
|
private |
◆ end_
const OrderedPair* pwiz::math::OrderedPairContainerRef::end_ |
|
private |
The documentation for this class was generated from the following file: