void pop_front();

void merge( forward_list& other ); (1)

template< class... Args > void emplace( Args&&... args

void reserve( size_type count );

iterator lower_bound( const Key& key ); (1)

template <class... Args> pair<iterator, bool> try_emplace(const

size_type max_size() const;

float max_load_factor() const; (1)

template< class T, class Alloc > struct uses_allocator<dynarray<T>

template< class Key, class T, class Hash, class KeyEqual, class