net.automatalib.util.tries.SharedSuffixTrieNode Maven / Gradle / Ivy

Go to download

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

This artifact provides various common utility operations for analyzing and manipulating automata and graphs, such as traversal, minimization and copying.

There is a newer version: 0.11.0

Show newest version

/* Copyright (C) 2013 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.util.tries;

/**
 * A node in a {@link SharedSuffixTrie}. This class maintains an
 * array containing all children, in order to avoid inserting
 * duplicates.
 * 
 * @author Malte Isberner 
 *
 * @param  symbol class.
 */
final class SharedSuffixTrieNode extends SuffixTrieNode {
	
	SharedSuffixTrieNode[] children;

	/**
	 * Root constructor.
	 */
	public SharedSuffixTrieNode() {
	}

	/**
	 * Constructor.
	 * 
	 * @param symbol the symbol to prepend.
	 * @param parent the trie node representing the remaining suffix.
	 */
	public SharedSuffixTrieNode(I symbol, SuffixTrieNode parent) {
		super(symbol, parent);
	}

}