r1 := [[3, 4, 5], [1, 2]]: r2 := [[2], [4], [3], [1, 5]]: r3 := [[2], [4, 5], [3], [1]]: r4 := [[1], [2, 5],\ [3, 4]]:
| r4 | := | [ | [1] | , | [2, 5] | , | \ ¶ | [3, 4] | ] | : |
|---|---|---|---|---|---|---|---|---|---|---|
| ranking name | separator | first bucket | second bucket | multi line indicator | third bucket | ending char | ||||
| Optional | Mandatory | Optional | Mandatory | Optional | ||||||
MedianRankingTools
from the MedianRankingInterface.jar library
contains a function
toRankingWithTieFromFile
which reads any well formed datasets.
package medianRanking.Exemple;
import java.util.ArrayList;
import java.util.Collection;
import java.util.List;
import medianRanking.MedianRanking;
import annotations.*;
@MRAnnotation(description = "Class presenting annotations", name = "Annotation example", virtualPackage = "Local search")
public class ExampleAnnotation<T> implements MedianRanking<T> {
@MRConstructorAnnotation(hide = true)
public ExampleAnnotation(@MRParameterAnnotation(defaultValue = "1.0",
description = "Constructor parameter",
name = "MyMoreExplicitParamName") int param) {
}
@Override
public List<Collection<T>> computMedianRanking(Collection<List<Collection<T>>> rankings) {
return rankings.iterator().next();
}
@Override
public Collection<List<Collection<T>>> computMedianRankings(Collection<List<Collection<T>>> rankings) {
Collection<List<Collection<T>>> ret = new ArrayList<List<Collection<T>>>();
ret.add(this.computMedianRanking(rankings));
return ret;
}
@Override
public String getFullName() {
return "Ma classe d'exemple d'annotations";
}
@Override
public boolean isBreakingTiesArbitrarily() {
return true;
}
@Override
public boolean isUsingRandomValue() {
return false;
}
}Code Formatted by ToGoTutor