2014-11-14 12:02:52 +01:00
|
|
|
/*
|
|
|
|
* This file is part of Applied Energistics 2.
|
2015-05-16 20:48:32 +02:00
|
|
|
* Copyright (c) 2013 - 2015, AlgorithmX2, All rights reserved.
|
2014-11-14 12:02:52 +01:00
|
|
|
*
|
|
|
|
* Applied Energistics 2 is free software: you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU Lesser General Public License as published by
|
|
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
|
|
* (at your option) any later version.
|
|
|
|
*
|
|
|
|
* Applied Energistics 2 is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
|
|
* along with Applied Energistics 2. If not, see <http://www.gnu.org/licenses/lgpl>.
|
|
|
|
*/
|
|
|
|
|
2013-12-27 23:59:59 +01:00
|
|
|
package appeng.util;
|
|
|
|
|
2022-12-02 17:40:47 +01:00
|
|
|
import java.util.Comparator;
|
2015-04-03 08:54:31 +02:00
|
|
|
|
2013-12-27 23:59:59 +01:00
|
|
|
import appeng.api.config.SortDir;
|
|
|
|
import appeng.api.storage.data.IAEItemStack;
|
2015-05-16 20:48:32 +02:00
|
|
|
import appeng.integration.IntegrationRegistry;
|
2014-07-24 00:26:23 +02:00
|
|
|
import appeng.integration.IntegrationType;
|
2014-02-27 08:10:11 +01:00
|
|
|
import appeng.integration.abstraction.IInvTweaks;
|
2014-08-06 06:30:59 +02:00
|
|
|
import appeng.util.item.AEItemStack;
|
2013-12-27 23:59:59 +01:00
|
|
|
|
2022-12-02 17:40:47 +01:00
|
|
|
public class ItemSorters {
|
|
|
|
private static SortDir Direction = SortDir.ASCENDING;
|
|
|
|
|
|
|
|
public static final Comparator<IAEItemStack> CONFIG_BASED_SORT_BY_NAME
|
|
|
|
= new Comparator<IAEItemStack>() {
|
|
|
|
@Override
|
|
|
|
public int compare(final IAEItemStack o1, final IAEItemStack o2) {
|
|
|
|
if (getDirection() == SortDir.ASCENDING) {
|
|
|
|
return Platform.getItemDisplayName(o1).compareToIgnoreCase(
|
|
|
|
Platform.getItemDisplayName(o2)
|
|
|
|
);
|
|
|
|
}
|
|
|
|
return Platform.getItemDisplayName(o2).compareToIgnoreCase(
|
|
|
|
Platform.getItemDisplayName(o1)
|
|
|
|
);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
public static final Comparator<IAEItemStack> CONFIG_BASED_SORT_BY_MOD
|
|
|
|
= new Comparator<IAEItemStack>() {
|
|
|
|
@Override
|
|
|
|
public int compare(final IAEItemStack o1, final IAEItemStack o2) {
|
|
|
|
final AEItemStack op1 = (AEItemStack) o1;
|
|
|
|
final AEItemStack op2 = (AEItemStack) o2;
|
|
|
|
|
|
|
|
if (getDirection() == SortDir.ASCENDING) {
|
|
|
|
return this.secondarySort(
|
|
|
|
op2.getModID().compareToIgnoreCase(op1.getModID()), o1, o2
|
|
|
|
);
|
|
|
|
}
|
|
|
|
return this.secondarySort(
|
|
|
|
op1.getModID().compareToIgnoreCase(op2.getModID()), o2, o1
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
private int secondarySort(
|
|
|
|
final int compareToIgnoreCase,
|
|
|
|
final IAEItemStack o1,
|
|
|
|
final IAEItemStack o2
|
|
|
|
) {
|
|
|
|
if (compareToIgnoreCase == 0) {
|
|
|
|
return Platform.getItemDisplayName(o2).compareToIgnoreCase(
|
|
|
|
Platform.getItemDisplayName(o1)
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
return compareToIgnoreCase;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
public static final Comparator<IAEItemStack> CONFIG_BASED_SORT_BY_SIZE
|
|
|
|
= new Comparator<IAEItemStack>() {
|
|
|
|
@Override
|
|
|
|
public int compare(final IAEItemStack o1, final IAEItemStack o2) {
|
|
|
|
if (getDirection() == SortDir.ASCENDING) {
|
|
|
|
return compareLong(o2.getStackSize(), o1.getStackSize());
|
|
|
|
}
|
|
|
|
return compareLong(o1.getStackSize(), o2.getStackSize());
|
|
|
|
}
|
|
|
|
};
|
|
|
|
private static IInvTweaks api;
|
|
|
|
public static final Comparator<IAEItemStack> CONFIG_BASED_SORT_BY_INV_TWEAKS
|
|
|
|
= new Comparator<IAEItemStack>() {
|
|
|
|
@Override
|
|
|
|
public int compare(final IAEItemStack o1, final IAEItemStack o2) {
|
|
|
|
if (api == null) {
|
|
|
|
return CONFIG_BASED_SORT_BY_NAME.compare(o1, o2);
|
|
|
|
}
|
|
|
|
|
|
|
|
final int cmp = api.compareItems(o1.getItemStack(), o2.getItemStack());
|
|
|
|
|
|
|
|
if (getDirection() == SortDir.ASCENDING) {
|
|
|
|
return cmp;
|
|
|
|
}
|
|
|
|
return -cmp;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
public static void init() {
|
|
|
|
if (api != null) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (IntegrationRegistry.INSTANCE.isEnabled(IntegrationType.InvTweaks)) {
|
|
|
|
api = (IInvTweaks
|
|
|
|
) IntegrationRegistry.INSTANCE.getInstance(IntegrationType.InvTweaks);
|
|
|
|
} else {
|
|
|
|
api = null;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
public static int compareInt(final int a, final int b) {
|
|
|
|
if (a == b) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
if (a < b) {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
public static int compareLong(final long a, final long b) {
|
|
|
|
if (a == b) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
if (a < b) {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
public static int compareDouble(final double a, final double b) {
|
|
|
|
if (a == b) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
if (a < b) {
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
private static SortDir getDirection() {
|
|
|
|
return Direction;
|
|
|
|
}
|
|
|
|
|
|
|
|
public static void setDirection(final SortDir direction) {
|
|
|
|
Direction = direction;
|
|
|
|
}
|
2013-12-27 23:59:59 +01:00
|
|
|
}
|