refactoring

redisson/src/main/java/org/redisson/RedissonMultiLock.java

@@ -20,16 +20,13 @@ import java.util.Arrays;
 import java.util.Collection;
 import java.util.List;
 import java.util.ListIterator;
-import java.util.Queue;
 import java.util.concurrent.TimeUnit;
-import java.util.concurrent.atomic.AtomicReference;
 import java.util.concurrent.locks.Condition;
 import java.util.concurrent.locks.Lock;
 
 import org.redisson.api.RFuture;
 import org.redisson.api.RLock;
 
-import io.netty.util.concurrent.Future;
 import io.netty.util.internal.ThreadLocalRandom;
 
 /**
@@ -226,12 +223,4 @@ public class RedissonMultiLock implements Lock {
         throw new UnsupportedOperationException();
     }
 
-    protected boolean isLockFailed(Future<Boolean> future) {
-        return !future.isSuccess();
-    }
-
-    protected boolean isAllLocksAcquired(AtomicReference<RLock> lockedLockHolder, AtomicReference<Throwable> failed, Queue<RLock> lockedLocks) {
-        return lockedLockHolder.get() == null && failed.get() == null;
-    }
-
 }

redisson/src/main/java/org/redisson/RedissonRedLock.java

@@ -16,13 +16,9 @@
 package org.redisson;
 
 import java.util.List;
-import java.util.Queue;
-import java.util.concurrent.atomic.AtomicReference;
 
 import org.redisson.api.RLock;
 
-import io.netty.util.concurrent.Future;
-
 /**
  * RedLock locking algorithm implementation for multiple locks. 
  * It manages all locks as one.
@@ -58,14 +54,4 @@ public class RedissonRedLock extends RedissonMultiLock {
         unlockInner(locks);
     }
 
-    @Override
-    protected boolean isLockFailed(Future<Boolean> future) {
-        return false;
-    }
-    
-    @Override
-    protected boolean isAllLocksAcquired(AtomicReference<RLock> lockedLockHolder, AtomicReference<Throwable> failed, Queue<RLock> lockedLocks) {
-        return (lockedLockHolder.get() == null && failed.get() == null) || lockedLocks.size() >= minLocksAmount(locks);
-    }
-    
 }