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

net.automatalib.graphs.ads.impl.AbstractRecursiveADSSymbolNode Maven / Gradle / Ivy

Go to download

The core artifact of AutomataLib. This library contains concrete implementations for many of the automaton model interfaces defined in the API artifact, as well as abstract base classes that facilitate implementing new automaton model classes. Note that concrete algorithms (traversal, reachability analysis etc.) are not in the scope of this artifact.

There is a newer version: 0.11.0
Show newest version
/* Copyright (C) 2013-2018 TU Dortmund
 * This file is part of AutomataLib, http://www.automatalib.net/.
 *
 * 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.
 */
package net.automatalib.graphs.ads.impl;

import java.io.Serializable;
import java.util.HashMap;
import java.util.Map;

import net.automatalib.graphs.ads.RecursiveADSNode;

/**
 * An abstract implementation of a symbol node, that may be used by other ADS-extending classes.
 *
 * @param 
 *         (hypothesis) state type
 * @param 
 *         input alphabet type
 * @param 
 *         output alphabet type
 * @param 
 *         the concrete node type
 *
 * @author frohme
 */
public abstract class AbstractRecursiveADSSymbolNode>
        implements RecursiveADSNode, Serializable {

    private N parent;

    private I symbol;

    private final Map successors;

    public AbstractRecursiveADSSymbolNode(N parent, I symbol) {
        this.successors = new HashMap<>();
        this.parent = parent;
        this.symbol = symbol;
    }

    @Override
    public I getSymbol() {
        return this.symbol;
    }

    @Override
    public void setSymbol(I symbol) {
        this.symbol = symbol;
    }

    @Override
    public N getParent() {
        return this.parent;
    }

    @Override
    public void setParent(N parent) {
        this.parent = parent;
    }

    @Override
    public Map getChildren() {
        return this.successors;
    }

    @Override
    public boolean isLeaf() {
        return false;
    }

    @Override
    public S getHypothesisState() {
        return null;
    }

    @Override
    public void setHypothesisState(S state) {
        throw new UnsupportedOperationException("Cannot set hypothesis state on a symbol node");
    }

    @Override
    public String toString() {
        return this.symbol.toString();
    }
}