BTree-based std::set-like container (but max size is space allocated) More...

#include "Molassembler/Temple/constexpr/BTree.h"

Include dependency graph for DynamicSet.h:

This graph shows which files directly or indirectly include this file:

Data Structures
class	Scine::Molassembler::Temple::DynamicSet< T, nItems, LessThanPredicate, EqualityPredicate >
	Tree-based set. More...

Namespaces
	Scine::Molassembler
	Central library namespace.

	Scine::Molassembler::Temple
	Template shorthands, optimizers and constexpr data types.

Functions
template<size_t nItems, typename T , template< typename, size_t > class ArrayType, class LessThanPredicate = std::less<T>, class EqualityPredicate = std::equal_to<T>>
constexpr DynamicSet< T, nItems, LessThanPredicate >	Scine::Molassembler::Temple::makeDynamicSet (const ArrayType< T, nItems > &array)
	Helper function to create a DynamicSet specifying only the maximum size.

Detailed Description

BTree-based std::set-like container (but max size is space allocated)

Copyright: This code is licensed under the 3-clause BSD license. Copyright ETH Zurich, Department of Chemistry and Applied Biosciences, Reiher Group. See LICENSE.txt for details. A constexpr fixed-maximum-size managed set so that the type signature does not change upon element insertion and deletion. STL parallel is std::set, with the difference that here the maximum number of elements must be known at compile time.

Data Structures