@@ -312,7 +312,8 @@ object BooleanSimplification extends Rule[LogicalPlan] with PredicateHelper {
312312 case (l, r) if l fastEquals r => l
313313 case (_, _) =>
314314 /* Do optimize for predicates using formula (a || b) && (a || c) => a || (b && c)
315- * 1. Split left and right to get the disjunctive predicates, i.e. lhsSet = (a, b), rhsSet = (a, c)
315+ * 1. Split left and right to get the disjunctive predicates,
316+ * i.e. lhsSet = (a, b), rhsSet = (a, c)
316317 * 2. Find the common predict between lhsSet and rhsSet, i.e. common = (a)
317318 * 3. Remove common predict from lhsSet and rhsSet, i.e. ldiff = (b), rdiff = (c)
318319 * 4. Apply the formula, get the optimized predict: common || (ldiff && rdiff)
@@ -346,7 +347,8 @@ object BooleanSimplification extends Rule[LogicalPlan] with PredicateHelper {
346347 case (l, r) if l fastEquals r => l
347348 case (_, _) =>
348349 /* Do optimize for predicates using formula (a && b) || (a && c) => a && (b || c)
349- * 1. Split left and right to get the conjunctive predicates, i.e. lhsSet = (a, b), rhsSet = (a, c)
350+ * 1. Split left and right to get the conjunctive predicates,
351+ * i.e. lhsSet = (a, b), rhsSet = (a, c)
350352 * 2. Find the common predict between lhsSet and rhsSet, i.e. common = (a)
351353 * 3. Remove common predict from lhsSet and rhsSet, i.e. ldiff = (b), rdiff = (c)
352354 * 4. Apply the formula, get the optimized predict: common && (ldiff || rdiff)
0 commit comments