--- old/src/share/classes/java/security/MessageDigest.java 2013-06-27 23:05:25.545546255 -0700 +++ new/src/share/classes/java/security/MessageDigest.java 2013-06-27 23:05:25.389546258 -0700 @@ -1,5 +1,5 @@ /* - * Copyright (c) 1996, 2011, Oracle and/or its affiliates. All rights reserved. + * Copyright (c) 1996, 2013, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it @@ -48,8 +48,8 @@ * updated, one of the {@link #digest() digest} methods should * be called to complete the hash computation. * - *

The digest method can be called once for a given number - * of updates. After digest has been called, the MessageDigest + *

The {@code digest} method can be called once for a given number + * of updates. After {@code digest} has been called, the MessageDigest * object is reset to its initialized state. * *

Implementations are free to implement the Cloneable interface. @@ -75,18 +75,18 @@ * several instances, if the number of digests is known in advance. * *

Note that this class is abstract and extends from - * MessageDigestSpi for historical reasons. + * {@code MessageDigestSpi} for historical reasons. * Application developers should only take notice of the methods defined in - * this MessageDigest class; all the methods in + * this {@code MessageDigest} class; all the methods in * the superclass are intended for cryptographic service providers who wish to * supply their own implementations of message digest algorithms. * *

Every implementation of the Java platform is required to support - * the following standard MessageDigest algorithms: + * the following standard {@code MessageDigest} algorithms: *

* These algorithms are described in the @@ -301,7 +301,7 @@ * @param offset the offset to start from in the array of bytes. * * @param len the number of bytes to use, starting at - * offset. + * {@code offset}. */ public void update(byte[] input, int offset, int len) { if (input == null) { @@ -326,8 +326,8 @@ /** * Update the digest using the specified ByteBuffer. The digest is - * updated using the input.remaining() bytes starting - * at input.position(). + * updated using the {@code input.remaining()} bytes starting + * at {@code input.position()}. * Upon return, the buffer's position will be equal to its limit; * its limit will not have changed. * @@ -365,7 +365,7 @@ * * @param len number of bytes within buf allotted for the digest * - * @return the number of bytes placed into buf + * @return the number of bytes placed into {@code buf} * * @exception DigestException if an error occurs. */ @@ -386,7 +386,7 @@ * Performs a final update on the digest using the specified array * of bytes, then completes the digest computation. That is, this * method first calls {@link #update(byte[]) update(input)}, - * passing the input array to the update method, + * passing the input array to the {@code update} method, * then calls {@link #digest() digest()}. * * @param input the input to be updated before the digest is @@ -492,7 +492,7 @@ * @return a clone if the implementation is cloneable. * * @exception CloneNotSupportedException if this is called on an - * implementation that does not support Cloneable. + * implementation that does not support {@code Cloneable}. */ public Object clone() throws CloneNotSupportedException { if (this instanceof Cloneable) { @@ -536,7 +536,7 @@ * @return a clone if the delegate is cloneable. * * @exception CloneNotSupportedException if this is called on a - * delegate that does not support Cloneable. + * delegate that does not support {@code Cloneable}. */ public Object clone() throws CloneNotSupportedException { if (digestSpi instanceof Cloneable) {