fl::back_insert_iterator< Container > Class Template Reference

Detailed Description

template<typename Container>
class fl::back_insert_iterator< Container >

Back insert iterator - an output iterator that inserts elements at the end of a container.

This is similar to std::back_insert_iterator and provides a convenient way to insert elements into containers that support push_back() (like fl::vector, fl::FixedVector, fl::InlinedVector).

Usage example:

fl::vector<int> vec;
auto inserter = fl::back_inserter(vec);
*inserter++ = 10;
*inserter++ = 20;
*inserter++ = 30;
// vec now contains [10, 20, 30]

Or use in algorithm-style iteration:

fl::vector<int> source = {1, 2, 3, 4, 5};
fl::vector<int> dest;
auto inserter = fl::back_inserter(dest);
for (auto it = source.begin(); it != source.end(); ++it) {
    *inserter++ = *it;
}
// dest now contains [1, 2, 3, 4, 5]

Definition at line 75 of file iterator.h.

#include <iterator.h>

Public Types
typedef Container	container_type
typedef Container::value_type	container_value_type
typedef void	difference_type
typedef void	iterator_category
typedef void	pointer
typedef void	reference
typedef void	value_type

Public Member Functions
	back_insert_iterator (Container &c) FL_NOEXCEPT
back_insert_iterator &	operator* () FL_NOEXCEPT
back_insert_iterator &	operator++ () FL_NOEXCEPT
back_insert_iterator	operator++ (int) FL_NOEXCEPT
template<typename T>
back_insert_iterator &	operator= (const T &value) FL_NOEXCEPT
template<typename T>
back_insert_iterator &	operator= (T &&value) FL_NOEXCEPT

Protected Attributes
Container *	container

---

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

• fl/stl/iterator.h