mirror of
https://github.com/Z3Prover/z3
synced 2025-05-11 17:54:43 +00:00
56 lines
1.2 KiB
C++
56 lines
1.2 KiB
C++
/*++
|
|
Copyright (c) 2011 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
act_cache.h
|
|
|
|
Abstract:
|
|
|
|
expr -> expr activity cache
|
|
It maintains at most N unused entries
|
|
|
|
Author:
|
|
|
|
Leonardo (leonardo) 2011-04-12
|
|
|
|
Notes:
|
|
|
|
--*/
|
|
#ifndef ACT_CACHE_H_
|
|
#define ACT_CACHE_H_
|
|
|
|
#include "ast/ast.h"
|
|
#include "util/obj_hashtable.h"
|
|
#include "util/chashtable.h"
|
|
|
|
class act_cache {
|
|
ast_manager & m_manager;
|
|
typedef cmap<expr*, expr*, obj_ptr_hash<expr>, default_eq<expr*> > map;
|
|
map m_table;
|
|
ptr_vector<expr> m_queue; // recently created queue
|
|
unsigned m_qhead;
|
|
unsigned m_unused;
|
|
unsigned m_max_unused;
|
|
|
|
void compress_queue();
|
|
void init();
|
|
void dec_refs();
|
|
void del_unused();
|
|
|
|
public:
|
|
act_cache(ast_manager & m);
|
|
act_cache(ast_manager & m, unsigned max_unused);
|
|
~act_cache();
|
|
void insert(expr * k, expr * v);
|
|
expr * find(expr * k);
|
|
void reset();
|
|
void cleanup();
|
|
unsigned size() const { return m_table.size(); }
|
|
unsigned capacity() const { return m_table.capacity(); }
|
|
bool empty() const { return m_table.empty(); }
|
|
bool check_invariant() const;
|
|
|
|
};
|
|
|
|
#endif
|