/***************************************************************************
*
* Copyright (c) 2011 **.com, Inc. All Rights Reserved
*
**************************************************************************/
/**
* @file auto_map.hpp
* @author zhujingwei(com@baidu.com)
* @date 2011/07/01 15:33:39
* @brief
*
**/
#ifndef __AUTO_MAP_H_
#define __AUTO_MAP_H_
#include <map>
using namespace std;
namespace util {
template <class Pointer>
class DefaultDeletor {
public:
DefaultDeletor() {}
void operator()(Pointer p) {
delete p;
}
};
template<class Key, class Value,
class Compare = less<Key>, class Allocator = allocator<pair<const Key, Value> >,
class Deletor = DefaultDeletor<Value> >
class auto_map : private std::map<Key, Value, Compare, Allocator> {
public:
/* 公有化std::map常用接口 */
using map<Key, Value, Compare, Allocator>::begin;
using map<Key, Value, Compare, Allocator>::end;
using map<Key, Value, Compare, Allocator>::insert;
using map<Key, Value, Compare, Allocator>::find;
explicit auto_map(const Compare& comp = Compare(), const Allocator& alloc = Allocator())
: map<Key, Value, Compare, Allocator>(comp, alloc) {}
virtual ~auto_map() {
clear();
}
void clear() {
node_free();
map<Key, Value, Compare, Allocator>::clear();
}
private:
Deletor deletor;
void node_free() {
typename map<Key, Value, Compare, Allocator>::iterator iter = map<Key, Value, Compare, Allocator>::begin();
for (; iter != map<Key, Value, Compare, Allocator>::end(); ++iter) {
deletor((*iter).second);
}
}
};
} // namespace util
#endif // __AUTO_MAP_H_