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; --- 261 unchanged lines hidden (view full) --- 270 for (int j = 0; j < m_bits[i].getSize(); j++) { 271 out << (bool) m_bits[i].isElement(j) << " "; 272 } 273 out << " - "; 274 } 275 out << "]"; 276} 277 |
278bool 279NetDest::isEqual(const NetDest& n) const 280{ 281 assert(m_bits.size() == n.m_bits.size()); 282 for (unsigned int i = 0; i < m_bits.size(); ++i) { 283 if (!m_bits[i].isEqual(n.m_bits[i])) 284 return false; 285 } 286 return true; 287} |