3
* Author: Peter G. Jensen
5
* Created on 31 May 2017, 09:26
12
#include <unordered_set>
14
#include "MurmurHash2.h"
19
namespace PetriEngine {
20
namespace Simplification {
28
Vector* createAndCache(const std::vector<int>& data)
30
auto res = vectors.insert(Vector(data));
31
Vector& v = const_cast<Vector&>(*res.first);
33
// if(res.second) std::cout << "VECTORS : " << vectors.size() << std::endl;
34
// assert(v.refs() > 0);
38
void invalidate(const Vector& vector)
40
// vectors.erase(vector);
41
// assert(vector.refs() == 0);
46
// unordered_map does not invalidate on insert, only erase
47
std::unordered_set<Vector> vectors;
53
#endif /* LPFACTORY_H */