summaryrefslogtreecommitdiff
path: root/node/Switch.hpp
diff options
context:
space:
mode:
authorAdam Ierymenko <adam.ierymenko@gmail.com>2017-07-17 14:21:09 -0700
committerAdam Ierymenko <adam.ierymenko@gmail.com>2017-07-17 14:21:09 -0700
commitb9e1d53d7ac4e8d19520e3063b194ee01f550198 (patch)
tree9aad6b77f36c7f221f5d6b660e6522fc3cfaae02 /node/Switch.hpp
parentab0806a036485979d60015a22a8e8831b68643a2 (diff)
downloadinfinitytier-b9e1d53d7ac4e8d19520e3063b194ee01f550198.tar.gz
infinitytier-b9e1d53d7ac4e8d19520e3063b194ee01f550198.zip
Minor cleanup.
Diffstat (limited to 'node/Switch.hpp')
-rw-r--r--node/Switch.hpp4
1 files changed, 2 insertions, 2 deletions
diff --git a/node/Switch.hpp b/node/Switch.hpp
index cebe9e67..346aaca3 100644
--- a/node/Switch.hpp
+++ b/node/Switch.hpp
@@ -222,8 +222,8 @@ private:
y = a2.toInt();
}
}
- inline unsigned long hashCode() const throw() { return ((unsigned long)x ^ (unsigned long)y); }
- inline bool operator==(const _LastUniteKey &k) const throw() { return ((x == k.x)&&(y == k.y)); }
+ inline unsigned long hashCode() const { return ((unsigned long)x ^ (unsigned long)y); }
+ inline bool operator==(const _LastUniteKey &k) const { return ((x == k.x)&&(y == k.y)); }
uint64_t x,y;
};
Hashtable< _LastUniteKey,uint64_t > _lastUniteAttempt; // key is always sorted in ascending order, for set-like behavior