29#ifndef __MEM_RUBY_COMMON_NETDEST_HH__
30#define __MEM_RUBY_COMMON_NETDEST_HH__
99 void print(std::ostream& out)
const;
107 int vec_index = MachineType_base_level(
m.type);
108 assert(vec_index <
m_bits.size());
void add(MachineID newElement)
void remove(MachineID oldElement)
std::vector< NodeID > getAllDest()
NetDest AND(const NetDest &andNetDest) const
NetDest OR(const NetDest &orNetDest) const
bool isElement(MachineID element) const
bool isEqual(const NetDest &netDest) const
std::vector< Set > m_bits
void removeNetDest(const NetDest &netDest)
NodeID elementAt(MachineID index)
bool isSubset(const NetDest &test) const
void addNetDest(const NetDest &netDest)
void setNetDest(MachineType machine, const Set &set)
MachineID smallestElement() const
bool intersectionIsNotEmpty(const NetDest &other_netDest) const
bool intersectionIsEmpty(const NetDest &other_netDest) const
int vecIndex(MachineID m) const
bool isSuperset(const NetDest &test) const
NetDest & operator=(const Set &obj)
void print(std::ostream &out) const
NodeID bitIndex(NodeID index) const
std::ostream & operator<<(std::ostream &os, const BoolVec &myvector)
Copyright (c) 2024 - Pranith Kumar Copyright (c) 2020 Inria All rights reserved.