You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@tapestry.apache.org by dr...@apache.org on 2011/06/16 22:46:06 UTC
svn commit: r1136666 -
/tapestry/tapestry5/trunk/tapestry-core/src/main/java/org/apache/tapestry5/tree/DefaultTreeModel.java
Author: drobiazko
Date: Thu Jun 16 20:46:06 2011
New Revision: 1136666
URL: http://svn.apache.org/viewvc?rev=1136666&view=rev
Log:
Removed usage of java.util.Deque which is available starting from jdk 1.6.
Modified:
tapestry/tapestry5/trunk/tapestry-core/src/main/java/org/apache/tapestry5/tree/DefaultTreeModel.java
Modified: tapestry/tapestry5/trunk/tapestry-core/src/main/java/org/apache/tapestry5/tree/DefaultTreeModel.java
URL: http://svn.apache.org/viewvc/tapestry/tapestry5/trunk/tapestry-core/src/main/java/org/apache/tapestry5/tree/DefaultTreeModel.java?rev=1136666&r1=1136665&r2=1136666&view=diff
==============================================================================
--- tapestry/tapestry5/trunk/tapestry-core/src/main/java/org/apache/tapestry5/tree/DefaultTreeModel.java (original)
+++ tapestry/tapestry5/trunk/tapestry-core/src/main/java/org/apache/tapestry5/tree/DefaultTreeModel.java Thu Jun 16 20:46:06 2011
@@ -14,17 +14,16 @@
package org.apache.tapestry5.tree;
-import java.util.Collections;
-import java.util.Deque;
-import java.util.LinkedList;
-import java.util.List;
-import java.util.Map;
-
import org.apache.tapestry5.ValueEncoder;
import org.apache.tapestry5.func.F;
import org.apache.tapestry5.func.Mapper;
import org.apache.tapestry5.ioc.internal.util.CollectionFactory;
+import java.util.Collections;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.Map;
+
/**
* A default implementation of TreeModel that starts with a {@link ValueEncoder} (for the element to string conversion),
* a {@link TreeModelAdapter}, and a list of root nodes.
@@ -156,7 +155,7 @@ public class DefaultTreeModel<T> impleme
if (result != null)
return result;
- Deque<TreeNode<T>> queue = new LinkedList<TreeNode<T>>(roots);
+ LinkedList<TreeNode<T>> queue = new LinkedList<TreeNode<T>>(roots);
while (!queue.isEmpty())
{