--- /dev/null
+/*******************************************************************************\r
+ * Copyright (c) 2013 Association for Decentralized Information Management\r
+ * in Industry THTH ry.\r
+ * All rights reserved. This program and the accompanying materials\r
+ * are made available under the terms of the Eclipse Public License v1.0\r
+ * which accompanies this distribution, and is available at\r
+ * http://www.eclipse.org/legal/epl-v10.html\r
+ *\r
+ * Contributors:\r
+ * Semantum Oy - initial API and implementation\r
+ *******************************************************************************/\r
+package org.simantics.issues.common;\r
+\r
+import gnu.trove.map.hash.THashMap;\r
+import gnu.trove.set.hash.THashSet;\r
+\r
+import java.util.ArrayList;\r
+import java.util.Collection;\r
+import java.util.Collections;\r
+import java.util.List;\r
+import java.util.Map;\r
+\r
+import org.simantics.Simantics;\r
+import org.simantics.db.ReadGraph;\r
+import org.simantics.db.Resource;\r
+import org.simantics.db.common.request.ObjectsWithType;\r
+import org.simantics.db.common.request.QuaternaryRead;\r
+import org.simantics.db.exception.DatabaseException;\r
+import org.simantics.db.layer0.adapter.Instances;\r
+import org.simantics.issues.Severity;\r
+import org.simantics.issues.common.preferences.IssuePrefs;\r
+import org.simantics.issues.ontology.IssueResource;\r
+import org.simantics.layer0.Layer0;\r
+\r
+/**\r
+ * @author Tuukka Lehtonen\r
+ * @see CountModelIssuesBySeverity\r
+ */\r
+public class ListModelIssuesBySeverity extends QuaternaryRead<Resource, Boolean, Boolean, Severity, Map<Severity, List<Resource>>> {\r
+\r
+ public ListModelIssuesBySeverity(Resource model, boolean onlyUnresolved, boolean respectVisibility, Severity minSeverity) {\r
+ super(model, onlyUnresolved, respectVisibility, minSeverity);\r
+ }\r
+\r
+ @SuppressWarnings("unchecked")\r
+ @Override\r
+ public Map<Severity, List<Resource>> perform(ReadGraph graph) throws DatabaseException {\r
+ Layer0 L0 = Layer0.getInstance(graph);\r
+ IssueResource ISSUE = IssueResource.getInstance(graph);\r
+\r
+ Severity[] keys = Severity.values();\r
+ @SuppressWarnings("rawtypes")\r
+ List[] values = new List[keys.length];\r
+\r
+ Resource project = Simantics.getProjectResource();\r
+ boolean showHidden = false;\r
+ boolean showNormal = true;\r
+ boolean showUser = true;\r
+ if (parameter3 && project != null) {\r
+ showHidden = IssuePrefs.showHiddenIssues(graph, project);\r
+ showNormal = IssuePrefs.showNormalIssues(graph, project);\r
+ showUser = IssuePrefs.showUserIssues(graph, project);\r
+ }\r
+\r
+ Instances issueIndex = graph.getPossibleAdapter(ISSUE.Issue, Instances.class);\r
+ Collection<Resource> modelIssues = graph.syncRequest(new ObjectsWithType(parameter, L0.ConsistsOf, ISSUE.Issue));\r
+ Collection<Resource> indexedIssues = issueIndex != null ? issueIndex.find(graph, parameter) : Collections.<Resource>emptyList();\r
+ Collection<Resource> issues = !indexedIssues.isEmpty() ? new THashSet<Resource>(modelIssues.size() + indexedIssues.size()) : modelIssues;\r
+ if (!indexedIssues.isEmpty()) {\r
+ issues.addAll(modelIssues);\r
+ issues.addAll(indexedIssues);\r
+ }\r
+\r
+ final boolean ignoreResolved = parameter2;\r
+ for (Resource issue : issues) {\r
+ if (ignoreResolved && graph.hasStatement(issue, ISSUE.Resolved))\r
+ continue;\r
+ boolean hidden = graph.hasStatement(issue, ISSUE.Hidden);\r
+ boolean user = graph.hasStatement(issue, ISSUE.UserIssue);\r
+ boolean normal = !hidden && !user;\r
+ if (!showHidden && hidden)\r
+ continue;\r
+ if (!showUser && user)\r
+ continue;\r
+ if (!showNormal && normal)\r
+ continue;\r
+\r
+ Severity s = IssueUtils.toSeverity(ISSUE, graph.getPossibleObject(issue, ISSUE.Issue_HasSeverity));\r
+ if (null != s && s.compareTo(parameter4) <= 0) {\r
+ int index = s.ordinal();\r
+ @SuppressWarnings("rawtypes")\r
+ List list = values[index];\r
+ if (list == null)\r
+ list = values[index] = new ArrayList<Resource>();\r
+ list.add(issue);\r
+ }\r
+ }\r
+\r
+ THashMap<Severity, List<Resource>> result = new THashMap<Severity, List<Resource>>(values.length);\r
+ for (int i = 0; i < values.length; ++i)\r
+ if (values[i] != null)\r
+ result.put(keys[i], values[i]);\r
+ return result;\r
+ }\r
+\r
+}\r