Okay. While I don't share your concern about the exclusive lock, I kind of agree with the fact the contains() and remove() have a cost linear to the number of transactions. Actually, I don't think this is a big problem, b/c you usually don't have thousands of transactions present at any given time.
Anyway, I change the ArrayList to a HashSet() where lookup is constant. I'm running the testsuite right now, and if it passes I will check in my changes. Note that this affects other classes as well: ReplicationInterceptor, CacheStoreInterceptor and LockInterceptor. View the original post : http://www.jboss.org/index.html?module=bb&op=viewtopic&p=3880731#3880731 Reply to the post : http://www.jboss.org/index.html?module=bb&op=posting&mode=reply&p=3880731 ------------------------------------------------------- This SF.Net email is sponsored by: NEC IT Guy Games. How far can you shotput a projector? How fast can you ride your desk chair down the office luge track? If you want to score the big prize, get to know the little guy. Play to win an NEC 61" plasma display: http://www.necitguy.com/?r=20 _______________________________________________ JBoss-user mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/jboss-user
