net.automatalib.incremental.mealy.tree.Node Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of automata-incremental Show documentation

A library for incremental automata construction. This artifact contains algorithms for incrementally constructing DFAs (prefix-closed and non-prefix-closed), Mealy machines, and Moore machines from a finite, incrementally growing set of example inputs/outputs.

There is a newer version: 0.11.0

Show newest version

/* Copyright (C) 2014 TU Dortmund
 * This file is part of AutomataLib, http://www.automatalib.net/.
 * 
 * AutomataLib is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License version 3.0 as published by the Free Software Foundation.
 * 
 * AutomataLib is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public
 * License along with AutomataLib; if not, see
 * http://www.gnu.de/documents/lgpl.en.html.
 */
package net.automatalib.incremental.mealy.tree;

import java.util.Objects;

import net.automatalib.incremental.ConflictException;

final class Node {
	private final Edge[] outEdges;
	
	
	@SuppressWarnings("unchecked")
	public Node(int alphabetSize) {
		this.outEdges = new Edge[alphabetSize];
	}
	
	public Edge getEdge(int idx) {
		return outEdges[idx];
	}
	
	public void setEdge(int idx, Edge edge) {
		outEdges[idx] = edge;
	}
	
	public void setSuccessor(int idx, O output, Node succ) {
		outEdges[idx] = new Edge(output, succ);
	}
	
	public Node getSuccessor(int idx) {
		Edge edge = outEdges[idx];
		if(edge != null) {
			return edge.getTarget();
		}
		return null;
	}
	
	public Node successor(int idx, O output) throws ConflictException {
		Edge edge = outEdges[idx];
		if(edge != null) {
			if(!Objects.equals(output, edge.getOutput())) {
				throw new ConflictException("Output mismatch: '" + output + "' vs '" + edge.getOutput() + "'");
			}
			return edge.getTarget();
		}
		Node succ = new Node(outEdges.length);
		edge = new Edge(output, succ);
		outEdges[idx] = edge;
		
		return succ;
	}
}