#ifndef WeakGCMap_h
#define WeakGCMap_h
#include "Weak.h"
#include "WeakInlines.h"
#include <wtf/HashMap.h>
namespace JSC {
template<typename KeyArg, typename ValueArg, typename HashArg = typename DefaultHash<KeyArg>::Hash,
typename KeyTraitsArg = HashTraits<KeyArg>>
class WeakGCMap {
WTF_MAKE_FAST_ALLOCATED;
typedef Weak<ValueArg> ValueType;
typedef HashMap<KeyArg, ValueType, HashArg, KeyTraitsArg> HashMapType;
public:
typedef typename HashMapType::KeyType KeyType;
typedef typename HashMapType::AddResult AddResult;
typedef typename HashMapType::iterator iterator;
typedef typename HashMapType::const_iterator const_iterator;
explicit WeakGCMap(VM&);
~WeakGCMap();
ValueArg* get(const KeyType& key) const
{
return m_map.get(key);
}
AddResult set(const KeyType& key, ValueType value)
{
return m_map.set(key, WTFMove(value));
}
bool remove(const KeyType& key)
{
return m_map.remove(key);
}
void clear()
{
m_map.clear();
}
bool isEmpty() const
{
const_iterator it = m_map.begin();
const_iterator end = m_map.end();
while (it != end) {
if (it->value)
return true;
}
return false;
}
iterator find(const KeyType& key)
{
iterator it = m_map.find(key);
iterator end = m_map.end();
if (it != end && !it->value) return end;
return it;
}
const_iterator find(const KeyType& key) const
{
return const_cast<WeakGCMap*>(this)->find(key);
}
template<typename Functor>
void forEach(Functor functor)
{
for (auto& pair : m_map) {
if (pair.value)
functor(pair.key, pair.value.get());
}
}
bool contains(const KeyType& key) const
{
return find(key) != m_map.end();
}
void pruneStaleEntries();
private:
HashMapType m_map;
VM& m_vm;
};
}
#endif // WeakGCMap_h