WPILibC++
unspecified
|
SmallSet - This maintains a set of unique values, optimizing for the case when the set is small (less than N). More...
#include <SmallSet.h>
Public Types | |
using | size_type = size_t |
Public Member Functions | |
LLVM_NODISCARD bool | empty () const |
size_type | size () const |
size_type | count (const T &V) const |
count - Return 1 if the element is in the set, 0 otherwise. | |
std::pair< NoneType, bool > | insert (const T &V) |
insert - Insert an element into the set if it isn't already there. More... | |
template<typename IterT > | |
void | insert (IterT I, IterT E) |
bool | erase (const T &V) |
void | clear () |
SmallSet - This maintains a set of unique values, optimizing for the case when the set is small (less than N).
In this case, the set can be maintained with no mallocs. If the set gets large, we expand to using an std::set to maintain reasonable lookup times.
Note that this set does not provide a way to iterate over members in the set.
|
inline |
insert - Insert an element into the set if it isn't already there.
Returns true if the element is inserted (it was not in the set before). The first value of the returned pair is unused and provided for partial compatibility with the standard library self-associative container concept.