Initial import of the CDE 2.1.30 sources from the Open Group.

cde/programs/dtmail/libDtMail/Common/ObjectKey.C

@@ -0,0 +1,116 @@
+/*
+ *+SNOTICE
+ *
+ *
+ *	$XConsortium: ObjectKey.C /main/4 1996/04/21 19:48:43 drk $
+ *
+ *	RESTRICTED CONFIDENTIAL INFORMATION:
+ *	
+ *	The information in this document is subject to special
+ *	restrictions in a confidential disclosure agreement bertween
+ *	HP, IBM, Sun, USL, SCO and Univel.  Do not distribute this
+ *	document outside HP, IBM, Sun, USL, SCO, or Univel wihtout
+ *	Sun's specific written approval.  This documment and all copies
+ *	and derivative works thereof must be returned or destroyed at
+ *	Sun's request.
+ *
+ *	Copyright 1993 Sun Microsystems, Inc.  All rights reserved.
+ *
+ *+ENOTICE
+ */
+
+#include <assert.h>
+#include <string.h>
+#include <DtMail/ObjectKey.hh>
+
+ObjectKey::ObjectKey(ObjectKeyType type)
+{
+    _type = strdup(type);
+    return;
+}
+
+ObjectKey::ObjectKey(ObjectKey & key)
+{
+    _type = strdup(key._type);
+}
+
+ObjectKey::~ObjectKey(void)
+{
+    delete _type;
+}
+
+#ifdef DEAD_WOOD
+int
+ObjectKey::operator==(ObjectKey &)
+{
+    assert(!"Pure virtual ObjectKey::operator== called");
+    return(0);
+}
+
+int
+ObjectKey::operator!=(ObjectKey &)
+{
+    assert(!"Pure virtual ObjectKey::operator!= called\n");
+    return(0);
+}
+
+int
+ObjectKey::operator<(ObjectKey &)
+{
+    assert(!"Pure virtual ObjectKey::operator< called\n");
+    return(0);
+}
+
+int
+ObjectKey::operator<=(ObjectKey &)
+{
+    assert(!"Pure virtual ObjectKey::operator<= called\n");
+    return(0);
+}
+
+int
+ObjectKey::operator>(ObjectKey &)
+{
+    assert(!"Pure virtual ObjectKey::operator> called\n");
+    return(0);
+}
+
+int
+ObjectKey::operator>=(ObjectKey &)
+{
+    assert(!"Pure virtual ObjectKey::operator>= called\n");
+    return(0);
+}
+
+HashVal
+ObjectKey::hashValue(void)
+{
+    assert(!"Pure virtual ObjectKey::hashValue called\n");
+    return(0);
+}
+#endif /* DEAD_WOOD */
+
+HashVal
+ObjectKey::genericHashValue(void * buf, int len)
+{
+    short * sbuf = (short *)buf;
+    int slen = len / 2;
+    HashVal hash = 0;
+
+    // Sum the bytes, 2 at a time. We will deal with fractional
+    // stuff after we do the main buffer.
+    //
+    for (int cur = 0; cur < slen; cur++) {
+	hash ^= sbuf[cur];
+    }
+
+    // If the length is not even, then we need to add the last
+    // byte to the high order bits of the hash value.
+    //
+    if ((len % 2)) {
+	hash ^= ((char *)buf)[len - 1] << 8;
+    }
+
+    if (hash < 0) hash = -hash;
+    return(hash);
+}