org.specs2.data

Members list

Concise view

Type members

Classlikes

object AlwaysTag extends NamedTag

This tag will always keep its tagged element.

This tag will always keep its tagged element.

It is used to keep setup/teardown behaviour in specification whether examples are tagged or not and whatever is passed on the command line

Attributes

Graph
Supertypes
trait NamedTag
class Object
trait Matchable
class Any
Self type

Similar to the AlwaysTag this tag is keeping elements only if there is no included tags

Similar to the AlwaysTag this tag is keeping elements only if there is no included tags

Attributes

Graph
Supertypes
trait NamedTag
class Object
trait Matchable
class Any
Self type
case class DelOp(cost: Int) extends EditDistanceOp

Attributes

Graph
Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any

The EditDistance trait provides methods to compute the distance between 2 sequences

The EditDistance trait provides methods to compute the distance between 2 sequences

http://en.wikipedia.org/wiki/Edit_distance

Attributes

Companion:
object
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
object EditDistance.type
object EditDistance extends EditDistance

Attributes

Companion:
trait
Graph
Supertypes
class Object
trait Matchable
class Any
Self type

Attributes

Companion:
object
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes

Attributes

Companion:
trait
Graph
Supertypes
class Object
trait Matchable
class Any
Self type

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class DelOp
class InsOp
class SameOp
class SubstOp

Hopcroft-Karp (https://en.wikipedia.org/wiki/Hopcroft%E2%80%93Karp_algorithm) algorithm for finding the maximum matching in a bipartite graph

Hopcroft-Karp (https://en.wikipedia.org/wiki/Hopcroft%E2%80%93Karp_algorithm) algorithm for finding the maximum matching in a bipartite graph

This is used for "contain" matchers to find the best matches between actual and expected elements in 2 lists

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Self type

An IncludeExcludeTag is defined with inclusion/exclusion patterns

An IncludeExcludeTag is defined with inclusion/exclusion patterns

Attributes

Graph
Supertypes
trait NamedTag
class Object
trait Matchable
class Any
Known subtypes
class Tag
Self type

This trait provides a keep function which will determine if a element T must be kept with regards to:

This trait provides a keep function which will determine if a element T must be kept with regards to:

  • a list of include tags
  • a list of exclude tags
  • a matchFunction which say if the element matches a given tag

The element is kept if it is included and not excluded

  • it is included if the include list is empty or the element matches an including tag
  • it is excluded if the exclude list is not empty and the element matches an excluding tag

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
case class InsOp(cost: Int) extends EditDistanceOp

Attributes

Graph
Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait NamedTag

A tag with names.

A tag with names.

Given a list of names and the current arguments this tag must be able to determine if what it is tagging must be kept or not

Attributes

Companion:
object
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
object AlwaysTag.type
class Tag
Self type
object NamedTag

Attributes

Companion:
trait
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
case class SameOp(cost: Int) extends EditDistanceOp

Attributes

Graph
Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
case class SeparatedTags(included: String, excluded: String, orSeparator: String, andSeparator: String) extends IncludedExcluded[Seq[String]]

specialization of the IncludedExcluded trait for string separated tags

specialization of the IncludedExcluded trait for string separated tags

2 tags t1, t2 separated by a "," means that t1 OR t2 must be included (/excluded) 2 tags t1, t2 separated by a "&&" means that t1 AND t2 must be included (/excluded)

Attributes

Graph
Supertypes
trait Serializable
trait Product
trait Equals
trait IncludedExcluded[Seq[String]]
class Object
trait Matchable
class Any

Attributes

Graph
Supertypes
trait LevenhsteinCosts[Char]
trait EditDistanceCosts[Char]
class Object
trait Matchable
class Any
Self type
case class SubstOp(cost: Int) extends EditDistanceOp

Attributes

Graph
Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
case class Tag(names: String*) extends IncludeExcludeTag

tags the next element

tags the next element

Attributes

Graph
Supertypes
trait Serializable
trait Product
trait Equals
trait NamedTag
class Object
trait Matchable
class Any

Topological sorting is used to define the order of execution of dependent specifications when they form an acyclic graph

Topological sorting is used to define the order of execution of dependent specifications when they form an acyclic graph

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Self type
trait Trees

Utility methods for Trees

Utility methods for Trees

Attributes

Companion:
object
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
object Trees.type
Self type
object Trees extends Trees

Attributes

Companion:
trait
Graph
Supertypes
trait Trees
class Object
trait Matchable
class Any
Self type
Trees.type
case class UniqueNames(separator: String)

Stateful class to create unique names.

Stateful class to create unique names.

When the same name is asked for the second time, a unique int is attached to it

Attributes

Graph
Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any