Package eu.scape_project.planning.model.kbrowser

Examples of eu.scape_project.planning.model.kbrowser.CriteriaNode

42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
        CriteriaLeaf leaf2 = new CriteriaLeaf();
        leaf2.setName("leaf2");
        CriteriaLeaf leaf3 = new CriteriaLeaf();
        leaf3.setName("leaf3");

        CriteriaNode subNode = new CriteriaNode();
        subNode.setName("subNode");
        subNode.addChild(leaf1);
        subNode.addChild(leaf2);

        CriteriaNode rootNode = new CriteriaNode();
        rootNode.setName("rootNode");
        rootNode.addChild(subNode);
        rootNode.addChild(leaf3);

        // create criteria-hierarchy
        CriteriaHierarchy cHierarchy = new CriteriaHierarchy();
        cHierarchy.setName("hierarchy");
        cHierarchy.setCriteriaTreeRoot(rootNode);
View Full Code Here
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
        Measure textQualityCrit = new Measure();
        textQualityCrit.setUri("outcome://object/image/textQuality");
        leaf3.setMeasure(textQualityCrit);
        leaf3.setMapped(true);

        CriteriaNode subNode = new CriteriaNode();
        subNode.setName("subNode");
        subNode.addChild(leaf1);
        subNode.addChild(leaf2);

        CriteriaNode rootNode = new CriteriaNode();
        rootNode.setName("rootNode");
        rootNode.addChild(subNode);
        rootNode.addChild(leaf3);

        // create criteria-hierarchy
        CriteriaHierarchy cHierarchy = new CriteriaHierarchy();
        cHierarchy.setName("hierarchy");
        cHierarchy.setCriteriaTreeRoot(rootNode);
View Full Code Here
121
122
123
124
125
126
127
128
129
130
131
132
133
        CriteriaLeaf leaf1 = new CriteriaLeaf();
        leaf1.setName("leaf1");
        leaf1.setMapped(true);
        leaf1.setMeasure(null);

        CriteriaNode rootNode = new CriteriaNode();
        rootNode.setName("rootNode");
        rootNode.addChild(leaf1);

        // create criteria-hierarchy
        CriteriaHierarchy cHierarchy = new CriteriaHierarchy();
        cHierarchy.setName("hierarchy");
        cHierarchy.setCriteriaTreeRoot(rootNode);
View Full Code Here
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
        }
       
        return leaf;
      // Node
        } else {
            CriteriaNode node = new CriteriaNode();

            node.setName(TEXT);

            for (Node n : children) {
              node.addChild(n.createCriteriaTreeNode(criteriaManager));
            }

            return node;
        }
    }
