| 1 | |
package org.jbehave.core.steps; |
| 2 | |
|
| 3 | |
import java.util.ArrayList; |
| 4 | |
import java.util.Collections; |
| 5 | |
import java.util.Comparator; |
| 6 | |
import java.util.LinkedList; |
| 7 | |
import java.util.List; |
| 8 | |
|
| 9 | |
import org.apache.commons.lang.StringUtils; |
| 10 | |
|
| 11 | |
|
| 12 | |
|
| 13 | |
|
| 14 | |
|
| 15 | |
|
| 16 | |
|
| 17 | |
|
| 18 | |
|
| 19 | |
|
| 20 | |
|
| 21 | |
|
| 22 | |
|
| 23 | |
|
| 24 | |
|
| 25 | |
|
| 26 | |
public class StepFinder { |
| 27 | |
|
| 28 | |
private PrioritisingStrategy prioritisingStrategy; |
| 29 | |
|
| 30 | |
|
| 31 | |
|
| 32 | |
|
| 33 | |
public StepFinder() { |
| 34 | 1149 | this(new ByPriorityField()); |
| 35 | 1149 | } |
| 36 | |
|
| 37 | |
|
| 38 | |
|
| 39 | |
|
| 40 | |
|
| 41 | |
|
| 42 | |
|
| 43 | 1150 | public StepFinder(PrioritisingStrategy prioritisingStrategy) { |
| 44 | 1150 | this.prioritisingStrategy = prioritisingStrategy; |
| 45 | 1150 | } |
| 46 | |
|
| 47 | |
|
| 48 | |
|
| 49 | |
|
| 50 | |
|
| 51 | |
|
| 52 | |
|
| 53 | |
|
| 54 | |
|
| 55 | |
public List<Stepdoc> stepdocs(List<CandidateSteps> candidateSteps) { |
| 56 | 2 | List<Stepdoc> stepdocs = new LinkedList<Stepdoc>(); |
| 57 | 2 | for (StepCandidate candidate : collectCandidates(candidateSteps)) { |
| 58 | 6 | stepdocs.add(new Stepdoc(candidate)); |
| 59 | 6 | } |
| 60 | 2 | return stepdocs; |
| 61 | |
} |
| 62 | |
|
| 63 | |
|
| 64 | |
|
| 65 | |
|
| 66 | |
|
| 67 | |
|
| 68 | |
|
| 69 | |
|
| 70 | |
|
| 71 | |
|
| 72 | |
|
| 73 | |
public List<Stepdoc> findMatching(String stepAsText, List<CandidateSteps> candidateSteps) { |
| 74 | 3 | List<Stepdoc> matching = new ArrayList<Stepdoc>(); |
| 75 | 3 | for (StepCandidate candidate : collectCandidates(candidateSteps)) { |
| 76 | 6 | if (candidate.matches(stepAsText)) { |
| 77 | 1 | matching.add(new Stepdoc(candidate)); |
| 78 | |
} |
| 79 | 6 | } |
| 80 | 3 | return matching; |
| 81 | |
} |
| 82 | |
|
| 83 | |
|
| 84 | |
|
| 85 | |
|
| 86 | |
|
| 87 | |
|
| 88 | |
|
| 89 | |
|
| 90 | |
public List<Object> stepsInstances(List<CandidateSteps> candidateSteps) { |
| 91 | 4 | List<Object> instances = new ArrayList<Object>(); |
| 92 | 4 | for (CandidateSteps steps : candidateSteps) { |
| 93 | 3 | if (steps instanceof Steps) { |
| 94 | 3 | instances.add(((Steps) steps).instance()); |
| 95 | |
} |
| 96 | 3 | } |
| 97 | 4 | return instances; |
| 98 | |
} |
| 99 | |
|
| 100 | |
|
| 101 | |
|
| 102 | |
|
| 103 | |
|
| 104 | |
|
| 105 | |
|
| 106 | |
|
| 107 | |
public List<StepCandidate> collectCandidates(List<CandidateSteps> candidateSteps) { |
| 108 | 21 | List<StepCandidate> collected = new ArrayList<StepCandidate>(); |
| 109 | 21 | for (CandidateSteps steps : candidateSteps) { |
| 110 | 22 | collected.addAll(steps.listCandidates()); |
| 111 | 22 | } |
| 112 | 21 | return collected; |
| 113 | |
} |
| 114 | |
|
| 115 | |
|
| 116 | |
|
| 117 | |
|
| 118 | |
|
| 119 | |
|
| 120 | |
|
| 121 | |
|
| 122 | |
|
| 123 | |
|
| 124 | |
|
| 125 | |
public List<StepCandidate> prioritise(String stepAsText, List<StepCandidate> candidates) { |
| 126 | 18 | return prioritisingStrategy.prioritise(stepAsText, candidates); |
| 127 | |
} |
| 128 | |
|
| 129 | |
|
| 130 | |
|
| 131 | |
|
| 132 | |
public static interface PrioritisingStrategy { |
| 133 | |
|
| 134 | |
List<StepCandidate> prioritise(String stepAsString, List<StepCandidate> candidates); |
| 135 | |
|
| 136 | |
} |
| 137 | |
|
| 138 | |
|
| 139 | |
|
| 140 | |
|
| 141 | |
|
| 142 | |
|
| 143 | 1149 | public static class ByPriorityField implements PrioritisingStrategy { |
| 144 | |
|
| 145 | |
public List<StepCandidate> prioritise(String stepAsText, List<StepCandidate> candidates) { |
| 146 | 17 | Collections.sort(candidates, new Comparator<StepCandidate>() { |
| 147 | |
public int compare(StepCandidate o1, StepCandidate o2) { |
| 148 | 19 | return o2.getPriority().compareTo(o1.getPriority()); |
| 149 | |
} |
| 150 | |
}); |
| 151 | 17 | return candidates; |
| 152 | |
} |
| 153 | |
|
| 154 | |
} |
| 155 | |
|
| 156 | |
|
| 157 | |
|
| 158 | |
|
| 159 | |
|
| 160 | 13 | public static class ByLevenshteinDistance implements PrioritisingStrategy { |
| 161 | |
|
| 162 | 1 | private LevenshteinDistance ld = new LevenshteinDistance(); |
| 163 | |
|
| 164 | |
public List<StepCandidate> prioritise(final String stepAsText, List<StepCandidate> candidates) { |
| 165 | 7 | Collections.sort(candidates, new Comparator<StepCandidate>() { |
| 166 | |
public int compare(StepCandidate o1, StepCandidate o2) { |
| 167 | 6 | String scoringPattern1 = scoringPattern(o1); |
| 168 | 6 | String scoringPattern2 = scoringPattern(o2); |
| 169 | 6 | String stepWithoutStartingWord = trimStartingWord(stepAsText); |
| 170 | 6 | Integer score1 = 0 - ld.calculate(scoringPattern1, stepWithoutStartingWord); |
| 171 | 6 | Integer score2 = 0 - ld.calculate(scoringPattern2, stepWithoutStartingWord); |
| 172 | 6 | int result = score2.compareTo(score1); |
| 173 | |
|
| 174 | 6 | return result != 0 ? result : o2.getPriority().compareTo(o1.getPriority()); |
| 175 | |
} |
| 176 | |
|
| 177 | |
private String scoringPattern(StepCandidate candidate) { |
| 178 | 12 | return candidate.getPatternAsString().replaceAll("\\s\\$\\w+\\s", " ").replaceAll("\\$\\w+", ""); |
| 179 | |
} |
| 180 | |
|
| 181 | |
private String trimStartingWord(String stepAsString) { |
| 182 | 6 | return StringUtils.substringAfter(stepAsString, " "); |
| 183 | |
} |
| 184 | |
|
| 185 | |
}); |
| 186 | 1 | return candidates; |
| 187 | |
} |
| 188 | |
|
| 189 | 2 | private class LevenshteinDistance { |
| 190 | |
|
| 191 | |
public int calculate(String s, String t) { |
| 192 | |
int d[][]; |
| 193 | |
int n; |
| 194 | |
int m; |
| 195 | |
int i; |
| 196 | |
int j; |
| 197 | |
char s_i; |
| 198 | |
char t_j; |
| 199 | |
int cost; |
| 200 | |
|
| 201 | |
|
| 202 | 12 | n = s.length(); |
| 203 | 12 | m = t.length(); |
| 204 | 12 | if (n == 0) { |
| 205 | 0 | return m; |
| 206 | |
} |
| 207 | 12 | if (m == 0) { |
| 208 | 0 | return n; |
| 209 | |
} |
| 210 | 12 | d = new int[n + 1][m + 1]; |
| 211 | |
|
| 212 | 256 | for (i = 0; i <= n; i++) { |
| 213 | 244 | d[i][0] = i; |
| 214 | |
} |
| 215 | 96 | for (j = 0; j <= m; j++) { |
| 216 | 84 | d[0][j] = j; |
| 217 | |
} |
| 218 | |
|
| 219 | 244 | for (i = 1; i <= n; i++) { |
| 220 | 232 | s_i = s.charAt(i - 1); |
| 221 | |
|
| 222 | 1624 | for (j = 1; j <= m; j++) { |
| 223 | 1392 | t_j = t.charAt(j - 1); |
| 224 | |
|
| 225 | 1392 | if (s_i == t_j) { |
| 226 | 85 | cost = 0; |
| 227 | |
} else { |
| 228 | 1307 | cost = 1; |
| 229 | |
} |
| 230 | |
|
| 231 | 1392 | d[i][j] = minimum(d[i - 1][j] + 1, d[i][j - 1] + 1, d[i - 1][j - 1] + cost); |
| 232 | |
} |
| 233 | |
} |
| 234 | |
|
| 235 | 12 | return d[n][m]; |
| 236 | |
} |
| 237 | |
|
| 238 | |
private int minimum(int a, int b, int c) { |
| 239 | 1392 | int mi = a; |
| 240 | 1392 | if (b < mi) { |
| 241 | 168 | mi = b; |
| 242 | |
} |
| 243 | 1392 | if (c < mi) { |
| 244 | 218 | mi = c; |
| 245 | |
} |
| 246 | 1392 | return mi; |
| 247 | |
} |
| 248 | |
|
| 249 | |
} |
| 250 | |
|
| 251 | |
} |
| 252 | |
|
| 253 | |
} |