predicate-search-core/src/main/java/com/yahoo/search/predicate/optimization/OrSimplifier.java


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71

// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
package com.yahoo.search.predicate.optimization;

import com.yahoo.document.predicate.Conjunction;
import com.yahoo.document.predicate.Disjunction;
import com.yahoo.document.predicate.FeatureSet;
import com.yahoo.document.predicate.Negation;
import com.yahoo.document.predicate.Predicate;

import java.util.ArrayList;
import java.util.List;
import java.util.Optional;
import java.util.stream.Collectors;

import static java.util.stream.Collectors.groupingBy;
import static java.util.stream.Collectors.reducing;

/**
 * Simplifies Disjunction nodes where all children are of type FeatureSet. All FeatureSet that share the same key
 * are merged into a single FeatureSet. The Disjunction is removed if all children merges into a single feature set.
 *
 * @author bjorncs
 */
public class OrSimplifier implements PredicateProcessor {

    @Override
    public Predicate process(Predicate predicate, PredicateOptions options) {
        return simplifyTree(predicate);
    }

    public Predicate simplifyTree(Predicate predicate) {
        if (predicate instanceof Disjunction disjunction) {
            List<Predicate> newChildren =
                    disjunction.getOperands().stream().map(this::simplifyTree).toList();
            return compressFeatureSets(newChildren);
        } else if (predicate instanceof Negation negation) {
            negation.setOperand(simplifyTree(negation.getOperand()));
            return negation;
        } else if (predicate instanceof Conjunction conjunction) {
            List<Predicate> newChildren =
                    conjunction.getOperands().stream().map(this::simplifyTree).toList();
            conjunction.setOperands(newChildren);
            return conjunction;
        } else {
            return predicate;
        }
    }

    // Groups and merges the feature sets based on key.
    private static Predicate compressFeatureSets(List<Predicate> children) {
        List<Predicate> newChildren = children.stream().filter(p -> !(p instanceof FeatureSet)).collect(Collectors.toCollection(ArrayList::new));
        children.stream()
                .filter(FeatureSet.class::isInstance)
                .map(FeatureSet.class::cast)
                .collect(groupingBy(FeatureSet::getKey,
                        reducing((f1, f2) -> {
                            f1.addValues(f2.getValues());
                            return f1;
                        })))
                .values()
                .stream()
                .map(Optional::get)
                .forEach(newChildren::add);
        if (newChildren.size() == 1) {
            return newChildren.get(0);
        } else {
            return new Disjunction(newChildren);
        }
    }

}