3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-07 09:55:19 +00:00
z3/src/util/scoped_ptr_vector.h
Nikolaj Bjorner 9ea1cf3c5c na
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
2020-04-25 13:13:25 -07:00

73 lines
2 KiB
C++

/*++
Copyright (c) 2011 Microsoft Corporation
Module Name:
scoped_ptr_vector.h
Abstract:
Basic template of scoped ptrs.
TODO: improve
Author:
Leonardo (leonardo) 2011-12-29
Notes:
--*/
#ifndef SCOPED_PTR_VECTOR_H_
#define SCOPED_PTR_VECTOR_H_
#include "util/vector.h"
#include "util/util.h"
template<typename T>
class scoped_ptr_vector {
ptr_vector<T> m_vector;
public:
~scoped_ptr_vector() { reset(); }
void reset() { std::for_each(m_vector.begin(), m_vector.end(), delete_proc<T>()); m_vector.reset(); }
void push_back(T * ptr) { m_vector.push_back(ptr); }
void pop_back() { SASSERT(!empty()); set(size()-1, nullptr); m_vector.pop_back(); }
T * back() const { return m_vector.back(); }
T * operator[](unsigned idx) const { return m_vector[idx]; }
T * get(unsigned idx, T* d = nullptr) const { return (0 <= idx && idx < m_vector.size()) ? (*this)[idx] : d; }
void set(unsigned idx, T * ptr) {
if (m_vector[idx] == ptr)
return;
dealloc(m_vector[idx]);
m_vector[idx] = ptr;
}
unsigned size() const { return m_vector.size(); }
bool empty() const { return m_vector.empty(); }
void resize(unsigned sz) {
if (sz < m_vector.size()) {
for (unsigned i = m_vector.size(); i-- > sz; )
dealloc(m_vector[i]);
m_vector.shrink(sz);
}
else {
for (unsigned i = m_vector.size(); i < sz; i++)
push_back(nullptr);
}
}
void reserve(unsigned sz) {
if (sz >= m_vector.size())
resize(sz);
}
//!< swap last element with given pointer
void swap_back(scoped_ptr<T> & ptr) {
SASSERT(!empty());
T * tmp = ptr.detach();
ptr = m_vector.back();
m_vector[m_vector.size()-1] = tmp;
}
typename ptr_vector<T>::const_iterator begin() const { return m_vector.begin(); }
typename ptr_vector<T>::const_iterator end() const { return m_vector.end(); }
};
#endif