#endif
#define _WX_DECLARE_HASH_SET( KEY_T, HASH_T, KEY_EQ_T, CLASSNAME, CLASSEXP )\
- typedef WX_HASH_MAP_NAMESPACE::hash_set< KEY_T, HASH_T, KEY_EQ_T > CLASSNAME;
+ typedef WX_HASH_MAP_NAMESPACE::hash_set< KEY_T, HASH_T, KEY_EQ_T > CLASSNAME
#else // !wxUSE_STL || !defined(HAVE_STL_HASH_MAP)
CLASSEXP CLASSNAME:public CLASSNAME##_wxImplementation_HashTable \
{ \
public: \
+ _WX_DECLARE_PAIR( iterator, bool, Insert_Result, CLASSEXP ) \
+ \
wxEXPLICIT CLASSNAME( size_type hint = 100, hasher hf = hasher(), \
key_equal eq = key_equal() ) \
: CLASSNAME##_wxImplementation_HashTable( hint, hf, eq, \
CLASSNAME##_wxImplementation_KeyEx() ) {} \
\
- void insert( const key_type& key ) \
+ Insert_Result insert( const key_type& key ) \
{ \
- GetOrCreateNode( key ); \
+ bool created; \
+ Node *node = GetOrCreateNode( key, created ); \
+ return Insert_Result( iterator( node, this ), created ); \
} \
\
const_iterator find( const const_key_type& key ) const \
// be called (a decent compiler should give a warning about it, but don't
// count on it)!
#define WX_CLEAR_HASH_SET(type, hashset) \
- WX_CLEAR_HASH_MAP(type, hashset)
+ { \
+ type::iterator it, en; \
+ for( it = (hashset).begin(), en = (hashset).end(); it != en; ++it ) \
+ delete *it; \
+ (hashset).clear(); \
+ }
#endif // _WX_HASHSET_H_