ca.uqac.lif.ecp

Class TWayScoringTraceGenerator<T extends Event>

java.lang.Object

ca.uqac.lif.ecp.TraceGenerator<T>

ca.uqac.lif.ecp.TWayScoringTraceGenerator<T>

Type Parameters:

T - The type of the events in the traces that are generated

public class TWayScoringTraceGenerator<T extends Event>
extends TraceGenerator<T>

A t-way trace generator. This is an implementation of the t-sequence algorithm in the book Introduction to Combinatorial Testing, Figure 10.1.

Author:

Sylvain

Field Summary

Fields

Modifier and Type	Field and Description
protected Alphabet<T>	m_alphabet The alphabet used
protected int	m_maxIterations The maximum number of iterations of the algorithm, in case it does not succeed at achieving total coverage
protected int	m_numCandidates The number of candidate tests to generate at each iteration
protected java.util.Random	m_random A random number generator used to generate the random events
protected int	m_strength The strength of the test suite (i.e.

Constructor Summary

Constructors

Constructor and Description
TWayScoringTraceGenerator(Alphabet<T> alphabet, int strength, java.util.Random random) Creates a new trace generator

Method Summary

Modifier and Type	Method and Description
protected int	countCoveredCombinations(java.util.Map<java.util.Vector<T>,java.lang.Boolean> combinations) Computes the number of covered combinations in the present map (i.e.
TestSuite<T>	generateTraces() Generates a set of traces
protected java.util.Set<java.util.Vector<T>>	getCombinations() Gets the set of all combinations of t events
protected java.util.Set<java.util.Vector<T>>	getCombinations(Trace<T> trace) Gets the combinations of events contained in the current trace
protected java.util.Set<java.util.Vector<T>>	getCombinations(Trace<T> trace, java.util.Vector<T> current, int j, int n) Gets the combinations of events contained in the current trace
protected java.util.Set<java.util.Vector<T>>	getCombinations(java.util.Vector<T> prefix, Alphabet<T> remaining, int n) Gets the set of all combinations of t events
protected Trace<T>	getRandomTrace() Generates a random trace composed of all elements of the alphabet

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

m_strength

protected int m_strength

The strength of the test suite (i.e. the t in t-way)

m_alphabet

protected Alphabet<T extends Event> m_alphabet

The alphabet used

m_numCandidates

protected int m_numCandidates

The number of candidate tests to generate at each iteration

m_maxIterations

protected int m_maxIterations

The maximum number of iterations of the algorithm, in case it does not succeed at achieving total coverage

m_random

protected java.util.Random m_random

A random number generator used to generate the random events

Constructor Detail

TWayScoringTraceGenerator

public TWayScoringTraceGenerator(Alphabet<T> alphabet,
                                 int strength,
                                 java.util.Random random)

Creates a new trace generator

Parameters:

alphabet - The alphabet of events

strength - The strength of the test suite (i.e. the t in t-way)

Method Detail

generateTraces

public TestSuite<T> generateTraces()

Description copied from class: TraceGenerator

Generates a set of traces

Specified by:

generateTraces in class TraceGenerator<T extends Event>

Returns:

The set of traces

countCoveredCombinations

protected int countCoveredCombinations(java.util.Map<java.util.Vector<T>,java.lang.Boolean> combinations)

Computes the number of covered combinations in the present map (i.e. the number of entries set to true)

Parameters:

combinations - The map of combinations

Returns:

The number of covered combinations

getRandomTrace

protected Trace<T> getRandomTrace()

Generates a random trace composed of all elements of the alphabet

Returns:

The trace

getCombinations

protected java.util.Set<java.util.Vector<T>> getCombinations()

Gets the set of all combinations of t events

Returns:

The set of combinations

getCombinations

protected java.util.Set<java.util.Vector<T>> getCombinations(java.util.Vector<T> prefix,
                                                             Alphabet<T> remaining,
                                                             int n)

Gets the set of all combinations of t events

Parameters:

prefix -

remaining -

n -

Returns:

The set of combinations

getCombinations

protected java.util.Set<java.util.Vector<T>> getCombinations(Trace<T> trace)

Gets the combinations of events contained in the current trace

Parameters:

trace - The trace

Returns:

The set of combinations

getCombinations

protected java.util.Set<java.util.Vector<T>> getCombinations(Trace<T> trace,
                                                             java.util.Vector<T> current,
                                                             int j,
                                                             int n)

Gets the combinations of events contained in the current trace

Parameters:

trace - The trace

current - The current prefix to be considered

n - The number of events remaining to put

Returns:

The set of combinations