Package eu.scape_project.planning.model.kbrowser

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

113
114
115
116
117
118
119
120
121
        assertEquals(0, leaf.getActualOutputRange(), 0.001);
    }

    @Test
    public void getActualOutputRange_numericTransformer_average() {
        VPlanLeaf leaf = createLeafWithNumericTransformer(SampleAggregationMode.AVERAGE);

        assertEquals(0.6, leaf.getActualOutputRange(), 0.001);
    }
View Full Code Here
120
121
122
123
124
125
126
127
128
        assertEquals(0.6, leaf.getActualOutputRange(), 0.001);
    }

    @Test
    public void getActualOutputRange_numericTransformer_worst() {
        VPlanLeaf leaf = createLeafWithNumericTransformer(SampleAggregationMode.WORST);

        assertEquals(1, leaf.getActualOutputRange(), 0.001);
    }
View Full Code Here
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
    }

    // -------------------------- helper methods --------------------------

    private VPlanLeaf createLeafWithOrdinalTransformer(SampleAggregationMode aggregationMode) {
        VPlanLeaf leaf = new VPlanLeaf();

        // create simple transformer
        OrdinalTransformer ordinalTrans = new OrdinalTransformer();
        Map<String, TargetValueObject> mapping = new HashMap<String, TargetValueObject>();
        TargetValueObject tv0 = new TargetValueObject();
        TargetValueObject tv1 = new TargetValueObject();
        tv0.setValue(5);
        tv1.setValue(1);
        mapping.put("Y", tv0);
        mapping.put("N", tv1);
        ordinalTrans.setMapping(mapping);
        leaf.setTransformer(ordinalTrans);

        // set scale
        OrdinalScale ordinalScale = new OrdinalScale();
        ordinalScale.setRestriction("Yes/No");
        leaf.setScale(ordinalScale);

        // valueMap
        OrdinalValue yes = new OrdinalValue();
        yes.setValue("Y");
        OrdinalValue no = new OrdinalValue();
        no.setValue("N");

        Values valuesAlternative1 = new Values();
        Values valuesAlternative2 = new Values();
        valuesAlternative1.add(yes);
        valuesAlternative1.add(yes);
        valuesAlternative1.add(yes);
        valuesAlternative1.add(no);
        valuesAlternative2.add(no);
        valuesAlternative2.add(no);
        valuesAlternative2.add(no);
        valuesAlternative2.add(no);

        Map<String, Values> valueMap = new HashMap<String, Values>();
        valueMap.put("alt1", valuesAlternative1);
        valueMap.put("alt2", valuesAlternative2);
        leaf.setValueMap(valueMap);

        leaf.setAggregationMode(aggregationMode);
        leaf.setWeight(1);
        leaf.setTotalWeight(1);

        return leaf;
    }
View Full Code Here
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
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
        return leaf;
    }

    private VPlanLeaf createLeafWithNumericTransformer(SampleAggregationMode aggregationMode) {
        VPlanLeaf leaf = new VPlanLeaf();

        // create simple transformer
        NumericTransformer numericTrans = new NumericTransformer();
        numericTrans.setThreshold1(1d);
        numericTrans.setThreshold2(2d);
        numericTrans.setThreshold3(3d);
        numericTrans.setThreshold4(4d);
        numericTrans.setThreshold5(5d);
        leaf.setTransformer(numericTrans);

        // set scale
        PositiveFloatScale scale = new PositiveFloatScale();
        leaf.setScale(scale);

        // valueMap
        FloatValue v0 = new FloatValue();
        v0.setValue(0d);
        FloatValue v1 = new FloatValue();
        v1.setValue(1d);
        FloatValue v2 = new FloatValue();
        v2.setValue(2d);
        FloatValue v3 = new FloatValue();
        v3.setValue(3d);
        FloatValue v4 = new FloatValue();
        v4.setValue(4d);
        FloatValue v5 = new FloatValue();
        v5.setValue(5d);

        Values valuesAlternative1 = new Values();
        Values valuesAlternative2 = new Values();
        valuesAlternative1.add(v0);
        valuesAlternative1.add(v0);
        valuesAlternative1.add(v3);
        valuesAlternative1.add(v4);
        valuesAlternative1.add(v5);
        valuesAlternative2.add(v3);
        valuesAlternative2.add(v3);
        valuesAlternative2.add(v1);
        valuesAlternative2.add(v3);
        valuesAlternative2.add(v5);

        Map<String, Values> valueMap = new HashMap<String, Values>();
        valueMap.put("alt1", valuesAlternative1);
        valueMap.put("alt2", valuesAlternative2);
        leaf.setValueMap(valueMap);

        leaf.setAggregationMode(aggregationMode);
        leaf.setWeight(1);
        leaf.setTotalWeight(1);

        return leaf;
    }
