z3-z3-4.12.6.src.util.obj_pair_set.h Maven / Gradle / Ivy
/*++
Copyright (c) 2011 Microsoft Corporation
Module Name:
obj_pair_set.h
Abstract:
Author:
Leonardo de Moura (leonardo) 2011-04-19
Revision History:
--*/
#pragma once
#include "util/chashtable.h"
template
class obj_pair_set {
public:
typedef std::pair obj_pair;
protected:
struct hash_proc {
unsigned operator()(obj_pair const & p) const { return combine_hash(p.first->hash(), p.second->hash()); }
};
struct eq_proc {
bool operator()(obj_pair const & p1, obj_pair const & p2) const { return p1 == p2; }
};
typedef chashtable set;
set m_set;
public:
void insert(T1 * t1, T2 * t2) { m_set.insert(obj_pair(t1, t2)); }
void insert(obj_pair const & p) { m_set.insert(p); }
bool insert_if_not_there(T1 * t1, T2 * t2) { return m_set.insert_if_not_there2(obj_pair(t1, t2)); }
bool insert_if_not_there(obj_pair const & p) { return m_set.insert_if_not_there2(p); }
void erase(T1 * t1, T2 * t2) { m_set.erase(obj_pair(t1, t2)); }
void erase(obj_pair const & p) { m_set.erase(p); }
void remove(obj_pair const & p) { erase(p); }
bool contains(T1 * t1, T2 * t2) const { return m_set.contains(obj_pair(t1, t2)); }
bool contains(obj_pair const & p) const { return m_set.contains(p); }
void reset() { m_set.reset(); }
bool empty() const { return m_set.empty(); }
typedef typename chashtable::iterator iterator;
iterator begin() { return m_set.begin(); }
iterator end() { return m_set.end(); }
};