summaryrefslogtreecommitdiff
path: root/ace/Hashable.inl
diff options
context:
space:
mode:
authorbala <balanatarajan@users.noreply.github.com>2001-12-10 21:48:59 +0000
committerbala <balanatarajan@users.noreply.github.com>2001-12-10 21:48:59 +0000
commitf01d9f24020077a7851ba3b9e379907a0fa32347 (patch)
tree4f00fe99639595a8bf15b1f637b532caa8bed86a /ace/Hashable.inl
parente75c6cfa29c521009305159a3148794369d4d975 (diff)
downloadATCD-f01d9f24020077a7851ba3b9e379907a0fa32347.tar.gz
ChangeLogTag: Mon Dec 10 15:39:22 2001 Balachandran Natarajan <bala@cs.wustl.edu>
Diffstat (limited to 'ace/Hashable.inl')
-rw-r--r--ace/Hashable.inl27
1 files changed, 27 insertions, 0 deletions
diff --git a/ace/Hashable.inl b/ace/Hashable.inl
new file mode 100644
index 00000000000..554c55a5d0a
--- /dev/null
+++ b/ace/Hashable.inl
@@ -0,0 +1,27 @@
+/* -*- C++ -*- */
+
+ACE_INLINE
+ACE_Hashable::ACE_Hashable (void)
+ : hash_value_ (0)
+{
+}
+
+ACE_INLINE
+ACE_Hashable::~ACE_Hashable (void)
+{
+}
+
+ACE_INLINE u_long
+ACE_Hashable::hash (void) const
+{
+ // In doing the check below, we take chance of paying a performance
+ // price when the hash value is zero. But, that will (hopefully)
+ // happen far less often than a non-zero value, so this caching
+ // strategy should pay off, esp. if hash computation is expensive
+ // relative to the simple comparison.
+
+ if (this->hash_value_ == 0)
+ ((ACE_Hashable *) this)->hash_value_ = this->hash_i ();
+
+ return this->hash_value_;
+}