View Full Code Here
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
        Measure m3 = mock(Measure.class);
        when(m3.getUri()).thenReturn("http://measure3");

        // Leaves
        // Leaf1
        VPlanLeaf leaf1 = mock(VPlanLeaf.class);
        when(leaf1.isMapped()).thenReturn(true);
        when(leaf1.getPlanId()).thenReturn(1);
        when(leaf1.getMeasure()).thenReturn(m1);
        when(leaf1.hasKOPotential()).thenReturn(false);
        when(leaf1.getPotentialMinimum()).thenReturn(1d);
        when(leaf1.getPotentialMaximum()).thenReturn(4d);
        when(leaf1.getTotalWeight()).thenReturn(0.1d);
        Map<String, Double> leaf1Results = new HashMap<String, Double>();
        leaf1Results.put("alternative1", 1d);
        leaf1Results.put("alternative2", 2d);
        leaf1Results.put("alternative3", 3d);
        when(leaf1.getAlternativeResultsAsMap()).thenReturn(leaf1Results);

        // Leaf2
        VPlanLeaf leaf2 = mock(VPlanLeaf.class);
        when(leaf2.isMapped()).thenReturn(true);
        when(leaf2.getPlanId()).thenReturn(1);
        when(leaf2.getMeasure()).thenReturn(m2);
        when(leaf2.hasKOPotential()).thenReturn(false);
        when(leaf2.getPotentialMinimum()).thenReturn(1d);
        when(leaf2.getPotentialMaximum()).thenReturn(4d);
        when(leaf2.getTotalWeight()).thenReturn(0.1d);
        Map<String, Double> leaf2Results = new HashMap<String, Double>();
        leaf2Results.put("alternative1", 1d);
        leaf2Results.put("alternative2", 2d);
        leaf2Results.put("alternative3", 3d);
        when(leaf2.getAlternativeResultsAsMap()).thenReturn(leaf2Results);

        // Leaf3
        VPlanLeaf leaf3 = mock(VPlanLeaf.class);
        when(leaf3.isMapped()).thenReturn(true);
        when(leaf3.getPlanId()).thenReturn(1);
        when(leaf3.getMeasure()).thenReturn(m3);
        when(leaf3.hasKOPotential()).thenReturn(false);
        when(leaf3.getPotentialMinimum()).thenReturn(1d);
        when(leaf3.getPotentialMaximum()).thenReturn(4d);
        when(leaf3.getTotalWeight()).thenReturn(0.1d);
        Map<String, Double> leaf3Results = new HashMap<String, Double>();
        leaf3Results.put("alternative1", 1d);
        leaf3Results.put("alternative2", 2d);
        leaf3Results.put("alternative3", 3d);
        when(leaf3.getAlternativeResultsAsMap()).thenReturn(leaf3Results);

        List<VPlanLeaf> leaves = new ArrayList<VPlanLeaf>();
        leaves.add(leaf1);
        leaves.add(leaf2);
        leaves.add(leaf3);
View Full Code Here
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
        Measure m2 = mock(Measure.class);
        when(m2.getUri()).thenReturn("http://measure2");

        // Leaves
        // Leaf1
        VPlanLeaf leaf1 = mock(VPlanLeaf.class);
        when(leaf1.isMapped()).thenReturn(true);
        when(leaf1.getPlanId()).thenReturn(1);
        when(leaf1.getMeasure()).thenReturn(m1);
        when(leaf1.hasKOPotential()).thenReturn(true);
        when(leaf1.getPotentialMinimum()).thenReturn(1d);
        when(leaf1.getPotentialMaximum()).thenReturn(4d);
        when(leaf1.getTotalWeight()).thenReturn(0.1d);
        Map<String, Double> leaf1Results = new HashMap<String, Double>();
        leaf1Results.put("alternative1", 1d);
        leaf1Results.put("alternative2", 2d);
        leaf1Results.put("alternative3", 3d);
        when(leaf1.getAlternativeResultsAsMap()).thenReturn(leaf1Results);

        // Leaf2
        VPlanLeaf leaf2 = mock(VPlanLeaf.class);
        when(leaf2.isMapped()).thenReturn(true);
        when(leaf2.getPlanId()).thenReturn(1);
        when(leaf2.getMeasure()).thenReturn(m2);
        when(leaf2.hasKOPotential()).thenReturn(false);
        when(leaf2.getPotentialMinimum()).thenReturn(1d);
        when(leaf2.getPotentialMaximum()).thenReturn(4d);
        when(leaf2.getTotalWeight()).thenReturn(0.1d);
        Map<String, Double> leaf2Results = new HashMap<String, Double>();
        leaf2Results.put("alternative1", 1d);
        leaf2Results.put("alternative2", 2d);
        leaf2Results.put("alternative3", 3d);
        when(leaf2.getAlternativeResultsAsMap()).thenReturn(leaf2Results);

        List<VPlanLeaf> leaves = new ArrayList<VPlanLeaf>();
        leaves.add(leaf1);
        leaves.add(leaf2);
