Libosmium
2.20.0
Fast and flexible C++ library for working with OpenStreetMap data
|
#include <item_iterator.hpp>
Public Types | |
using | iterator = ItemIterator< T > |
using | const_iterator = ItemIterator< const T > |
Public Member Functions | |
ItemIteratorRange (data_type first, data_type last) noexcept | |
iterator | begin () noexcept |
iterator | end () noexcept |
const_iterator | cbegin () const noexcept |
const_iterator | cend () const noexcept |
const_iterator | begin () const noexcept |
const_iterator | end () const noexcept |
std::size_t | size () const noexcept |
bool | empty () const noexcept |
Private Types | |
using | data_type = typename std::conditional< std::is_const< T >::value, const unsigned char *, unsigned char * >::type |
Private Attributes | |
data_type | m_begin |
data_type | m_end |
using osmium::memory::ItemIteratorRange< T >::const_iterator = ItemIterator<const T> |
|
private |
using osmium::memory::ItemIteratorRange< T >::iterator = ItemIterator<T> |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
Is this range empty?
Complexity: Linear in the number of items.
|
inlinenoexcept |
|
inlinenoexcept |
|
inlinenoexcept |
Return the number of items in this range.
Complexity: Linear in the number of items.
|
private |
|
private |