Examples with CalculatedValue com.bakdata.conquery.util.CalculatedValue used on opensource projects

Example 1 with CalculatedValue

use of com.bakdata.conquery.util.CalculatedValue in project conquery by bakdata.

the class GroovyIndexedTest method getTestKeys.

public static Stream<Arguments> getTestKeys() {
    final Random random = new Random(SEED);
    Supplier<CalculatedValue<Map<String, Object>>> rowMap = () -> new CalculatedValue<>(() -> Collections.singletonMap("distinction", 8 + random.nextInt(10)));
    return Stream.of("A13B", "I43A", "H41B", "B05Z", "L02C", "L12Z", "H08A", "I56B", "I03A", "E79C", "B80Z", "I47A", "N13A", "G08B", "F43B", "P04A", "T36Z", "T36Z", "N11A", "D13A", "R01D", "F06A", "F24A", "O03Z", "P01Z", "R63D", "A13A", "O05A", "G29B", "I18A", "J08A", "E74Z", "D06C", "H36Z", "H05Z", "P65B", "I09A", "A66Z", "F12E", "Q60E", "I46B", "I97Z", "I78Z", "T01B", "J24C", "A62Z", "Q01Z", "N25Z", "A01B", "G02A", // This may not fail, but return null on both sides
    "ZULU").map(v -> Arguments.of(v, rowMap.get()));
}

Example 2 with CalculatedValue

use of com.bakdata.conquery.util.CalculatedValue in project conquery by bakdata.

the class ConceptsProcessor method resolveConceptElements.

public ResolvedConceptsResult resolveConceptElements(TreeConcept concept, List<String> conceptCodes) {
    List<ConceptElementId<?>> resolvedCodes = new ArrayList<>();
    List<String> unknownCodes = new ArrayList<>();
    if (concept == null) {
        return new ResolvedConceptsResult(null, null, conceptCodes);
    }
    for (String conceptCode : conceptCodes) {
        ConceptTreeChild child;
        try {
            child = concept.findMostSpecificChild(conceptCode, new CalculatedValue<>(Collections::emptyMap));
            if (child != null) {
                resolvedCodes.add(child.getId());
            } else {
                unknownCodes.add(conceptCode);
            }
        } catch (ConceptConfigurationException e) {
            log.error("Error while trying to resolve " + conceptCode, e);
        }
    }
    return new ResolvedConceptsResult(resolvedCodes, null, unknownCodes);
}

Example 3 with CalculatedValue

use of com.bakdata.conquery.util.CalculatedValue in project conquery by bakdata.

the class CBlock method calculateSpecificChildrenPaths.

/**
 * Calculates the path for each event from the root of the {@link TreeConcept} to the most specific {@link ConceptTreeChild}
 * denoted by the individual {@link ConceptTreeChild#getPrefix()}.
 */
private static int[][] calculateSpecificChildrenPaths(Bucket bucket, ConceptTreeConnector connector) {
    final Column column = connector.getColumn();
    final TreeConcept treeConcept = connector.getConcept();
    final StringStore stringStore;
    // If we have a column and it is of string-type, we create indices and caches.
    if (column != null && bucket.getStores()[column.getPosition()] instanceof StringStore) {
        stringStore = (StringStore) bucket.getStores()[column.getPosition()];
        // Create index and insert into Tree.
        TreeChildPrefixIndex.putIndexInto(treeConcept);
        treeConcept.initializeIdCache(stringStore, bucket.getImp());
    } else // No column only possible if we have just one tree element!
    if (treeConcept.countElements() == 1) {
        stringStore = null;
    } else {
        throw new IllegalStateException(String.format("Cannot build tree over Connector[%s] without Column", connector.getId()));
    }
    final int[][] mostSpecificChildren = new int[bucket.getNumberOfEvents()][];
    Arrays.fill(mostSpecificChildren, ConceptTreeConnector.NOT_CONTAINED);
    final ConceptTreeCache cache = treeConcept.getCache(bucket.getImp());
    final int[] root = treeConcept.getPrefix();
    for (int event = 0; event < bucket.getNumberOfEvents(); event++) {
        try {
            // Events can also be filtered, allowing a single table to be used by multiple connectors.
            if (column != null && !bucket.has(event, column)) {
                mostSpecificChildren[event] = Connector.NOT_CONTAINED;
                continue;
            }
            String stringValue = "";
            int valueIndex = -1;
            if (stringStore != null) {
                valueIndex = bucket.getString(event, column);
                stringValue = stringStore.getElement(valueIndex);
            }
            // Lazy evaluation of map to avoid allocations if possible.
            // Copy event for closure.
            final int _event = event;
            final CalculatedValue<Map<String, Object>> rowMap = new CalculatedValue<>(() -> bucket.calculateMap(_event));
            if ((connector.getCondition() != null && !connector.getCondition().matches(stringValue, rowMap))) {
                mostSpecificChildren[event] = Connector.NOT_CONTAINED;
                continue;
            }
            ConceptTreeChild child = cache == null ? treeConcept.findMostSpecificChild(stringValue, rowMap) : cache.findMostSpecificChild(valueIndex, stringValue, rowMap);
            // All unresolved elements resolve to the root.
            if (child == null) {
                mostSpecificChildren[event] = root;
                continue;
            }
            // put path into event
            mostSpecificChildren[event] = child.getPrefix();
        } catch (ConceptConfigurationException ex) {
            log.error("Failed to resolve event {}-{} against concept {}", bucket, event, treeConcept, ex);
        }
    }
    if (cache != null) {
        log.trace("Hits: {}, Misses: {}, Hits/Misses: {}, %Hits: {} (Up to now)", cache.getHits(), cache.getMisses(), (double) cache.getHits() / cache.getMisses(), (double) cache.getHits() / (cache.getHits() + cache.getMisses()));
    }
    return mostSpecificChildren;
}