Public Types |
typedef ordered_vector< Key,
Compare >::iterator_0 | iterator_0 |
typedef ordered_vector< Key,
Compare >::value_type_0 | value_type_0 |
Public Member Functions |
|
| ov_set (TypeHandle type_handle=ov_set_type_handle) |
|
| ov_set (const Compare &compare, TypeHandle type_handle=ov_set_type_handle) |
|
| ov_set (const ov_set< Key, Compare > ©) |
|
iterator_0 | insert (iterator_0 position, const value_type_0 &key0) |
|
pair< iterator_0, bool > | insert (const value_type_0 &key0) |
|
ov_set< Key, Compare > & | operator= (const ov_set< Key, Compare > ©) |
| void | sort () |
| | Maps to sort_unique().
|
| bool | verify_list () const |
| | Maps to verify_list_unique().
|
template<class Key, class Compare = less<Key>>
class ov_set< Key, Compare >
A specialization of ordered_vector that emulates a standard STL set: one copy of each element is allowed.
Definition at line 277 of file ordered_vector.h.