All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.yahoo.search.predicate.optimization.OrSimplifier Maven / Gradle / Ivy

The newest version!
// Copyright Vespa.ai. 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 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 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 children) {
        List 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);
        }
    }

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy