net.automatalib.util.minimizer.HashMapInitialPartitioning 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
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.
/* Copyright (C) 2013-2019 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.util.minimizer;
import java.util.Collection;
import java.util.HashMap;
import java.util.Map;
import net.automatalib.graphs.UniversalIndefiniteGraph;
/**
* @param
* state class.
* @param
* transition
*
* @author Malte Isberner
*/
class HashMapInitialPartitioning implements InitialPartitioning {
private final Map> initialBlockMap = new HashMap<>();
private final UniversalIndefiniteGraph graph;
private int numExistingBlocks;
HashMapInitialPartitioning(UniversalIndefiniteGraph graph) {
this.graph = graph;
}
@Override
public Block getBlock(S origState) {
Object clazz = graph.getNodeProperty(origState);
return initialBlockMap.computeIfAbsent(clazz, k -> new Block<>(numExistingBlocks++));
}
@Override
public Collection> getInitialBlocks() {
return initialBlockMap.values();
}
}