Author: bago
Date: Mon Aug 22 14:27:05 2005
New Revision: 239254

URL: http://svn.apache.org/viewcvs?rev=239254&view=rev
Log:
Use LinkedList for queue handling instead of ArrayList (small optimization for 
large expansions)

Modified:
    james/server/trunk/src/java/org/apache/james/transport/LinearProcessor.java

Modified: 
james/server/trunk/src/java/org/apache/james/transport/LinearProcessor.java
URL: 
http://svn.apache.org/viewcvs/james/server/trunk/src/java/org/apache/james/transport/LinearProcessor.java?rev=239254&r1=239253&r2=239254&view=diff
==============================================================================
--- james/server/trunk/src/java/org/apache/james/transport/LinearProcessor.java 
(original)
+++ james/server/trunk/src/java/org/apache/james/transport/LinearProcessor.java 
Mon Aug 22 14:27:05 2005
@@ -37,6 +37,7 @@
 import java.io.StringWriter;
 import java.util.ArrayList;
 import java.util.Collection;
+import java.util.LinkedList;
 import java.util.List;
 import java.util.Random;
 import java.util.Iterator;
@@ -284,7 +285,7 @@
         for (int i = 0; i < unprocessed.length; i++) {
             // No need to use synchronization, as this is totally
             // local to the method
-            unprocessed[i] = new ArrayList();
+            unprocessed[i] = new LinkedList();
         }
 
         //Add the object to the bottom of the list



---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]

Reply via email to