1 | package de.ugoe.cs.autoquest.tasktrees.alignment.matrix; |
---|
2 | |
---|
3 | |
---|
4 | import java.util.HashMap; |
---|
5 | import java.util.HashSet; |
---|
6 | import java.util.Iterator; |
---|
7 | |
---|
8 | import de.ugoe.cs.autoquest.eventcore.guimodel.IGUIElement; |
---|
9 | import de.ugoe.cs.autoquest.tasktrees.alignment.algorithms.AlignmentHelpers; |
---|
10 | import de.ugoe.cs.autoquest.tasktrees.alignment.algorithms.Constants; |
---|
11 | import de.ugoe.cs.autoquest.tasktrees.treeifc.IEventTaskInstance; |
---|
12 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ITask; |
---|
13 | import de.ugoe.cs.autoquest.tasktrees.treeifc.ITaskInstance; |
---|
14 | |
---|
15 | |
---|
16 | public class ObjectDistanceSubstitionMatrix implements SubstitutionMatrix { |
---|
17 | |
---|
18 | HashMap<Integer, Integer> idmapping; |
---|
19 | private TriangleMatrix matrix; |
---|
20 | private HashSet<ITask> uniqueTasks; |
---|
21 | private double gapPenalty; |
---|
22 | private int index = 0; |
---|
23 | |
---|
24 | private double positiveThreshold; |
---|
25 | |
---|
26 | public ObjectDistanceSubstitionMatrix( |
---|
27 | HashSet<ITask> uniqueTasks,float positiveThreshold, int gapPenalty) { |
---|
28 | this.uniqueTasks = uniqueTasks; |
---|
29 | this.positiveThreshold = positiveThreshold; |
---|
30 | idmapping = new HashMap<Integer, Integer>(); |
---|
31 | matrix = new TriangleMatrix(uniqueTasks.size()+1); |
---|
32 | this.gapPenalty = gapPenalty; |
---|
33 | |
---|
34 | } |
---|
35 | |
---|
36 | |
---|
37 | public double getGapPenalty() { |
---|
38 | return gapPenalty; |
---|
39 | } |
---|
40 | |
---|
41 | public void setGapPenalty(double gapPenalty) { |
---|
42 | this.gapPenalty = gapPenalty; |
---|
43 | } |
---|
44 | |
---|
45 | public void generate() { |
---|
46 | |
---|
47 | int index1=-1; |
---|
48 | int index2=-1; |
---|
49 | float distance=0; |
---|
50 | for (Iterator<ITask> it = uniqueTasks.iterator(); it.hasNext();) { |
---|
51 | ITask task1 = it.next(); |
---|
52 | for (Iterator<ITask> jt = uniqueTasks.iterator(); jt.hasNext();) { |
---|
53 | ITask task2 = jt.next(); |
---|
54 | ITaskInstance ti1 = null; |
---|
55 | ITaskInstance ti2 = null; |
---|
56 | //TODO This seems ugly |
---|
57 | if(task1.getInstances().size() > 0) { |
---|
58 | ti1 = (ITaskInstance) task1.getInstances().iterator().next(); |
---|
59 | } |
---|
60 | if(task2.getInstances().size() > 0) { |
---|
61 | ti2 = (ITaskInstance) task2.getInstances().iterator().next(); |
---|
62 | } |
---|
63 | IEventTaskInstance eti1 = null; |
---|
64 | IEventTaskInstance eti2 = null; |
---|
65 | |
---|
66 | |
---|
67 | if (ti1 instanceof IEventTaskInstance && ti2 instanceof IEventTaskInstance) { |
---|
68 | eti1 = (IEventTaskInstance) ti1; |
---|
69 | index1 = getIndex(eti1); |
---|
70 | eti2 = (IEventTaskInstance) ti2; |
---|
71 | index2 = getIndex(eti2); |
---|
72 | distance = distanceBetweenInstances(eti1,eti2); |
---|
73 | } |
---|
74 | else if(ti1 instanceof IEventTaskInstance && !(ti2 instanceof IEventTaskInstance)) { |
---|
75 | task1 = ((ITaskInstance) ti1).getTask(); |
---|
76 | index2 = getIndex(task2); |
---|
77 | eti1 = (IEventTaskInstance) ti1; |
---|
78 | index1 = getIndex(eti1); |
---|
79 | distance = distanceBetweenTaskAndInstance(task2,eti1); |
---|
80 | } |
---|
81 | else if(!(ti1 instanceof IEventTaskInstance) && ti2 instanceof IEventTaskInstance) { |
---|
82 | index1 = getIndex(task1); |
---|
83 | eti2 = (IEventTaskInstance) ti2; |
---|
84 | index2 = getIndex(eti2); |
---|
85 | distance = distanceBetweenTaskAndInstance(task1,eti2); |
---|
86 | } |
---|
87 | else if(!(ti1 instanceof IEventTaskInstance) && !(ti2 instanceof IEventTaskInstance)) { |
---|
88 | index1 = getIndex(task1); |
---|
89 | index2 = getIndex(task2); |
---|
90 | distance = distanceBetweenTasks(task1,task2); |
---|
91 | } |
---|
92 | else { |
---|
93 | System.out.println("Unknown error"); |
---|
94 | } |
---|
95 | |
---|
96 | matrix.set(index1, index2,distance); |
---|
97 | |
---|
98 | } |
---|
99 | } |
---|
100 | } |
---|
101 | |
---|
102 | //TODO: Calculate distance here |
---|
103 | private float distanceBetweenTaskAndInstance(ITask task1, IEventTaskInstance eti) { |
---|
104 | return 0; |
---|
105 | } |
---|
106 | |
---|
107 | //TODO: Calculate distance here |
---|
108 | private float distanceBetweenTasks(ITask task1, ITask task2) { |
---|
109 | return 0; |
---|
110 | } |
---|
111 | |
---|
112 | |
---|
113 | private int getIndex(ITask task) { |
---|
114 | int tempindex =-1; |
---|
115 | |
---|
116 | if(!idmapping.containsKey(task.getId())) { |
---|
117 | idmapping.put(task.getId(), index); |
---|
118 | tempindex = index; |
---|
119 | index++; |
---|
120 | } |
---|
121 | else { |
---|
122 | tempindex = idmapping.get(task.getId()); |
---|
123 | } |
---|
124 | |
---|
125 | return tempindex; |
---|
126 | } |
---|
127 | |
---|
128 | private int getIndex(IEventTaskInstance eti) { |
---|
129 | int tempindex = -1; |
---|
130 | if(!idmapping.containsKey(eti.getTask().getId())) { |
---|
131 | idmapping.put(eti.getTask().getId(), index); |
---|
132 | tempindex = index; |
---|
133 | index++; |
---|
134 | } |
---|
135 | else { |
---|
136 | tempindex = idmapping.get(eti.getTask().getId()); |
---|
137 | } |
---|
138 | return tempindex; |
---|
139 | }; |
---|
140 | |
---|
141 | private float distanceBetweenInstances(IEventTaskInstance eti1, IEventTaskInstance eti2) { |
---|
142 | IGUIElement first = (IGUIElement) eti1.getEvent().getTarget(); |
---|
143 | IGUIElement second = (IGUIElement) eti2.getEvent().getTarget(); |
---|
144 | float distance = -1*AlignmentHelpers.distanceBetween(first, second); |
---|
145 | distance += positiveThreshold; |
---|
146 | return distance; |
---|
147 | } |
---|
148 | |
---|
149 | public String toString(){ |
---|
150 | return matrix.toString(); |
---|
151 | } |
---|
152 | |
---|
153 | public double getScore(int taskId1, int taskId2) { |
---|
154 | if(taskId1 == Constants.GAP_SYMBOL || taskId1 == Constants.UNMATCHED_SYMBOL || taskId2 == Constants.GAP_SYMBOL || taskId2 == Constants.UNMATCHED_SYMBOL ) { |
---|
155 | return 0.0; |
---|
156 | } |
---|
157 | else { |
---|
158 | |
---|
159 | Integer first = idmapping.get(taskId1); |
---|
160 | Integer second = idmapping.get(taskId2); |
---|
161 | return matrix.get(first,second); |
---|
162 | } |
---|
163 | |
---|
164 | } |
---|
165 | |
---|
166 | } |
---|
167 | |
---|