Formatting / javadocs

h2/src/main/org/h2/table/RegularTable.java

@@ -493,7 +493,8 @@ public class RegularTable extends TableBase {
             if (checkDeadlock) {
                 ArrayList<Session> sessions = checkDeadlock(session, null, null);
                 if (sessions != null) {
-                    throw DbException.get(ErrorCode.DEADLOCK_1, getDeadlockDetails(sessions, exclusive));
+                    throw DbException.get(ErrorCode.DEADLOCK_1,
+                            getDeadlockDetails(sessions, exclusive));
                 }
             } else {
                 // check for deadlocks from now on

h2/src/main/org/h2/util/DateTimeUtils.java

@@ -327,7 +327,8 @@ public class DateTimeUtils {
      * Calculate the milliseconds since 1970-01-01 (UTC) for the given date and
      * time (in the specified timezone).
      *
-     * @param tz the timezone of the parameters, or null for the default timezone
+     * @param tz the timezone of the parameters,
+ *              or null for the default timezone
      * @param year the absolute year (positive or negative)
      * @param month the month (1-12)
      * @param day the day (1-31)

h2/src/main/org/h2/util/HashBase.java

@@ -100,7 +100,8 @@ public abstract class HashBase {
      * @param newLevel the new level
      */
     protected void reset(int newLevel) {
-        // can't exceed 30 or we will generate a negative value for the "len" field
+        // can't exceed 30 or we will generate a negative value
+        // for the "len" field
         if (newLevel > 30) {
             throw new IllegalStateException("exceeded max size of hash table");
         }

h2/src/main/org/h2/util/IntIntHashMap.java

@@ -120,7 +120,8 @@ public class IntIntHashMap extends HashBase {
         for (int i = 0; i < oldKeys.length; i++) {
             int k = oldKeys[i];
             if (k != 0) {
-                // skip the checkSizePut so we don't end up accidentally recursing
+                // skip the checkSizePut so we don't end up
+                // accidentally recursing
                 internalPut(k, oldValues[i]);
             }
         }

h2/src/main/org/h2/util/ValueHashMap.java

@@ -46,7 +46,8 @@ public class ValueHashMap<V> extends HashBase {
         for (int i = 0; i < len; i++) {
             Value k = oldKeys[i];
             if (k != null && k != ValueNull.DELETED) {
-                // skip the checkSizePut so we don't end up accidentally recursing
+                // skip the checkSizePut so we don't end up
+                // accidentally recursing
                 internalPut(k, oldValues[i]);
             }
         }