mirror of
https://github.com/Z3Prover/z3
synced 2026-06-11 03:15:36 +00:00
23c531a4c1
* Initial plan * Modernize C++ constructors to use C++11 default member initialization - Phase 1 Co-authored-by: nunoplopes <2998477+nunoplopes@users.noreply.github.com> * Fix theory_pb.h struct definition - move reset() back inside struct Co-authored-by: nunoplopes <2998477+nunoplopes@users.noreply.github.com> * Modernize C++ constructors to use C++11 default member initialization - Phase 2 Co-authored-by: nunoplopes <2998477+nunoplopes@users.noreply.github.com> * Fix opt_solver.h - revert rational initialization (complex type) Co-authored-by: nunoplopes <2998477+nunoplopes@users.noreply.github.com> * Modernize C++ constructors to use C++11 default member initialization - Phase 3 Co-authored-by: nunoplopes <2998477+nunoplopes@users.noreply.github.com> * Fix sparse_matrix.h - explicitly initialize union member in default constructor Co-authored-by: nunoplopes <2998477+nunoplopes@users.noreply.github.com> * Remove unnecessary default constructors when they're the only constructor Co-authored-by: nunoplopes <2998477+nunoplopes@users.noreply.github.com> --------- Co-authored-by: copilot-swe-agent[bot] <198982749+Copilot@users.noreply.github.com> Co-authored-by: nunoplopes <2998477+nunoplopes@users.noreply.github.com>
91 lines
2.4 KiB
C++
91 lines
2.4 KiB
C++
/*++
|
|
Copyright (c) 2006 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
expr_offset_map.h
|
|
|
|
Abstract:
|
|
|
|
A generic mapping from (expression, offset) to a value T.
|
|
|
|
Author:
|
|
|
|
Leonardo de Moura (leonardo) 2008-02-01.
|
|
|
|
Revision History:
|
|
|
|
--*/
|
|
#pragma once
|
|
|
|
#include "ast/substitution/expr_offset.h"
|
|
#include "util/vector.h"
|
|
|
|
/**
|
|
\brief A mapping from expr_offset to some value of type T.
|
|
*/
|
|
template<typename T>
|
|
class expr_offset_map {
|
|
struct data {
|
|
T m_data;
|
|
unsigned m_timestamp = 0;
|
|
};
|
|
vector<svector<data> > m_map;
|
|
unsigned m_timestamp;
|
|
public:
|
|
expr_offset_map():
|
|
m_timestamp(1) {}
|
|
|
|
bool contains(expr_offset const & n) const {
|
|
unsigned off = n.get_offset();
|
|
if (off < m_map.size()) {
|
|
svector<data> const & v = m_map[off];
|
|
unsigned id = n.get_expr()->get_id();
|
|
if (id < v.size())
|
|
return v[id].m_timestamp == m_timestamp;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
bool find(expr_offset const & n, T & r) const {
|
|
unsigned off = n.get_offset();
|
|
if (off < m_map.size()) {
|
|
svector<data> const & v = m_map[off];
|
|
unsigned id = n.get_expr()->get_id();
|
|
if (id < v.size() && v[id].m_timestamp == m_timestamp) {
|
|
r = v[id].m_data;
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
void insert(expr_offset const & n, T const & r) {
|
|
unsigned off = n.get_offset();
|
|
if (off >= m_map.size())
|
|
m_map.resize(off+1, svector<data>());
|
|
svector<data> & v = m_map[off];
|
|
unsigned id = n.get_expr()->get_id();
|
|
if (id >= v.size())
|
|
v.resize(id+1);
|
|
v[id].m_data = r;
|
|
v[id].m_timestamp = m_timestamp;
|
|
}
|
|
|
|
void reset() {
|
|
m_timestamp++;
|
|
if (m_timestamp == UINT_MAX) {
|
|
typename vector<svector<data> >::iterator it = m_map.begin();
|
|
typename vector<svector<data> >::iterator end = m_map.end();
|
|
for (; it != end; ++it) {
|
|
svector<data> & v = *it;
|
|
typename svector<data>::iterator it2 = v.begin();
|
|
typename svector<data>::iterator end2 = v.end();
|
|
for (; it2 != end2; ++it2)
|
|
it2->m_timestamp = 0;
|
|
}
|
|
m_timestamp = 1;
|
|
}
|
|
}
|
|
};
|
|
|