mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-05-09 00:35:47 +00:00
Code Activity

Z3 sources

Browse source 
Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
This commit is contained in:
Leonardo de Moura 2012-10-02 11:35:25 -07:00
parent 3f9edad676
commit e9eab22e5c
1186 changed files with 381859 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

50
lib/obj_pair_set.h Normal file
View file

@ -0,0 +1,50 @@
/*++
Copyright (c) 2011 Microsoft Corporation
Module Name:
obj_pair_set.h
Abstract:
<abstract>
Author:
Leonardo de Moura (leonardo) 2011-04-19
Revision History:
--*/
#ifndef _OBJ_PAIR_SET_H_
#define _OBJ_PAIR_SET_H_
#include"chashtable.h"
template<typename T1, typename T2>
class obj_pair_set {
public:
typedef std::pair<T1*, T2*> 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<obj_pair, hash_proc, eq_proc> set;
set m_set;
public:
obj_pair_set() {}
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) { return m_set.erase(obj_pair(t1, t2)); }
void erase(obj_pair const & p) { return m_set.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(); }
};
#endif