This is an automated email from the ASF dual-hosted git repository.

markt pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/commons-pool.git

commit c67581593f1668cac625bf212c9405324c9b47d8
Author: Mark Thomas <[email protected]>
AuthorDate: Fri May 3 18:00:18 2019 +0100

    Clean-up. Whitespace. No functional change.
---
 .../java/org/apache/commons/pool2/impl/GenericKeyedObjectPool.java    | 4 ++--
 src/main/java/org/apache/commons/pool2/impl/LinkedBlockingDeque.java  | 2 +-
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git 
a/src/main/java/org/apache/commons/pool2/impl/GenericKeyedObjectPool.java 
b/src/main/java/org/apache/commons/pool2/impl/GenericKeyedObjectPool.java
index ab5950e..02f2154 100644
--- a/src/main/java/org/apache/commons/pool2/impl/GenericKeyedObjectPool.java
+++ b/src/main/java/org/apache/commons/pool2/impl/GenericKeyedObjectPool.java
@@ -1158,8 +1158,8 @@ public class GenericKeyedObjectPool<K, T> extends 
BaseGenericObjectPool<T>
                 lock.lock();
                 if (objectDeque.getCreateCount().get() == 0 && 
objectDeque.getNumInterested().get() == 0) {
                     // NOTE: Keys must always be removed from both poolMap and
-                    // poolKeyList at the same time while protected by
-                    // keyLock.writeLock()
+                    //       poolKeyList at the same time while protected by
+                    //       keyLock.writeLock()
                     poolMap.remove(k);
                     poolKeyList.remove(k);
                 }
diff --git 
a/src/main/java/org/apache/commons/pool2/impl/LinkedBlockingDeque.java 
b/src/main/java/org/apache/commons/pool2/impl/LinkedBlockingDeque.java
index a7dabc9..689e266 100644
--- a/src/main/java/org/apache/commons/pool2/impl/LinkedBlockingDeque.java
+++ b/src/main/java/org/apache/commons/pool2/impl/LinkedBlockingDeque.java
@@ -1147,7 +1147,7 @@ class LinkedBlockingDeque<E> extends AbstractQueue<E>
     public void clear() {
         lock.lock();
         try {
-            for (Node<E> f = first; f != null; ) {
+            for (Node<E> f = first; f != null;) {
                 f.item = null;
                 final Node<E> n = f.next;
                 f.prev = null;

Reply via email to