Formatting / javadocs

h2/src/main/org/h2/store/LobStorageBackend.java

@@ -440,7 +440,7 @@ public class LobStorageBackend implements LobStorageInterface {
             }
         }
     }
-    
+
     @Override
     public boolean isReadOnly() {
         return database.isReadOnly();

h2/src/main/org/h2/store/LobStorageFrontend.java

@@ -61,7 +61,7 @@ public class LobStorageFrontend implements LobStorageInterface {
         return new BufferedInputStream(new LobStorageRemoteInputStream(
                 handler, lob, hmac, byteCount));
     }
-    
+
     @Override
     public boolean isReadOnly() {
         return false;

h2/src/main/org/h2/store/LobStorageInterface.java

@@ -84,7 +84,7 @@ public interface LobStorageInterface {
 
     /**
      * Whether the storage is read-only
-     * 
+     *
      * @return true if yes
      */
     boolean isReadOnly();

h2/src/main/org/h2/store/LobStorageMap.java

@@ -196,7 +196,7 @@ public class LobStorageMap implements LobStorageInterface {
             return nextLobId++;
         }
     }
-    
+
     @Override
     public boolean isReadOnly() {
         return database.isReadOnly();

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

@@ -12,7 +12,7 @@ package org.h2.util;
 public abstract class HashBase {
 
     /**
-     * The maximum load, in percent. 
+     * The maximum load, in percent.
      * declared as long so we do long arithmetic so we don't overflow.
      */
     private static final long MAX_LOAD = 90;
@@ -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

@@ -47,7 +47,7 @@ public class IntIntHashMap extends HashBase {
         checkSizePut();
         internalPut(key, value);
     }
-    
+
     private void internalPut(int key, int value) {
         int index = getIndex(key);
         int plus = 1;
@@ -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]);
             }
         }
@@ -65,8 +66,8 @@ public class ValueHashMap<V> extends HashBase {
     public void put(Value key, V value) {
         checkSizePut();
         internalPut(key, value);
-    }   
-    
+    }
+
     private void internalPut(Value key, V value) {
         int index = getIndex(key);
         int plus = 1;

h2/src/main/org/h2/value/Value.java

@@ -1129,7 +1129,7 @@ public abstract class Value {
     /**
      * Create an independent copy of this value if needed, that will be bound to
      * a result. If the original row is removed, this copy is still readable.
-     * 
+     *
      * @return the value (this for small objects)
      */
     public Value copyToResult() {

h2/src/main/org/h2/value/ValueLobDb.java

@@ -491,7 +491,7 @@ public class ValueLobDb extends Value implements Value.ValueClob,
         if (s.isReadOnly()) {
             return this;
         }
-        return s.copyLob(this, LobStorageFrontend.TABLE_RESULT, 
+        return s.copyLob(this, LobStorageFrontend.TABLE_RESULT,
                 getPrecision());
     }