@Nullable
public InstanceFactory findInstanceFactory(@Nonnull Type mockedType) {
InstanceFactory instanceFactory = mockedTypesAndInstances.get(mockedType);
if (instanceFactory != null) {
return instanceFactory;
}
Class<?> mockedClass = getClassType(mockedType);
//noinspection ReuseOfLocalVariable
instanceFactory = mockedTypesAndInstances.get(mockedClass);
if (instanceFactory != null) {
return instanceFactory;
}
boolean abstractType = mockedClass.isInterface() || isAbstract(mockedClass.getModifiers());
for (Entry<Type, InstanceFactory> entry : mockedTypesAndInstances.entrySet()) {
Type registeredMockedType = entry.getKey();
Class<?> registeredMockedClass = getClassType(registeredMockedType);
if (abstractType) {
registeredMockedClass = getMockedClassOrInterfaceType(registeredMockedClass);
}
if (mockedClass.isAssignableFrom(registeredMockedClass)) {
instanceFactory = entry.getValue();
break;
}
}
return instanceFactory;
}
boolean isEquivalentInstance(
@Nonnull Object invocationInstance, @Nonnull Object invokedInstance) {
return invocationInstance == invokedInstance
|| invocationInstance == replacementMap.get(invokedInstance)
|| invocationInstance == instanceMap.get(invokedInstance)
|| invokedInstance == instanceMap.get(invocationInstance)
|| TestRun.getExecutingTest()
.isInvokedInstanceEquivalentToCapturedInstance(invocationInstance, invokedInstance);
}
void restoreRedefinedClasses(@Nonnull Map<?, byte[]> previousDefinitions) {
if (redefinedClasses.isEmpty()) {
return;
}
RedefinitionEngine redefinitionEngine = new RedefinitionEngine();
Iterator<Entry<Class<?>, byte[]>> itr = redefinedClasses.entrySet().iterator();
while (itr.hasNext()) {
Entry<Class<?>, byte[]> entry = itr.next();
Class<?> redefinedClass = entry.getKey();
byte[] currentDefinition = entry.getValue();
byte[] previousDefinition = previousDefinitions.get(redefinedClass);
//noinspection ArrayEquality
if (currentDefinition != previousDefinition) {
redefinitionEngine.restoreDefinition(redefinedClass, previousDefinition);
if (previousDefinition == null) {
restoreDefinition(redefinedClass);
discardStateForCorrespondingMockClassIfAny(redefinedClass);
itr.remove();
} else {
entry.setValue(previousDefinition);
}
}
}
}
private void restoreAndRemoveTransformedClasses(
@Nonnull Set<ClassIdentification> classesToRestore) {
RedefinitionEngine redefinitionEngine = new RedefinitionEngine();
for (ClassIdentification transformedClassId : classesToRestore) {
byte[] definitionToRestore = transformedClasses.get(transformedClassId);
redefinitionEngine.restoreToDefinition(
transformedClassId.getLoadedClass(), definitionToRestore);
}
transformedClasses.keySet().removeAll(classesToRestore);
}
boolean areInDifferentEquivalenceSets(@Nonnull Object mock1, @Nonnull Object mock2) {
if (mock1 == mock2 || instanceMap.isEmpty()) {
return false;
}
Object mock1Equivalent = instanceMap.get(mock1);
Object mock2Equivalent = instanceMap.get(mock2);
if (mock1Equivalent == mock2 || mock2Equivalent == mock1) {
return false;
}
if (mock1Equivalent != null && mock2Equivalent != null) {
return true;
}
return instanceMapHasMocksInSeparateEntries(mock1, mock2);
}
/**
* Returns the paraneter name for the passed value.
*
* @param s
* @return The parameter name in effect.
*/
public String p(String s) {
return parameterNames.get(s);
}
/**
* Looks up a parameter name.
*
* @param name The name of the parameter.
* @return A name.
*/
public String getParamName(String name) {
return parameterNames.get(name);
}
/**
* Looks up a run option value.
*
* @param name The name of the option.
* @return a true or false.
*/
public boolean getRunOption(String name) {
return runOptions.get(name);
}
@Nullable
Object getReplacementInstanceForMethodInvocation(
@Nonnull Object invokedInstance, @Nonnull String methodNameAndDesc) {
return methodNameAndDesc.charAt(0) == '<' ? null : replacementMap.get(invokedInstance);
}
/**
* Compute the minimal triangulation of the graph. Implementation of Algorithm MCS-M+ as described
* in Berry et al. (2010), DOI:10.3390/a3020197 <a href="http://www.mdpi.com/1999-4893/3/2/197">
* http://www.mdpi.com/1999-4893/3/2/197</a>
*/
private void computeMinimalTriangulation() {
// initialize chordGraph with same vertices as graph
chordalGraph = new SimpleGraph<>(graph.getEdgeFactory());
for (V v : graph.vertexSet()) {
chordalGraph.addVertex(v);
}
// initialize g' as subgraph of graph (same vertices and edges)
final UndirectedGraph<V, E> gprime = copyAsSimpleGraph(graph);
int s = -1;
generators = new ArrayList<>();
meo = new LinkedList<>();
final Map<V, Integer> vertexLabels = new HashMap<>();
for (V v : gprime.vertexSet()) {
vertexLabels.put(v, 0);
}
for (int i = 1, n = graph.vertexSet().size(); i <= n; i++) {
V v = getMaxLabelVertex(vertexLabels);
LinkedList<V> Y = new LinkedList<>(Graphs.neighborListOf(gprime, v));
if (vertexLabels.get(v) <= s) {
generators.add(v);
}
s = vertexLabels.get(v);
// Mark x reached and all other vertices of gprime unreached
HashSet<V> reached = new HashSet<>();
reached.add(v);
// mark neighborhood of x reached and add to reach(label(y))
HashMap<Integer, HashSet<V>> reach = new HashMap<>();
// mark y reached and add y to reach
for (V y : Y) {
reached.add(y);
addToReach(vertexLabels.get(y), y, reach);
}
for (int j = 0; j < graph.vertexSet().size(); j++) {
if (!reach.containsKey(j)) {
continue;
}
while (reach.get(j).size() > 0) {
// remove a vertex y from reach(j)
V y = reach.get(j).iterator().next();
reach.get(j).remove(y);
for (V z : Graphs.neighborListOf(gprime, y)) {
if (!reached.contains(z)) {
reached.add(z);
if (vertexLabels.get(z) > j) {
Y.add(z);
E fillEdge = graph.getEdgeFactory().createEdge(v, z);
fillEdges.add(fillEdge);
addToReach(vertexLabels.get(z), z, reach);
} else {
addToReach(j, z, reach);
}
}
}
}
}
for (V y : Y) {
chordalGraph.addEdge(v, y);
vertexLabels.put(y, vertexLabels.get(y) + 1);
}
meo.addLast(v);
gprime.removeVertex(v);
vertexLabels.remove(v);
}
}