diff options
| author | Nathan Binkert <nate@binkert.org> | 2010-06-01 11:38:56 -0700 |
|---|---|---|
| committer | Nathan Binkert <nate@binkert.org> | 2010-06-01 11:38:56 -0700 |
| commit | c1aabe8172215c293f3540bce08739b22871d538 (patch) | |
| tree | 598d2d86a2643bedcb4945f83d26666278fc5505 /src/mem/ruby/common/NetDest.cc | |
| parent | bb589d463b6f0d7b5024a90470547034e0ef5d1e (diff) | |
| download | gem5-c1aabe8172215c293f3540bce08739b22871d538.tar.xz | |
style: clean up ruby's Set class
Further cleanup should probably be done to make this class be non-Ruby
specific and put it in src/base.
There are probably several cases where this class is used, std::bitset
could be used instead.
Diffstat (limited to 'src/mem/ruby/common/NetDest.cc')
| -rw-r--r-- | src/mem/ruby/common/NetDest.cc | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/mem/ruby/common/NetDest.cc b/src/mem/ruby/common/NetDest.cc index f694af99b..509d0d223 100644 --- a/src/mem/ruby/common/NetDest.cc +++ b/src/mem/ruby/common/NetDest.cc @@ -222,7 +222,7 @@ 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].intersectionIsNotEmpty(other_netDest.m_bits[i])) { + if (!m_bits[i].intersectionIsEmpty(other_netDest.m_bits[i])) { return true; } } |