java.util.LinkedHashSet



Project JetBrains/intellij-community in file ...ovy.lang.psi.impl.synthetic.LightModifierList.java (2009-01-20)
@@ -21,7 +21,6 @@ import org.jetbrains.annotations.NotNull;
 import org.jetbrains.plugins.groovy.GroovyFileType;
 
 import java.util.Iterator;
-import java.util.LinkedHashSet;
 import java.util.Set;
 
 /**
@@ -30,7 +29,7 @@ import java.util.Set;
 public class LightModifierList extends LightElement implements PsiModifierList {
   private Set<String> myModifiers;
 
-  public LightModifierList(PsiManager manager, LinkedHashSet<String> modifiers) {
+  public LightModifierList(PsiManager manager, Set<String> modifiers) {
     super(manager, GroovyFileType.GROOVY_LANGUAGE);
     myModifiers = modifiers;
   }
Project jclouds/jclouds in file ...mrk.enterprisecloud.domain.vm.VirtualMachines.java (2011-12-15)
@@ -23,7 +23,6 @@ import com.google.common.collect.Sets;
 import javax.xml.bind.annotation.XmlElement;
 import javax.xml.bind.annotation.XmlRootElement;
 import java.util.Collections;
-import java.util.LinkedHashSet;
 import java.util.Set;
 
 import static com.google.common.base.Preconditions.checkNotNull;
@@ -81,7 +80,7 @@ public class VirtualMachines {
    }
 
    @XmlElement(name = "VirtualMachine")
-   private LinkedHashSet<VirtualMachine> virtualMachines = Sets.newLinkedHashSet();
+   private Set<VirtualMachine> virtualMachines = Sets.newLinkedHashSet();
    
    public Set<VirtualMachine> getVirtualMachines() {
       return Collections.unmodifiableSet(virtualMachines);
Project jclouds/legacy-jclouds in file ...mrk.enterprisecloud.domain.vm.VirtualMachines.java (2011-12-15)
@@ -23,7 +23,6 @@ import com.google.common.collect.Sets;
 import javax.xml.bind.annotation.XmlElement;
 import javax.xml.bind.annotation.XmlRootElement;
 import java.util.Collections;
-import java.util.LinkedHashSet;
 import java.util.Set;
 
 import static com.google.common.base.Preconditions.checkNotNull;
@@ -81,7 +80,7 @@ public class VirtualMachines {
    }
 
    @XmlElement(name = "VirtualMachine")
-   private LinkedHashSet<VirtualMachine> virtualMachines = Sets.newLinkedHashSet();
+   private Set<VirtualMachine> virtualMachines = Sets.newLinkedHashSet();
    
    public Set<VirtualMachine> getVirtualMachines() {
       return Collections.unmodifiableSet(virtualMachines);
Project wildfly/wildfly in file ...deployment.annotation.CompositeIndexProcessor.java (2012-09-20)
@@ -26,7 +26,6 @@ import java.util.ArrayDeque;
 import java.util.ArrayList;
 import java.util.Collection;
 import java.util.HashSet;
-import java.util.LinkedHashSet;
 import java.util.List;
 import java.util.Set;
 
@@ -80,7 +79,7 @@ public class CompositeIndexProcessor implements DeploymentUnitProcessor {
             }
         }
 
-        final Set<ResourceRoot> allResourceRoots = new LinkedHashSet<ResourceRoot>();
+        final List<ResourceRoot> allResourceRoots = new ArrayList<ResourceRoot>();
         final List<ResourceRoot> resourceRoots = deploymentUnit.getAttachmentList(Attachments.RESOURCE_ROOTS);
         for (ResourceRoot resourceRoot : resourceRoots) {
             // do not add child sub deployments to the composite index
Project grails/grails-core in file ...ovy.grails.plugins.DefaultGrailsPluginManager.java (2013-08-26)
@@ -39,7 +39,6 @@ import java.util.Collection;
 import java.util.Collections;
 import java.util.HashMap;
 import java.util.HashSet;
-import java.util.LinkedHashSet;
 import java.util.LinkedList;
 import java.util.List;
 import java.util.Map;
@@ -271,42 +270,42 @@ public class DefaultGrailsPluginManager extends AbstractGrailsPluginManager {
 
     protected List<GrailsPlugin> sortPlugins(List<GrailsPlugin> toSort) {
         /* http://en.wikipedia.org/wiki/Topological_sorting
-         * 
+         *
         * L ← Empty list that will contain the sorted nodes
          S ← Set of all nodes
-        
+
         function visit(node n)
             if n has not been visited yet then
                 mark n as visited
                 for each node m with an edge from n to m do
                     visit(m)
                 add n to L
-        
+
         for each node n in S do
             visit(n)
-        
+
          */
         List<GrailsPlugin> sortedPlugins = new ArrayList<GrailsPlugin>(toSort.size());
         Set<GrailsPlugin> visitedPlugins = new HashSet<GrailsPlugin>();
         Map<GrailsPlugin, List<GrailsPlugin>> loadOrderDependencies = resolveLoadDependencies(toSort);
-        
+
         for (GrailsPlugin plugin : toSort) {
             visitTopologicalSort(plugin, sortedPlugins, visitedPlugins, loadOrderDependencies);
         }
-        
+
         return sortedPlugins;
     }
 
     protected Map<GrailsPlugin, List<GrailsPlugin>> resolveLoadDependencies(List<GrailsPlugin> plugins) {
         Map<GrailsPlugin, List<GrailsPlugin>> loadOrderDependencies = new HashMap<GrailsPlugin, List<GrailsPlugin>>();
-        
+
         for (GrailsPlugin plugin : plugins) {
             if(plugin.getLoadAfterNames() != null) {
                 List<GrailsPlugin> loadDepsForPlugin = loadOrderDependencies.get(plugin);
                 if(loadDepsForPlugin==null) {
                     loadDepsForPlugin = new ArrayList<GrailsPlugin>();
                     loadOrderDependencies.put(plugin, loadDepsForPlugin);
-                }     
+                }
                 for(String pluginName : plugin.getLoadAfterNames()) {
                     GrailsPlugin loadAfterPlugin = getGrailsPlugin(pluginName);
                     if(loadAfterPlugin != null) {
@@ -328,7 +327,7 @@ public class DefaultGrailsPluginManager extends AbstractGrailsPluginManager {
         }
         return loadOrderDependencies;
     }
-    
+
     private void visitTopologicalSort(GrailsPlugin plugin, List<GrailsPlugin> sortedPlugins, Set<GrailsPlugin> visitedPlugins, Map<GrailsPlugin, List<GrailsPlugin>> loadOrderDependencies) {
         if(plugin != null && !visitedPlugins.contains(plugin)) {
             visitedPlugins.add(plugin);