View Full Code Here
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
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
        Measure m3 = mock(Measure.class);
        when(m3.getUri()).thenReturn("http://measure3");

        // Leaves
        // Leaf1
        VPlanLeaf leaf1 = mock(VPlanLeaf.class);
        when(leaf1.isMapped()).thenReturn(true);
        when(leaf1.getPlanId()).thenReturn(1);
        when(leaf1.getMeasure()).thenReturn(m1);
        when(leaf1.hasKOPotential()).thenReturn(false);
        when(leaf1.getPotentialMinimum()).thenReturn(1d);
        when(leaf1.getPotentialMaximum()).thenReturn(4d);
        when(leaf1.getTotalWeight()).thenReturn(0.1d);
        Map<String, Double> leaf1Results = new HashMap<String, Double>();
        leaf1Results.put("alternative1", 1d);
        leaf1Results.put("alternative2", 2d);
        leaf1Results.put("alternative3", 3d);
        when(leaf1.getAlternativeResultsAsMap()).thenReturn(leaf1Results);

        // Leaf2
        VPlanLeaf leaf2 = mock(VPlanLeaf.class);
        when(leaf2.isMapped()).thenReturn(true);
        when(leaf2.getPlanId()).thenReturn(1);
        when(leaf2.getMeasure()).thenReturn(m2);
        when(leaf2.hasKOPotential()).thenReturn(false);
        when(leaf2.getPotentialMinimum()).thenReturn(1d);
        when(leaf2.getPotentialMaximum()).thenReturn(4d);
        when(leaf2.getTotalWeight()).thenReturn(0.1d);
        Map<String, Double> leaf2Results = new HashMap<String, Double>();
        leaf2Results.put("alternative1", 1d);
        leaf2Results.put("alternative2", 2d);
        leaf2Results.put("alternative3", 3d);
        when(leaf2.getAlternativeResultsAsMap()).thenReturn(leaf2Results);

        // Leaf3
        VPlanLeaf leaf3 = mock(VPlanLeaf.class);
        when(leaf3.isMapped()).thenReturn(true);
        when(leaf3.getPlanId()).thenReturn(1);
        when(leaf3.getMeasure()).thenReturn(m3);
        when(leaf3.hasKOPotential()).thenReturn(false);
        when(leaf3.getPotentialMinimum()).thenReturn(1d);
        when(leaf3.getPotentialMaximum()).thenReturn(4d);
        when(leaf3.getTotalWeight()).thenReturn(0.5d);
        Map<String, Double> leaf3Results = new HashMap<String, Double>();
        leaf3Results.put("alternative1", 1d);
        leaf3Results.put("alternative2", 2d);
        leaf3Results.put("alternative3", 3d);
        when(leaf3.getAlternativeResultsAsMap()).thenReturn(leaf3Results);

        List<VPlanLeaf> leaves = new ArrayList<VPlanLeaf>();
        leaves.add(leaf1);
        leaves.add(leaf2);
        leaves.add(leaf3);
