full()

template<typename Key, typename Value, typename Less = fl::less<Key>>

bool fl::SortedHeapMap< Key, Value, Less >::full ( ) const

inline

Definition at line 325 of file map.h.

{ return data.full(); }