Build collections, returning the same ID for reused data spans. More...

#include <DedupeCollectionBuilder.hh>

Public Types
Type aliases
using	CollectionT = Collection< T, Ownership::value, MemSpace::host, I >

using	value_type = T

using	size_type = typename CollectionT::size_type

using	ItemIdT = typename CollectionT::ItemIdT

using	ItemRangeT = typename CollectionT::ItemRangeT

Public Member Functions
	DedupeCollectionBuilder (CollectionT *collection)
	Construct from a collection.

size_type	size () const
	Number of elements in the collection.

ItemIdT	size_id () const
	Get the size as an ID type.

void	reserve (std::size_t count)
	Reserve space for elements.

template<class InputIterator >
ItemRangeT	insert_back (InputIterator first, InputIterator last)

ItemRangeT	insert_back (std::initializer_list< value_type > init)
	Insert the given list of elements at the end of the allocation.

ItemIdT	push_back (value_type const &element)
	Add a new element to the end of the allocation.

template<class InputIterator >
auto	insert_back (InputIterator first, InputIterator last) -> ItemRangeT
	Insert the given list of elements at the end of the allocation.

Detailed Description

template<class T, class I = ItemId<T>>
class celeritas::DedupeCollectionBuilder< T, I >

Build collections, returning the same ID for reused data spans.

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

Public Types