vector_indexed< T, less_pr, index_t > Class Template Reference

The functionality is the same as for container_set. More...

#include <seqpack.h>

Inheritance diagram for vector_indexed< T, less_pr, index_t >:

Collaboration diagram for vector_indexed< T, less_pr, index_t >:

Public Member Functions
std::size_t	insert_ind (typename base_t::iterator it, const T &elm)
	insert with it starting
std::size_t	insert_ind (const T &elm)
	the same with default starting
Public Member Functions inherited from container_set< T, cont_t, comp_pr >
std::size_t	insert_ind (iterator it, const T &elm)
	returns the number of elements between begin and the inserted element
std::size_t	insert_ind (const T &elm)
	the same with default starting

Detailed Description

template<class T, class less_pr = std::less<T>, class index_t = std::ptrdiff_t>
class vector_indexed< T, less_pr, index_t >

The functionality is the same as for container_set.

however, checking if element is duplicated is done by map which store indices in container_set::container as keys and unique values (groups of values) as values

---

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

• seqpack.h