Package eu.scape_project.planning.model.beans

Examples of eu.scape_project.planning.model.beans.ResultNode

182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
        leafBeans = analyseResults.constructPlanReportLeaves();

        acceptableAlternatives = plan.getAcceptableAlternatives();

        aggMultResultNodes.clear();
        aggMultResultNodes.add(new ResultNode(plan.getTree().getRoot(), new WeightedMultiplication(), plan
            .getAlternativesDefinition().getConsideredAlternatives()));

        aggSumResultNodes.clear();
        // calculate result nodes for all considered alternatives
        ResultNode sumResultNode = new ResultNode(plan.getTree().getRoot(), new WeightedSum(), plan
            .getAlternativesDefinition().getConsideredAlternatives());
        aggSumResultNodes.add(sumResultNode);

        knockedoutAlternativePresent = acceptableAlternatives.size() != plan.getAlternativesDefinition()
            .getConsideredAlternatives().size();
View Full Code Here
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
            }
        }
        acceptableAlternatives = plan.getAcceptableAlternatives();

        aggMultResultNodes.clear();
        aggMultResultNodes.add(new ResultNode(plan.getTree().getRoot(), new WeightedMultiplication(), plan
            .getAlternativesDefinition().getConsideredAlternatives()));

        knockedoutAlternativePresent = acceptableAlternatives.size() != plan.getAlternativesDefinition()
            .getConsideredAlternatives().size();
        showAllConsideredAlternativesForWeightedSum = false;
        weightedSumResultTreeShownAlternatives = acceptableAlternatives;

        aggSumResultNodes.clear();
        // calculate result nodes for all considered alternatives
        ResultNode sumResultNode = new ResultNode(plan.getTree().getRoot(), new WeightedSum(), plan
            .getAlternativesDefinition().getConsideredAlternatives());
        aggSumResultNodes.add(sumResultNode);

        planetsExecutablePlanPrettyFormat = formatExecutablePlan(plan.getExecutablePlanDefinition().getExecutablePlan());
