8#ifndef OPENFPM_DATA_SRC_VECTOR_VECTOR_MAP_ITERATOR_HPP_
9#define OPENFPM_DATA_SRC_VECTOR_VECTOR_MAP_ITERATOR_HPP_
16 template<
unsigned int p,
typename vector_type>
64 void set(
int d,
size_t sz)
100 return vect.template get<p>(
gk);
153 void set(
int d,
size_t sz)
199 template<
typename l
id>
243 void set(
int d,
size_t sz)
vector_key_iterator_ele & operator++()
Get the next element.
auto get() const -> decltype(vect.template get< p >(gk))
Get the actual key.
const vector_type & vect
Linearized end element.
void set(int d, size_t sz)
Set the dimension.
bool isNext() const
Check if there is the next element.
vector_key_iterator_ele(const vector_type &vect, size_t end, size_t start=0)
Constructor require the size of the vector.
vector_key_iterator_seq(openfpm::vector< lid > &dp)
Constructor require the sequence.
void set(int d, size_t sz)
Set the dimension.
size_t get() const
Get the actual key.
bool isNext() const
Check if there is the next element.
vector_key_iterator_seq< lid > & operator++()
Get the next element.
size_t end
Linearized end element.
void set(int d, size_t sz)
Set the dimension.
size_t get() const
Get the actual key.
vector_key_iterator(size_t end, size_t start=0)
Constructor require the size of the vector.
vector_key_iterator & operator++()
Get the next element.
bool isNext() const
Check if there is the next element.
Implementation of 1-D std::vector like structure.
convert a type into constant type