File size: 1,416 Bytes
8efb4bd | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 | /**
* \file BestKContainer.h
* \brief
*
* \authors Dina Schneidman
*
*/
#ifndef BESTKCONTAINER_H
#define BESTKCONTAINER_H
#include <unordered_map>
#include "BestK.h"
class BestKContainer : private std::vector<BestK *> {
public:
// N - subunit number
BestKContainer(int K) : K_(K) {}
~BestKContainer() {
for (auto it = begin(); it != end(); it++)
delete *it;
}
BestK *newBestK(BitId set) {
BestK *best = new BestK(K_);
push_back(best);
set2index_[set] = size() - 1;
return best;
}
bool isEmpty(const BitId set) const { return (set2index_.find(set) == set2index_.end()); }
// assumes BestK for set exists, can be checked with isEmpty
const BestK &operator[](const BitId set) const {
unsigned int index = set2index_.find(set)->second;
return *((std::vector<BestK *>)(*this))[index];
}
// assumes BestK for set exists
BestK &operator[](const BitId set) { return *((std::vector<BestK *>)(*this))[set2index_[set]]; }
private:
int K_;
// The long is a unique representation key for each SBB
// And it is the long type because we want to support more than 32 subunits
// int corresponds to an index in the vector that holds the BestK
std::unordered_map<BitId, unsigned int> set2index_;
};
#endif /* BESTKCONTAINER_H */
|