Method sort

ZezeJava/ZezeJava/src/main/java/Zeze/Game/Bag.java:282–298

(Comparator<Map.Entry<Integer, BItem>> comparison)

	}

	public final void sort(Comparator<Map.Entry<Integer, BItem>> comparison) {
		if (null == comparison)
			comparison = Comparator.comparingLong(x -> x.getValue().getId());

		@SuppressWarnings("unchecked")
		var sort = (Map.Entry<Integer, BItem>[])bean.getItems().entrySet().toArray(new Map.Entry[bean.getItems().size()]);
		Arrays.sort(sort, comparison);
		for (int i = 0; i < sort.length; ++i) {
			BItem copy = sort[i].getValue().copy();
			sort[i] = Map.entry(i, copy); // old item IsManaged. need Copy a new one.
		}
		bean.getItems().clear();
		var sortMap = new HashMap<Integer, BItem>();
		for (var s : sort)
			sortMap.put(s.getKey(), s.getValue());
		bean.getItems().putAll(sortMap); // use AddRange for performance
	}

	public static class Module extends AbstractBag {
		private final ConcurrentHashMap<String, Bag> bags = new ConcurrentHashMap<>();