繁体   English   中英

Java 8 - 按 Map 的键和值对列表进行排序

[英]Java 8 - Sort a List by Map's Key and Value

最终目标是对以下场景的列表进行排序:

我有一个枚举,其中 BLOCKER 是最高的严重性,而 MINOR 是最低的。

public enum Severity {
    MINOR(0)
    MAJOR(1),
    BLOCKER(2);

我有一个类 SeverityProfile

public class SeverityProfile {

    private final Map<Severity, Integer> severities;

    public SeverityProfile(Map<Severity, Integer> severities) {
        this.severities = Collections.unmodifiableMap(severities);
    }

    public Map<Severity, Integer> getSeverities() {
        return severities;
    }

主要对象 AggregatedData


public class AggregatedData {

 
    private final SeverityProfile severityProfile;
    ... other private variables

    public AggregatedData(SeverityProfile severityProfile) {

        this.severityProfile = severityProfile;
  
    }


    public SeverityProfile getSeverityProfile() {
        return severityProfile;
    }
    ... other getters
}

现在,我必须按地图的严重性对List<AggregatedData> aggregatedData进行排序。 aggregatedData.get(0).getSeverityProfile().getSeverities()有 BLOCKER - 1 和 MAJOR - 2 aggregatedData.get(1).getSeverityProfile().getSeverities()有 BLOCKER - 3 和 MAJOR - 2 和 MINOR - 4 aggregatedData.get(2).getSeverityProfile().getSeverities()有 MAJOR - 2 和 MINOR - 8 aggregatedData.get(3).getSeverityProfile().getSeverities()有 MAJOR - 5 和 MINOR - 10

如果我想要降序值,那么结果应该是:

  • aggregatedData.get(1) - BLOCKER - 3 和 MAJOR - 2 和 MINOR - 4
  • aggregatedData.get(0) - BLOCKER - 1 和 MAJOR - 2
  • aggregatedData.get(3) - MAJOR - 5 和 MINOR - 10
  • aggregatedData.get(2) - MAJOR - 2 和 MINOR - 8

(注意是 BLOCKER 的下一个优先级的 MAJOR 在 get(3) 中的计数高于 get(2))

我想做一个Collections.sort(aggregatedData, new Comparator<AggregatedData>() {

问题是,我必须比较Severity以及与之相关的值。 我不确定在这种情况下如何构造比较器。

回答我自己的问题:

public class SeverityProfile implements Comparable<SeverityProfile> {

    private final Map<Severity, Integer> severities;

    private final int[] counts;

    public SeverityProfile(Map<Severity, Integer> severities) {
        counts = new int[Severity.values().length];

        this.severities = Collections.unmodifiableMap(severities);

        counts[Severity.BLOCKER.ordinal()] = severities.getOrDefault(Severity.BLOCKER, 0);
        counts[Severity.MAJOR.ordinal()] = severities.getOrDefault(Severity.MAJOR, 0);
        counts[Severity.MINOR.ordinal()] = severities.getOrDefault(Severity.MINOR, 0);
    }


    public Map<Severity, Integer> getSeverities() {
        return severities;
    }

    public int[] getCounts() {
        return counts;
    }

    @Override
    public int compareTo(SeverityProfile other) {
        if (other == this) {
            return 0;
        }

        for (Severity severity : Severity.getSeveritiesByDescendingRank()) {
            if (getCounts()[severity.ordinal()] != other.getCounts()[severity.ordinal()]) {
                return getCounts()[severity.ordinal()] - other.getCounts()[severity.ordinal()];

            }
        }
        return 0;
    }
}

我在Collections.sort使用了compareTo并使用了上面的compareTo方法。

暂无
暂无

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM