29 #ifndef __MEM_RUBY_COMMON_NETDEST_HH__
30 #define __MEM_RUBY_COMMON_NETDEST_HH__
93 void print(std::ostream& out)
const;
101 int vec_index = MachineType_base_level(m.
type);
102 assert(vec_index <
m_bits.size());
119 #endif // __MEM_RUBY_COMMON_NETDEST_HH__
void addNetDest(const NetDest &netDest)
int vecIndex(MachineID m) const
NetDest & operator=(const Set &obj)
bool intersectionIsNotEmpty(const NetDest &other_netDest) const
bool isEqual(const NetDest &netDest) const
void add(MachineID newElement)
bool isElement(MachineID element) const
NetDest OR(const NetDest &orNetDest) const
void print(std::ostream &out) const
bool intersectionIsEmpty(const NetDest &other_netDest) const
NodeID bitIndex(NodeID index) const
void removeNetDest(const NetDest &netDest)
NetDest AND(const NetDest &andNetDest) const
bool isSubset(const NetDest &test) const
MachineID smallestElement() const
NodeID elementAt(MachineID index)
bool isSuperset(const NetDest &test) const
void setNetDest(MachineType machine, const Set &set)
std::vector< NodeID > getAllDest()
std::ostream & operator<<(std::ostream &out, const NetDest &obj)
std::vector< Set > m_bits