src/mem/ruby/common/NetDest.cc
// Returns true if the intersection of the two sets is non-empty
Returns true if the intersection of the two sets is non-empty
Returns true if the intersection of the two sets is non - empty
bool
NetDest::intersectionIsNotEmpty(const NetDest& other_netDest) const
{
    assert(m_bits.size() == other_netDest.getSize());
    for (int i = 0; i < m_bits.size(); i++) {
        if (!m_bits[i].intersectionIsEmpty(other_netDest.m_bits[i])) {
            return true;
        }
    }
    return false;
}
bool NetDest :: intersectionIsNotEmpty ( const NetDest & other_netDest ) const { assert ( m_bits . size ( ) == other_netDest . getSize ( ) ) ; for ( int i = 0 ; i < m_bits . size ( ) ; i ++ ) { if ( ! m_bits [ i ] . intersectionIsEmpty ( other_netDest . m_bits [ i ] ) ) { return true ; } } return false ; }
Returns true if the intersection of the two sets is non-empty
Returns true if the intersection of the two sets is non - empty