aboutsummaryrefslogtreecommitdiff
path: root/libjava/java/nio/LongBuffer.java
diff options
context:
space:
mode:
authorSven de Marothy <sven@physto.se>2004-09-21 15:50:13 +0200
committerAndreas Tobler <andreast@gcc.gnu.org>2004-09-21 15:50:13 +0200
commit9413382eec489236a06827e7dbff33975b249bb1 (patch)
treeadb823d7896f1493d35bab1cf7e20fb7b557415c /libjava/java/nio/LongBuffer.java
parentc6847e25b997c686563a537de5fb9eaa34568730 (diff)
downloadgcc-9413382eec489236a06827e7dbff33975b249bb1.zip
gcc-9413382eec489236a06827e7dbff33975b249bb1.tar.gz
gcc-9413382eec489236a06827e7dbff33975b249bb1.tar.bz2
ByteBuffer.java (hashCode): Implemented.
2004-09-21 Sven de Marothy <sven@physto.se> * java/nio/ByteBuffer.java (hashCode): Implemented. * java/nio/CharBuffer.java: Likewise. * java/nio/DoubleBuffer.java: Likewise. * java/nio/FloatBuffer.java: Likewise. * java/nio/LongBuffer.java: Likewise. * java/nio/IntBuffer.java: Likewise. * java/nio/ShortBuffer.java: Likewise. From-SVN: r87804
Diffstat (limited to 'libjava/java/nio/LongBuffer.java')
-rw-r--r--libjava/java/nio/LongBuffer.java20
1 files changed, 18 insertions, 2 deletions
diff --git a/libjava/java/nio/LongBuffer.java b/libjava/java/nio/LongBuffer.java
index c4066b1..6e9ef34 100644
--- a/libjava/java/nio/LongBuffer.java
+++ b/libjava/java/nio/LongBuffer.java
@@ -243,11 +243,27 @@ public abstract class LongBuffer extends Buffer
/**
* Calculates a hash code for this buffer.
+ *
+ * This is done with <code>long</code> arithmetic,
+ * where ** represents exponentiation, by this formula:<br>
+ * <code>s[position()] + 31 + (s[position()+1] + 30)*31**1 + ... +
+ * (s[limit()-1]+30)*31**(limit()-1)</code>.
+ * Where s is the buffer data. Note that the hashcode is dependent
+ * on buffer content, and therefore is not useful if the buffer
+ * content may change.
+ *
+ * @return the hash code (casted to int)
*/
public int hashCode ()
{
- // FIXME: Check what SUN calculates here.
- return super.hashCode ();
+ long hashCode = get(position()) + 31;
+ long multiplier = 1;
+ for (int i = position() + 1; i < limit(); ++i)
+ {
+ multiplier *= 31;
+ hashCode += (get(i) + 30)*multiplier;
+ }
+ return ((int)hashCode);
}
/**