org.tensorics.core.tree.domain.ResolvingContextImpl Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of tensorics-core Show documentation

Tensorics is a java framework which uses a tensor as a central object. A tensor represents a set of values placed in an N-dimensional space. Wherever you are tempted to use maps of maps, a tensor might be a good choice ;-) Tensorics provides methods to create, transform and performing calculations with those tensors.

There is a newer version: 0.0.81

Show newest version

// @formatter:off
 /*******************************************************************************
 *
 * This file is part of tensorics.
 * 
 * Copyright (c) 2008-2011, CERN. All rights reserved.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 * 
 ******************************************************************************/
// @formatter:on

package org.tensorics.core.tree.domain;

import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;
import java.util.concurrent.ConcurrentHashMap;

/**
 * The simplest implementation of a resolving context. It is inspired by the original implementation in the TE-MPE
 * analysis package.
 * 
 * @author kfuchsbe
 */
public class ResolvingContextImpl implements EditableResolvingContext {

    private final Map resolvedExpressions = new ConcurrentHashMap<>();

    @Override
    public void putAllNew(ResolvingContext context) {
        for (Entry entry : ((ResolvingContextImpl) context).getRebuildingMap().entrySet()) {
            if (!resolvedExpressions.containsKey(entry.getKey())) {
                resolvedExpressions.put(entry.getKey(), entry.getValue());
            }
        }
    }

    @Override
    public int size() {
        return this.resolvedExpressions.size();
    }

    /**
     * Returns a map of instruction nodes to instruction nodes, which contains the nodes to be replaced as key and the
     * nodes which shall replace the old nodes as values.
     * 
     * @return the replacement mapping
     */
    private Map getRebuildingMap() {
        return new HashMap<>(resolvedExpressions);
    }

    @Override
    public > boolean resolves(E expression) {
        return expression.isResolved() || resolvedExpressions.containsKey(expression);
    }

    @Override
    public > R resolvedValueOf(E expression) {
        if (expression.isResolved()) {
            return expression.get();
        }

        /* This cast is safe, because we took care when putting the value that it has the right type */
        @SuppressWarnings("unchecked")
        R value = (R) resolvedExpressions.get(expression);

        if (value == null) {
            throw new IllegalArgumentException("No resolved value for expression '" + expression
                    + "' is available. Always use the isResolved() method before to check the availability.");
        }
        return value;
    }

    @Override
    public > void put(E key, R value) {
        resolvedExpressions.put(key, value);
    }

}