1/* 2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; --- 208 unchanged lines hidden (view full) --- 217} 218 219// Returns true if the intersection of the two sets is non-empty 220bool 221NetDest::intersectionIsNotEmpty(const NetDest& other_netDest) const 222{ 223 assert(m_bits.size() == other_netDest.getSize()); 224 for (int i = 0; i < m_bits.size(); i++) { |
225 if (!m_bits[i].intersectionIsEmpty(other_netDest.m_bits[i])) { |
226 return true; 227 } 228 } 229 return false; 230} 231 232bool 233NetDest::isSuperset(const NetDest& test) const --- 42 unchanged lines hidden --- |