View Full Code Here
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
     *
     * @return List of acceptable alternatives.
     */
    public List<Alternative> getAcceptableAlternatives() {
        List<Alternative> acceptableAlternatives = new ArrayList<Alternative>();
        ResultNode multNode = new ResultNode(getTree().getRoot(), new WeightedMultiplication(),
            getAlternativesDefinition().getConsideredAlternatives());

        for (Alternative a : getAlternativesDefinition().getConsideredAlternatives()) {
            Double alternativeResult = multNode.getResults().get(a.getName());
            if (alternativeResult > 0.0) {
                acceptableAlternatives.add(a);
            }
        }
        return acceptableAlternatives;
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
        // Plans
        List<PlanInfo> plans = new ArrayList<PlanInfo>();
        // Plan1
        PlanInfo plan1 = mock(PlanInfo.class);
        when(plan1.getId()).thenReturn(1);
        ResultNode plan1ResultNode = mock(ResultNode.class);
        HashMap<String, Double> plan1Results = new HashMap<String, Double>();
        plan1Results.put("alternative1", 1d);
        plan1Results.put("alternative2", 3d);
        plan1Results.put("alternative3", 4.7d);
        when(plan1ResultNode.getResults()).thenReturn(plan1Results);
        when(plan1.getOverallResults()).thenReturn(plan1ResultNode);
        when(plan1.getWinningAlternative()).thenReturn("alternative3");
        plans.add(plan1);

        // Measures
View Full Code Here
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
        // Plans
        List<PlanInfo> plans = new ArrayList<PlanInfo>();
        // Plan1
        PlanInfo plan1 = mock(PlanInfo.class);
        when(plan1.getId()).thenReturn(1);
        ResultNode plan1ResultNode = mock(ResultNode.class);
        HashMap<String, Double> plan1Results = new HashMap<String, Double>();
        plan1Results.put("alternative1", 1d);
        plan1Results.put("alternative2", 3d);
        plan1Results.put("alternative3", 4.8d);
        when(plan1ResultNode.getResults()).thenReturn(plan1Results);
        when(plan1.getOverallResults()).thenReturn(plan1ResultNode);
        when(plan1.getWinningAlternative()).thenReturn("alternative3");
        plans.add(plan1);

        // Measures
View Full Code Here
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
        // Plans
        List<PlanInfo> plans = new ArrayList<PlanInfo>();
        // Plan1
        PlanInfo plan1 = mock(PlanInfo.class);
        when(plan1.getId()).thenReturn(1);
        ResultNode plan1ResultNode = mock(ResultNode.class);
        HashMap<String, Double> plan1Results = new HashMap<String, Double>();
        plan1Results.put("alternative1", 1d);
        plan1Results.put("alternative2", 2.5d);
        plan1Results.put("alternative3", 3.8d);
        when(plan1ResultNode.getResults()).thenReturn(plan1Results);
        when(plan1.getOverallResults()).thenReturn(plan1ResultNode);
        when(plan1.getWinningAlternative()).thenReturn("alternative3");
        plans.add(plan1);

        // Measures
View Full Code Here
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
        // Plans
        List<PlanInfo> plans = new ArrayList<PlanInfo>();
        // Plan1
        PlanInfo plan1 = mock(PlanInfo.class);
        when(plan1.getId()).thenReturn(1);
        ResultNode plan1ResultNode = mock(ResultNode.class);
        HashMap<String, Double> plan1Results = new HashMap<String, Double>();
        plan1Results.put("alternative1", 1d);
        plan1Results.put("alternative2", 2.1d);
        plan1Results.put("alternative3", 3.2d);
        when(plan1ResultNode.getResults()).thenReturn(plan1Results);
        when(plan1.getOverallResults()).thenReturn(plan1ResultNode);
        when(plan1.getWinningAlternative()).thenReturn("alternative3");
        plans.add(plan1);

        // Measures
View Full Code Here
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
        // Plans
        List<PlanInfo> plans = new ArrayList<PlanInfo>();
        // Plan1
        PlanInfo plan1 = mock(PlanInfo.class);
        when(plan1.getId()).thenReturn(1);
        ResultNode plan1ResultNode = mock(ResultNode.class);
        HashMap<String, Double> plan1Results = new HashMap<String, Double>();
        plan1Results.put("alternative1", 1d);
        plan1Results.put("alternative2", 3d);
        plan1Results.put("alternative3", 4.7d);
        when(plan1ResultNode.getResults()).thenReturn(plan1Results);
        when(plan1.getOverallResults()).thenReturn(plan1ResultNode);
        when(plan1.getWinningAlternative()).thenReturn("alternative3");
        plans.add(plan1);

        // Measures
View Full Code Here
219
220
221
222
223
224
225
226
227
228
229
        selectedPlans.clear();
        // We also need the scores of the alternatives - for each selected plan
        for (int pId : planSelection.getSelectedPlans()) {
            Plan plan = planManager.loadPlan(pId);
            ResultNode result = new ResultNode(plan.getTree().getRoot(), new WeightedSum(), plan
                .getAlternativesDefinition().getConsideredAlternatives());
            selectedPlans.add(new PlanInfo(pId, result, plan.getPlanProperties()));
        }
        // Init calculation classes
        this.calculator = new KBrowserCalculator(planLeaves, nrRelevantPlans);
View Full Code Here
TOP

Related Classes of eu.scape_project.planning.model.beans.ResultNode

  • eu.scape_project.planning.criteria.bean.KBrowser
  • eu.scape_project.planning.criteria.bean.RankChangingDominatedSetsTest
  • eu.scape_project.planning.model.Plan
  • eu.scape_project.planning.plato.wfview.full.AnalyseResultsView
  • eu.scape_project.planning.plato.wfview.full.ValidatePlanView
    • 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.