View Full Code Here
106
107
108
109
110
111
112
113
114
115
116
117
                hierarchy.getCriteriaTreeRoot().setNrOfRelevantPlans(planSelection.getSelectedPlans().size());

                for (CriteriaTreeNode criteriaTreeNode : hierarchy.getCriteriaTreeRoot().getAllSuccessiveTreeNodes()) {
                    // assign relevant data to criteria nodes
                    if (criteriaTreeNode instanceof CriteriaNode) {
                        CriteriaNode criteriaNode = (CriteriaNode) criteriaTreeNode;
                        criteriaNode.setNrOfRelevantPlans(planSelection.getSelectedPlans().size());
                    }
                    // assign relevant data to criteria leaves
                    if (criteriaTreeNode instanceof CriteriaLeaf) {
                        CriteriaLeaf criteriaLeaf = (CriteriaLeaf) criteriaTreeNode;
                        criteriaLeaf.setNrOfRelevantPlans(planSelection.getSelectedPlans().size());
View Full Code Here
157
158
159
160
161
162
163
164
165
166
167
168
169
        // Create a new hierarchy with a new root tree node and persist it.
        CriteriaHierarchy hierarchy = new CriteriaHierarchy();
        hierarchy.setName(name);

        // Assign relevant data to criteria root node.
        CriteriaNode rootNode = new CriteriaNode(planSelection.getSelectedPlans().size());
        rootNode.setName(name);
        rootNode.setNrOfRelevantPlans(planSelection.getSelectedPlans().size());

        hierarchy.setCriteriaTreeRoot(rootNode);
        em.persist(hierarchy);

        log.debug("Created CriteriaHierarchy with name [{}].", name);
View Full Code Here
292
293
294
295
296
297
298
299
300
301
302
303
            hierarchy.getCriteriaTreeRoot().setNrOfRelevantPlans(planSelection.getSelectedPlans().size());

            for (CriteriaTreeNode criteriaTreeNode : hierarchy.getCriteriaTreeRoot().getAllSuccessiveTreeNodes()) {
                // assign relevant data to criteria nodes
                if (criteriaTreeNode instanceof CriteriaNode) {
                    CriteriaNode criteriaNode = (CriteriaNode) criteriaTreeNode;
                    criteriaNode.setNrOfRelevantPlans(planSelection.getSelectedPlans().size());
                }
                // assign relevant data to criteria leaves
                if (criteriaTreeNode instanceof CriteriaLeaf) {
                    CriteriaLeaf criteriaLeaf = (CriteriaLeaf) criteriaTreeNode;
                    criteriaLeaf.setNrOfRelevantPlans(planSelection.getSelectedPlans().size());
View Full Code Here
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
        ArrayList<String> sourceLabels = new ArrayList<String>();
        ArrayList<Double> potentialSeries = new ArrayList<Double>();
        ArrayList<Double> rangeSeries = new ArrayList<Double>();

        // Get root of tree
        CriteriaNode treeRoot = selectedCriteriaSet.getCriteriaTreeRoot();

        // Add data of root
        sourceLabels.add(treeRoot.getName());
        potentialSeries.add(treeRoot.getImportanceFactorSIF4());
        rangeSeries.add(treeRoot.getImportanceFactorSIF6());

        // Add data of other structural nodes
        for (CriteriaTreeNode criteriaTreeNode : treeRoot.getAllSuccessiveTreeNodes()) {
            if (criteriaTreeNode instanceof CriteriaNode) {
                CriteriaNode criteriaNode = (CriteriaNode) criteriaTreeNode;
                sourceLabels.add(criteriaNode.getName());
                potentialSeries.add(criteriaNode.getImportanceFactorSIF4());
                rangeSeries.add(criteriaNode.getImportanceFactorSIF6());
            }
        }

        // Set data
        data.setSeriesLabels(seriesLabels);
View Full Code Here
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
        // Sort by SIF4
        Collections.sort(criteriaSets, Collections.reverseOrder(new Comparator<CriteriaHierarchy>() {
            @Override
            public int compare(CriteriaHierarchy set1, CriteriaHierarchy set2) {

                CriteriaNode treeRoot1 = set1.getCriteriaTreeRoot();
                CriteriaNode treeRoot2 = set2.getCriteriaTreeRoot();

                Double comp1 = new Double(treeRoot1.getImportanceFactorSIF7());
                Double comp2 = new Double(treeRoot2.getImportanceFactorSIF7());
                return comp1.compareTo(comp2);
            }

        }));

        // Create data object
        PotentialToRangeData data = new PotentialToRangeData();
        // Title
        data.setTitle("Maximum Impact to Average Impact");
        data.setSourcesTitle("Criteria sets");

        data.setFormatString("%.3f");

        // Label of series
        ArrayList<String> seriesLabels = new ArrayList<String>();
        seriesLabels.add("Maximum Impact");
        seriesLabels.add("Average Impact");

        // Data lists for criteria sets
        ArrayList<String> sourceLabels = new ArrayList<String>();
        ArrayList<Double> potentialSeries = new ArrayList<Double>();
        ArrayList<Double> rangeSeries = new ArrayList<Double>();

        for (CriteriaHierarchy criteriaSet : criteriaSets) {

            log.debug("Adding potential and range of node " + criteriaSet.getName());

            // Source label
            sourceLabels.add(criteriaSet.getName());

            // Get root of tree
            CriteriaNode treeRoot = criteriaSet.getCriteriaTreeRoot();

            // Add values
            potentialSeries.add(treeRoot.getImportanceFactorSIF7());
            rangeSeries.add(treeRoot.getImportanceFactorSIF6());
        }

        // Set data
        data.setSeriesLabels(seriesLabels);
        data.setSourceLabels(sourceLabels);
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
        ArrayList<String> sourceLabels = new ArrayList<String>();
        ArrayList<Double> potentialSeries = new ArrayList<Double>();
        ArrayList<Double> rangeSeries = new ArrayList<Double>();

        // Get root of tree
        CriteriaNode treeRoot = selectedCriteriaSet.getCriteriaTreeRoot();

        // Add data of root
        sourceLabels.add(treeRoot.getName());
        potentialSeries.add(treeRoot.getImportanceFactorSIF4());
        rangeSeries.add(treeRoot.getImportanceFactorSIF6());

        // Add data of other structural nodes
        for (CriteriaTreeNode criteriaTreeNode : treeRoot.getAllSuccessiveTreeNodes()) {
            if (criteriaTreeNode instanceof CriteriaNode) {
                CriteriaNode criteriaNode = (CriteriaNode) criteriaTreeNode;
                sourceLabels.add(criteriaNode.getName());
                potentialSeries.add(criteriaNode.getImportanceFactorSIF4());
                rangeSeries.add(criteriaNode.getImportanceFactorSIF6());
            }
        }

        // Set data
        data.setSeriesLabels(seriesLabels);
View Full Code Here
TOP

Related Classes of eu.scape_project.planning.model.kbrowser.CriteriaNode

  • eu.scape_project.planning.criteria.bean.CriteriaHierarchyHelperBean
  • eu.scape_project.planning.criteria.bean.CriteriaSetsFullView
  • eu.scape_project.planning.criteria.bean.CriteriaSetsSummaryView
  • eu.scape_project.planning.criteria.bean.ManageCriteriaSets
  • eu.scape_project.planning.criteria.xml.CriteriaHierarchyExporter
  • eu.scape_project.planning.xml.freemind.Node
  • eu.scape_project.pw.planning.criteria.xml.CriteriaHierarchyExporterTest
  • java.text.DecimalFormat
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.