View Full Code Here
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
        Measure m3 = mock(Measure.class);
        when(m3.getUri()).thenReturn("http://measure3");

        // Leaves
        // Leaf1
        VPlanLeaf leaf1 = mock(VPlanLeaf.class);
        when(leaf1.isMapped()).thenReturn(true);
        when(leaf1.getPlanId()).thenReturn(1);
        when(leaf1.getMeasure()).thenReturn(m1);
        when(leaf1.hasKOPotential()).thenReturn(false);
        when(leaf1.getPotentialMinimum()).thenReturn(1d);
        when(leaf1.getPotentialMaximum()).thenReturn(4d);
        when(leaf1.getTotalWeight()).thenReturn(0.2d);
        Map<String, Double> leaf1Results = new HashMap<String, Double>();
        leaf1Results.put("alternative1", 1d);
        leaf1Results.put("alternative2", 2d);
        leaf1Results.put("alternative3", 3d);
        when(leaf1.getAlternativeResultsAsMap()).thenReturn(leaf1Results);

        // Leaf2
        VPlanLeaf leaf2 = mock(VPlanLeaf.class);
        when(leaf2.isMapped()).thenReturn(true);
        when(leaf2.getPlanId()).thenReturn(1);
        when(leaf2.getMeasure()).thenReturn(m2);
        when(leaf2.hasKOPotential()).thenReturn(false);
        when(leaf2.getPotentialMinimum()).thenReturn(1d);
        when(leaf2.getPotentialMaximum()).thenReturn(4d);
        when(leaf2.getTotalWeight()).thenReturn(0.2d);
        Map<String, Double> leaf2Results = new HashMap<String, Double>();
        leaf2Results.put("alternative1", 1d);
        leaf2Results.put("alternative2", 2d);
        leaf2Results.put("alternative3", 3d);
        when(leaf2.getAlternativeResultsAsMap()).thenReturn(leaf2Results);

        // Leaf3
        VPlanLeaf leaf3 = mock(VPlanLeaf.class);
        when(leaf3.isMapped()).thenReturn(true);
        when(leaf3.getPlanId()).thenReturn(1);
        when(leaf3.getMeasure()).thenReturn(m3);
        when(leaf3.hasKOPotential()).thenReturn(false);
        when(leaf3.getPotentialMinimum()).thenReturn(1d);
        when(leaf3.getPotentialMaximum()).thenReturn(4d);
        when(leaf3.getTotalWeight()).thenReturn(0.2d);
        Map<String, Double> leaf3Results = new HashMap<String, Double>();
        leaf3Results.put("alternative1", 1d);
        leaf3Results.put("alternative2", 2d);
        leaf3Results.put("alternative3", 3d);
        when(leaf3.getAlternativeResultsAsMap()).thenReturn(leaf3Results);

        List<VPlanLeaf> leaves = new ArrayList<VPlanLeaf>();
        leaves.add(leaf1);
        leaves.add(leaf2);
        leaves.add(leaf3);
View Full Code Here
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
        Measure m1 = mock(Measure.class);
        when(m1.getUri()).thenReturn("http://measure1");

        // Leaves
        // Leaf1
        VPlanLeaf leaf1 = mock(VPlanLeaf.class);
        when(leaf1.isMapped()).thenReturn(true);
        when(leaf1.getPlanId()).thenReturn(1);
        when(leaf1.getMeasure()).thenReturn(m1);
        when(leaf1.hasKOPotential()).thenReturn(false);
        when(leaf1.getPotentialMinimum()).thenReturn(1d);
        when(leaf1.getPotentialMaximum()).thenReturn(4d);
        when(leaf1.getTotalWeight()).thenReturn(0.1d);
        Map<String, Double> leaf1Results = new HashMap<String, Double>();
        leaf1Results.put("alternative1", 1d);
        leaf1Results.put("alternative2", 2d);
        leaf1Results.put("alternative3", 3d);
        when(leaf1.getAlternativeResultsAsMap()).thenReturn(leaf1Results);

        List<VPlanLeaf> leaves = new ArrayList<VPlanLeaf>();
        leaves.add(leaf1);
        leaves.add(leaf1);
        leaves.add(leaf1);
View Full Code Here
TOP

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

  • eu.scape_project.planning.criteria.bean.RankChangingDominatedSetsTest
  • eu.scape_project.planning.model.scales.FloatRangeScale
  • eu.scape_project.planning.model.scales.IntRangeScale
  • eu.scape_project.planning.model.scales.PositiveFloatScale
  • eu.scape_project.planning.model.scales.PositiveIntegerScale
  • eu.scape_project.planning.model.transform.NumericTransformer
  • eu.scape_project.planning.model.transform.OrdinalTransformer
  • eu.scape_project.planning.model.tree.VPlanLeafTest
  • eu.scape_project.planning.model.values.TargetValue
    • 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.