private void processZero(String formula, TokenProcessEvent tpe, String num, String... base) {
List<String> choice = createZeroChoices(tpe, num, base);
String oneChoice = choice.get(0);
String zeroChoice = choice.get(1);
if (oneChoice.equals(zeroChoice)) {
tpe.append(oneChoice);
} else {
List<String> descr = new ArrayList<>();
descr.add(oneChoice + " ... " + SET_ZERO_ONE);
descr.add(zeroChoice + " ... " + SET_ZERO_ANY);
String decision =
tpe.getDecider()
.getConversionDecision(
"Resolve ambiguity for " + getProcessedToken() + ":" + formula, descr, choice, 0);
tpe.append(decision);
}
}
@Override
public String process(TokenProcessEvent tpe) {
String formula = tpe.getValue();
int commaLoc = formula.indexOf(',');
if (commaLoc == -1) {
return "Prerequisite " + tpe.getKey() + " must have a count: " + formula;
}
if (commaLoc == formula.length() - 1) {
return "Prerequisite " + tpe.getKey() + " can not have only a count: " + formula;
}
String num = formula.substring(0, commaLoc);
String rest = formula.substring(commaLoc + 1);
try {
Integer.parseInt(num);
} catch (NumberFormatException nfe) {
return "'" + num + "' in " + tpe.getKey() + " is not a valid integer";
}
// Work rest here:
commaLoc = rest.indexOf(',');
if (commaLoc == -1) {
// Unambiguous for y=z, now test for y or y=0
int equalLoc = rest.indexOf('=');
if (equalLoc == -1) {
// No equals
tpe.append(getPrefix(tpe, num));
tpe.append(rest);
tpe.append("=ANY");
} else {
processZero(formula, tpe, num, rest);
}
} else {
String[] strings = rest.split(",");
int withEquals = 0;
boolean withoutEquals = false;
boolean lastWithEquals = false;
List<String> list = new ArrayList<>();
for (String tok : strings) {
int equalLoc = tok.indexOf('=');
if (equalLoc == -1) {
withoutEquals = true;
lastWithEquals = false;
} else {
withEquals++;
lastWithEquals = true;
}
list.add(tok);
}
if (withEquals == 1 && lastWithEquals) {
// Propagate item to all...
String last = strings[strings.length - 1];
int eqLoc = last.indexOf('=');
String equal = last.substring(eqLoc + 1);
tpe.append(getPrefix(tpe, num));
tpe.append(StringUtil.join(list, "=" + equal + ","));
} else if (withEquals > 0 && withoutEquals) {
StringBuilder onebase = new StringBuilder();
StringBuilder leftbase = new StringBuilder();
StringBuilder rightbase = new StringBuilder();
boolean needComma = false;
Integer lastValue = null;
for (int i = 0; i < strings.length; i++) {
if (needComma) {
onebase.append(',');
leftbase.append(',');
rightbase.append(',');
}
needComma = true;
String tok = strings[i];
int equalLoc = tok.indexOf('=');
onebase.append(tok);
leftbase.append(tok);
rightbase.append(tok);
if (equalLoc == -1) {
onebase.append("=ANY");
leftbase.append('=');
if (lastValue == null) {
leftbase.append("ANY");
} else {
leftbase.append(lastValue);
}
rightbase.append('=');
rightbase.append(getNextValue(strings, i));
} else {
lastValue = Integer.decode(tok.substring(equalLoc + 1));
}
}
List<String> descr = new ArrayList<>();
List<String> choice = new ArrayList<>();
processChoices(tpe, num, descr, choice, onebase.toString(), SET_ANY);
processChoices(
tpe, num, descr, choice, rightbase.toString(), AbstractPreEqualConvertPlugin.FLOW_LEFT);
processChoices(
tpe, num, descr, choice, leftbase.toString(), AbstractPreEqualConvertPlugin.FLOW_RIGHT);
String result = null;
boolean match = true;
for (String c : choice) {
if (result == null) {
result = c;
} else if (!result.equals(c)) {
match = false;
break;
}
}
if (match) {
tpe.append(result);
} else {
String decision =
tpe.getDecider()
.getConversionDecision(
"Resolve ambiguity for " + getProcessedToken() + ":" + formula,
descr,
choice,
0);
tpe.append(decision);
}
} else if (withEquals > 0) // && !withoutEquals
{
processZero(formula, tpe, num, strings);
} else if (withoutEquals) // && withEquals == 0
{
tpe.append(getPrefix(tpe, num));
tpe.append(StringUtil.join(list, "=ANY,"));
tpe.append("=ANY");
}
}
tpe.consume();
return null;
}