Checkstyle clean up about 200 trivial violation

[yangtools.git] / common / util / src / main / java / org / opendaylight / yangtools / util / HashCodeBuilder.java

diff --git a/common/util/src/main/java/org/opendaylight/yangtools/util/HashCodeBuilder.java b/common/util/src/main/java/org/opendaylight/yangtools/util/HashCodeBuilder.java
index f629ee53a9bdbf0679f4a3b6165c86b2f07914b8..541ae5540c33d3fd3f108e030636c013a1d9e20b 100644 (file)
--- a/common/util/src/main/java/org/opendaylight/yangtools/util/HashCodeBuilder.java
+++ b/common/util/src/main/java/org/opendaylight/yangtools/util/HashCodeBuilder.java
@@ -17,14 +17,13 @@ import org.opendaylight.yangtools.concepts.Builder;
  */
 public final class HashCodeBuilder<T> implements Builder<Integer> {
     /**
-     *
      * The value 31 was chosen because it is an odd prime. If it were even and the multiplication
      * overflowed, information would be lost, as multiplication by 2 is equivalent to shifting. The
      * advantage of using a prime is less clear, but it is traditional. A nice property of 31 is
      * that the multiplication can be replaced by a shift and a subtraction for better performance:
      * 31 * i == (i << 5) - i. Modern VMs do this sort of optimization automatically.
      *
-     * (from Joshua Bloch's Effective Java, Chapter 3, Item 9: Always override hashcode when you
+     * <p>(from Joshua Bloch's Effective Java, Chapter 3, Item 9: Always override hashcode when you
      * override equals, page 48)
      */
     private static final int PRIME = 31;