NetDest.hh (8608:02d7ac5fb855) | NetDest.hh (10004:5d8b72563869) |
---|---|
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; --- 52 unchanged lines hidden (view full) --- 61 void addRandom(); 62 void setNetDest(MachineType machine, const Set& set); 63 void remove(MachineID oldElement); 64 void removeNetDest(const NetDest& netDest); 65 void clear(); 66 void broadcast(); 67 void broadcast(MachineType machine); 68 int count() const; | 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; --- 52 unchanged lines hidden (view full) --- 61 void addRandom(); 62 void setNetDest(MachineType machine, const Set& set); 63 void remove(MachineID oldElement); 64 void removeNetDest(const NetDest& netDest); 65 void clear(); 66 void broadcast(); 67 void broadcast(MachineType machine); 68 int count() const; |
69 bool isEqual(const NetDest& netDest); | 69 bool isEqual(const NetDest& netDest) const; |
70 71 // return the logical OR of this netDest and orNetDest 72 NetDest OR(const NetDest& orNetDest) const; 73 74 // return the logical AND of this netDest and andNetDest 75 NetDest AND(const NetDest& andNetDest) const; 76 77 // Returns true if the intersection of the two netDests is non-empty --- 55 unchanged lines hidden --- | 70 71 // return the logical OR of this netDest and orNetDest 72 NetDest OR(const NetDest& orNetDest) const; 73 74 // return the logical AND of this netDest and andNetDest 75 NetDest AND(const NetDest& andNetDest) const; 76 77 // Returns true if the intersection of the two netDests is non-empty --- 55 unchanged lines hidden --- |