private void combineParts(
MultiMap<Part, ColumnKey> needed,
MultiMap<ColumnKey, Part> classified,
List<ExpressionNode> andexprs,
List<Part> andparts) {
Part p = needed.keySet().iterator().next();
Collection<ColumnKey> missing = needed.get(p);
if (missing == null || missing.isEmpty()) {
andexprs.add((ExpressionNode) p.getParent());
needed.remove(p);
andparts.add(p);
return;
}
ListSet<Part> containingMissing = new ListSet<Part>();
boolean first = true;
for (ColumnKey ck : missing) {
Collection<Part> matching = classified.get(ck);
if (matching == null || matching.isEmpty()) continue;
if (first) containingMissing.addAll(matching);
else {
containingMissing.retainAll(matching);
}
}
if (containingMissing.isEmpty()) {
andexprs.add((ExpressionNode) p.getParent());
andparts.add(p);
needed.remove(p);
} else {
ListSet<Part> toCombine = new ListSet<Part>();
toCombine.add(p);
toCombine.addAll(containingMissing);
ListSet<Part> toRemove = new ListSet<Part>();
toRemove.addAll(toCombine);
Part clhs = choosePartForAndCombo(toCombine);
toCombine.remove(clhs);
while (!toCombine.isEmpty()) {
Part crhs = choosePartForAndCombo(toCombine);
toCombine.remove(crhs);
clhs = combineParts(clhs, crhs);
}
for (Part rp : toRemove) {
needed.remove(rp);
ArrayList<ColumnKey> classKeys = new ArrayList<ColumnKey>(classified.keySet());
for (ColumnKey ck : classKeys) {
Collection<Part> sub = classified.get(ck);
if (sub == null || sub.isEmpty()) continue;
if (sub.contains(rp)) classified.remove(ck, rp);
}
}
andexprs.add((ExpressionNode) clhs.getParent());
andparts.add(clhs);
}
}
private LanguageNode handleAndFunction(FunctionCall fc) {
// and functions take incomplete simple parts and turn them into complete parts, if so desired
ArrayList<Part> incompletes = new ArrayList<Part>();
ArrayList<ExpressionNode> ok = new ArrayList<ExpressionNode>();
ArrayList<Part> subparts = new ArrayList<Part>();
for (ExpressionNode en : fc.getParameters()) {
Part p = state.get(en);
if (p == null || p.isComplete()) {
ok.add(en);
if (p != null) subparts.add(p);
continue;
}
incompletes.add(p);
}
if (incompletes.isEmpty()) return fc;
// now we have the problem of a mishmash of incompletes. some may be complex, some may be
// simple
// some may be collections. we need to handle cases like the following:
// (a = 1) and (b = 2) {a,b} (1 key)
// (a = 1) and (b = 2 or b = 3) {a,b} (2 keys)
// (a = 1 or a = 2) and (b = 3) {a,b} (2 keys)
// (a = 1 or a = 2) and (b = 3 or b = 4) {a,b} (4 keys here)
// all of the above, where the result is still not complete due to missing tenant column
MultiMap<Part, ColumnKey> needed = new MultiMap<Part, ColumnKey>();
MultiMap<ColumnKey, Part> classified = new MultiMap<ColumnKey, Part>();
for (Part p : incompletes) {
ListSet<ColumnKey> has = new ListSet<ColumnKey>();
has.addAll(p.getColumns());
needed.putAll(p, parent.getNeeded(has));
for (ColumnKey ck : has) {
classified.put(ck, p);
}
}
// so let's say we have a part that is (a = 1 and b = 2), needs c and tenant, and we have a
// part
// that is c in (1,2,3). The needed for (a = 1 and b = 2) is {c,tenant}. we'll pull (c in
// (1,2,3))
// so we'll get at least (a = 1 and b = 2 and c = 3) or (a = 1 and b =2 and c = 3) ...
// these we can then individually try to complete.
while (!needed.isEmpty()) {
combineParts(needed, classified, ok, subparts);
}
for (Part p : subparts) state.put(p.getParent(), p);
if (ok.size() == 1) return ok.get(0);
else {
// what's left is a mix of unrelated and complete or incomplete subexprs. unrelated nodes
// would come in from above, as would previously complete.
return new FunctionCall(FunctionName.makeAnd(), ok);
}
}
@Override
public void plan(SchemaContext sc, ExecutionSequence es, BehaviorConfiguration config)
throws PEException {
MultiMap<PEDatabase, PETable> plain = new MultiMap<PEDatabase, PETable>();
MultiMap<PEDatabase, PETable> fks = new MultiMap<PEDatabase, PETable>();
MultiMap<PEDatabase, PEViewTable> views = new MultiMap<PEDatabase, PEViewTable>();
AddStorageSiteStatement.sortTablesOnGroup(sc, onGroup, plain, fks, views);
ListSet<PEDatabase> dbs = new ListSet<PEDatabase>();
dbs.addAll(views.keySet());
dbs.addAll(plain.keySet());
dbs.addAll(fks.keySet());
Pair<List<PEAbstractTable<?>>, Boolean> tableDeclOrder =
AddStorageSiteStatement.buildTableDeclOrder(sc, plain, fks);
MultiMap<RangeDistribution, PETable> tablesByRange = new MultiMap<RangeDistribution, PETable>();
for (PEAbstractTable<?> abst : tableDeclOrder.getFirst()) {
if (abst.isView()) continue;
PETable pet = abst.asTable();
if (pet.getDistributionVector(sc).isRange()) {
RangeDistributionVector rdv = (RangeDistributionVector) pet.getDistributionVector(sc);
tablesByRange.put(rdv.getRangeDistribution().getDistribution(sc), pet);
}
}
List<AddStorageGenRangeInfo> rangeInfo = buildRangeInfo(sc, tablesByRange);
/*
for(AddStorageGenRangeInfo info : rangeInfo) {
info.display(System.out);
}
*/
es.append(
new ComplexDDLExecutionStep(
null,
onGroup,
null,
Action.ALTER,
new RebalanceCallback(onGroup, rangeInfo, tableDeclOrder.getSecond())));
}
protected ListSet<Part> getCompletedParts() {
if (stopped) return null;
ListSet<Part> cols = new ListSet<Part>();
for (Part p : completedParts) {
if (p instanceof OredParts) cols.add(p);
}
completedParts.removeAll(cols);
for (Part p : cols) {
for (Part sp : p.getParts()) {
completedParts.remove(sp);
}
}
completedParts.addAll(cols);
return completedParts;
}
private Part buildNewComplexPart(Part lp, Part rp) {
ListSet<Part> allParts = new ListSet<Part>();
allParts.addAll(lp.getParts());
allParts.addAll(rp.getParts());
FunctionCall andCall =
new FunctionCall(
FunctionName.makeAnd(), Functional.apply(allParts, Part.castToExpression));
AndedParts cp = parent.buildAndedParts(andCall, allParts);
if (parent.isComplete(cp)) {
setComplete(cp);
} else if (!parent.isComplete(cp)) {
AndedParts ncp = parent.maybeMakeComplete(cp);
if (ncp != null) {
setComplete(ncp);
return ncp;
}
}
return cp;
}
public OredParts(LanguageNode parent, TableKey tk, Collection<Part> p) {
super(parent, tk);
parts = new ListSet<Part>();
parts.addAll(p);
((ExpressionNode) parent).setGrouped();
}