[infinispan-commits] Infinispan SVN: r1452 - trunk/core/src/main/java/org/infinispan/util/concurrent.

[infinispan-commits at lists.jboss.org]

Author: vblagojevic at jboss.com
Date: 2010-02-04 10:22:46 -0500 (Thu, 04 Feb 2010)
New Revision: 1452

Modified:
   trunk/core/src/main/java/org/infinispan/util/concurrent/BufferedConcurrentHashMap.java
Log:
keep all assert checks until final release

Modified: trunk/core/src/main/java/org/infinispan/util/concurrent/BufferedConcurrentHashMap.java
===================================================================
--- trunk/core/src/main/java/org/infinispan/util/concurrent/BufferedConcurrentHashMap.java	2010-02-04 15:06:34 UTC (rev 1451)
+++ trunk/core/src/main/java/org/infinispan/util/concurrent/BufferedConcurrentHashMap.java	2010-02-04 15:22:46 UTC (rev 1452)
@@ -32,7 +32,6 @@
 import java.util.Set;
 import java.util.concurrent.ConcurrentLinkedQueue;
 import java.util.concurrent.ConcurrentMap;
-import java.util.concurrent.atomic.AtomicInteger;
 import java.util.concurrent.locks.ReentrantLock;
 
 /**
@@ -961,6 +960,7 @@
                     stack.put(e.hashCode(), e);
                 } else {
                     if (queue.size() < hirSizeLimit) {
+                        assert !queue.contains(e);
                         queue.addLast(e);
                     } else {
                         Set<HashEntry<K, V>> evicted = new HashSet<HashEntry<K, V>>();
@@ -976,6 +976,7 @@
                             e.transitionHIRResidentToLIRResident();
                             switchBottomostLIRtoHIRAndPrune(evicted);
                         } else {
+                            assert !queue.contains(e);
                             queue.addLast(e);
                         }
                         removeFromSegment(evicted);
@@ -998,6 +999,7 @@
                             seenFirstLIR = true;
                             i.remove();
                             next.transitionLIRResidentToHIRResident();
+                            assert !queue.contains(next);
                             queue.addLast(next);
                         } else {
                             break;