Sort over ArrayList is faster.

This commit is contained in:
MobiusDevelopment
2023-01-08 20:58:37 +00:00
parent 889075b9b2
commit 3b162f22e1
3 changed files with 6 additions and 9 deletions

View File

@@ -23,7 +23,6 @@ import java.sql.SQLException;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.logging.Level;
@@ -137,7 +136,7 @@ public class PrivateStoreHistoryManager
public List<ItemHistoryTransaction> getTopHighestItem()
{
final LinkedList<ItemHistoryTransaction> list = new LinkedList<>(_items);
final List<ItemHistoryTransaction> list = new ArrayList<>(_items);
list.sort(new SortByPrice());
return list;
}
@@ -157,7 +156,7 @@ public class PrivateStoreHistoryManager
}
}
final List<ItemHistoryTransaction> list = new LinkedList<>();
final List<ItemHistoryTransaction> list = new ArrayList<>();
map.forEach((itemID, transaction) -> list.add(transaction));
list.sort(new SortByQuantity());
return list;

View File

@@ -23,7 +23,6 @@ import java.sql.SQLException;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.logging.Level;
@@ -137,7 +136,7 @@ public class PrivateStoreHistoryManager
public List<ItemHistoryTransaction> getTopHighestItem()
{
final LinkedList<ItemHistoryTransaction> list = new LinkedList<>(_items);
final List<ItemHistoryTransaction> list = new ArrayList<>(_items);
list.sort(new SortByPrice());
return list;
}
@@ -157,7 +156,7 @@ public class PrivateStoreHistoryManager
}
}
final List<ItemHistoryTransaction> list = new LinkedList<>();
final List<ItemHistoryTransaction> list = new ArrayList<>();
map.forEach((itemID, transaction) -> list.add(transaction));
list.sort(new SortByQuantity());
return list;

View File

@@ -23,7 +23,6 @@ import java.sql.SQLException;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.logging.Level;
@@ -137,7 +136,7 @@ public class PrivateStoreHistoryManager
public List<ItemHistoryTransaction> getTopHighestItem()
{
final LinkedList<ItemHistoryTransaction> list = new LinkedList<>(_items);
final List<ItemHistoryTransaction> list = new ArrayList<>(_items);
list.sort(new SortByPrice());
return list;
}
@@ -157,7 +156,7 @@ public class PrivateStoreHistoryManager
}
}
final List<ItemHistoryTransaction> list = new LinkedList<>();
final List<ItemHistoryTransaction> list = new ArrayList<>();
map.forEach((itemID, transaction) -> list.add(transaction));
list.sort(new SortByQuantity());
return list;