forked from diffblue/cbmc
-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Object numbering: Remove duplication
- Loading branch information
Showing
1 changed file
with
19 additions
and
119 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -6,7 +6,6 @@ Author: Daniel Kroening, [email protected] | |
\*******************************************************************/ | ||
|
||
|
||
#ifndef CPROVER_UTIL_NUMBERING_H | ||
#define CPROVER_UTIL_NUMBERING_H | ||
|
||
|
@@ -18,39 +17,38 @@ Author: Daniel Kroening, [email protected] | |
#include <util/invariant.h> | ||
#include <util/optional.h> | ||
|
||
template <typename T> | ||
// NOLINTNEXTLINE(readability/identifiers) | ||
class numbering final | ||
/// \tparam Map a map from a key type to some numeric type | ||
template <typename Map> | ||
class template_numberingt final | ||
{ | ||
public: | ||
using number_type = std::size_t; // NOLINT | ||
using number_type = typename Map::mapped_type; // NOLINT | ||
using key_type = typename Map::key_type; // NOLINT | ||
|
||
private: | ||
using data_typet = std::vector<T>; // NOLINT | ||
using data_typet = std::vector<key_type>; // NOLINT | ||
data_typet data_; | ||
using numberst = std::map<T, number_type>; // NOLINT | ||
numberst numbers_; | ||
Map numbers_; | ||
|
||
public: | ||
using size_type = typename data_typet::size_type; // NOLINT | ||
using iterator = typename data_typet::iterator; // NOLINT | ||
using const_iterator = typename data_typet::const_iterator; // NOLINT | ||
|
||
number_type number(const T &a) | ||
number_type number(const key_type &a) | ||
{ | ||
std::pair<typename numberst::const_iterator, bool> result = numbers_.insert( | ||
std::pair<T, number_type>(a, number_type(numbers_.size()))); | ||
const auto result = numbers_.emplace(a, number_type(numbers_.size())); | ||
|
||
if(result.second) // inserted? | ||
{ | ||
data_.push_back(a); | ||
data_.emplace_back(a); | ||
INVARIANT(data_.size() == numbers_.size(), "vector sizes must match"); | ||
} | ||
|
||
return (result.first)->second; | ||
} | ||
|
||
optionalt<number_type> get_number(const T &a) const | ||
optionalt<number_type> get_number(const key_type &a) const | ||
{ | ||
const auto it = numbers_.find(a); | ||
if(it == numbers_.end()) | ||
|
@@ -66,16 +64,16 @@ class numbering final | |
numbers_.clear(); | ||
} | ||
|
||
size_t size() const | ||
size_type size() const | ||
{ | ||
return data_.size(); | ||
} | ||
|
||
T &operator[](size_type t) | ||
key_type &operator[](size_type t) | ||
{ | ||
return data_[t]; | ||
} | ||
const T &operator[](size_type t) const | ||
const key_type &operator[](size_type t) const | ||
{ | ||
return data_[t]; | ||
} | ||
|
@@ -107,109 +105,11 @@ class numbering final | |
} | ||
}; | ||
|
||
template <typename T, class hash_fkt> | ||
// NOLINTNEXTLINE(readability/identifiers) | ||
class hash_numbering final | ||
{ | ||
public: | ||
using number_type = unsigned int; // NOLINT | ||
|
||
private: | ||
using data_typet = std::vector<T>; // NOLINT | ||
data_typet data_; | ||
using numberst = std::unordered_map<T, number_type, hash_fkt>; // NOLINT | ||
numberst numbers_; | ||
|
||
public: | ||
using size_type = typename data_typet::size_type; // NOLINT | ||
using iterator = typename data_typet::iterator; // NOLINT | ||
using const_iterator = typename data_typet::const_iterator; // NOLINT | ||
|
||
number_type number(const T &a) | ||
{ | ||
std::pair<typename numberst::const_iterator, bool> result = numbers_.insert( | ||
std::pair<T, number_type>(a, number_type(numbers_.size()))); | ||
|
||
if(result.second) // inserted? | ||
{ | ||
this->push_back(a); | ||
assert(this->size() == numbers_.size()); | ||
} | ||
|
||
return (result.first)->second; | ||
} | ||
|
||
optionalt<number_type> get_number(const T &a) const | ||
{ | ||
const auto it = numbers_.find(a); | ||
template <typename Key> | ||
using numbering = template_numberingt<std::map<Key, std::size_t>>; // NOLINT | ||
|
||
if(it == numbers_.end()) | ||
{ | ||
return {}; | ||
} | ||
return it->second; | ||
} | ||
|
||
void clear() | ||
{ | ||
data_.clear(); | ||
numbers_.clear(); | ||
} | ||
|
||
template <typename U> | ||
void push_back(U &&u) | ||
{ | ||
data_.push_back(std::forward<U>(u)); | ||
} | ||
|
||
T &operator[](size_type t) | ||
{ | ||
return data_[t]; | ||
} | ||
const T &operator[](size_type t) const | ||
{ | ||
return data_[t]; | ||
} | ||
|
||
T &at(size_type t) | ||
{ | ||
return data_.at(t); | ||
} | ||
const T &at(size_type t) const | ||
{ | ||
return data_.at(t); | ||
} | ||
|
||
size_type size() const | ||
{ | ||
return data_.size(); | ||
} | ||
|
||
iterator begin() | ||
{ | ||
return data_.begin(); | ||
} | ||
const_iterator begin() const | ||
{ | ||
return data_.begin(); | ||
} | ||
const_iterator cbegin() const | ||
{ | ||
return data_.cbegin(); | ||
} | ||
|
||
iterator end() | ||
{ | ||
return data_.end(); | ||
} | ||
const_iterator end() const | ||
{ | ||
return data_.end(); | ||
} | ||
const_iterator cend() const | ||
{ | ||
return data_.cend(); | ||
} | ||
}; | ||
template <typename Key, typename Hash> | ||
using hash_numbering = // NOLINT | ||
template_numberingt<std::unordered_map<Key, std::size_t, Hash>>; | ||
|
||
#endif // CPROVER_UTIL_NUMBERING_H |