MDS/openide
1
0
Fork 0
mirror of https://gitflic.ru/project/openide/openide.git synced 2026-09-27 10:03:11 +07:00
Code Issues Packages Projects Releases Wiki Activity

LoadingOrder: use collections with predictable iteration order

Browse Source
This commit is contained in:
peter
2014-10-02 16:40:40 +02:00
parent de8cd04a9e
commit 3285d07157
1 changed files with 6 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files
platform/extensions/src/com/intellij/openapi/extensions/LoadingOrder.java
+6 -7
View File
@@ -56,8 +56,8 @@ public class LoadingOrder {
@NonNls private final String myName; // for debug only
private final boolean myFirst;
private final boolean myLast;
private final Set<String> myBefore = new HashSet<String>(2);
private final Set<String> myAfter = new HashSet<String>(2);
private final Set<String> myBefore = new LinkedHashSet<String>(2);
private final Set<String> myAfter = new LinkedHashSet<String>(2);
private LoadingOrder() {
myName = "ANY";
@@ -123,11 +123,10 @@ public class LoadingOrder {
public static void sort(@NotNull final List<? extends Orderable> orderable) {
// our graph is pretty sparse so do benefit from the fact
final Map<String, Orderable> map = ContainerUtil.newHashMap();
final Map<Orderable, LoadingOrder> cachedMap = ContainerUtil.newHashMap();
final Set<Orderable> first = ContainerUtil.newHashSet(1);
final Set<Orderable> hasBefore = ContainerUtil.newHashSet(orderable.size());
final Map<String, Orderable> map = ContainerUtil.newLinkedHashMap();
final Map<Orderable, LoadingOrder> cachedMap = ContainerUtil.newLinkedHashMap();
final Set<Orderable> first = new LinkedHashSet<Orderable>(1);
final Set<Orderable> hasBefore = new LinkedHashSet<Orderable>(orderable.size());
for (Orderable o : orderable) {
String id = o.getOrderId();
if (StringUtil.isNotEmpty(id)) map.put(id, o);