Package

org.specs2

data

Permalink

package data

Visibility
  1. Public
  2. All

Type Members

  1. case class DelOp(cost: Int) extends EditDistanceOp with Product with Serializable

    Permalink
  2. trait EditDistance extends AnyRef

    Permalink

    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

  3. trait EditDistanceCosts[T] extends AnyRef

    Permalink
  4. trait EditDistanceOp extends AnyRef

    Permalink
  5. trait IncludeExcludeTag extends NamedTag

    Permalink

    An IncludeExcludeTag is defined with inclusion/exclusion patterns

  6. trait IncludedExcluded[T] extends AnyRef

    Permalink

    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
  7. case class InsOp(cost: Int) extends EditDistanceOp with Product with Serializable

    Permalink
  8. trait LevenhsteinCosts[T] extends EditDistanceCosts[T]

    Permalink
  9. trait NamedTag extends AnyRef

    Permalink

    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

  10. trait Processes extends AnyRef

    Permalink

    Useful functions for processes

  11. case class SameOp(cost: Int) extends EditDistanceOp with Product with Serializable

    Permalink
  12. case class SeparatedTags(included: String, excluded: String, orSeparator: String = ",", andSeparator: String = "&&") extends IncludedExcluded[Seq[String]] with Product with Serializable

    Permalink

    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)

  13. trait Sized[T] extends AnyRef

    Permalink

    A trait for anything that can be sized

  14. trait Stepper[F[_], A] extends AnyRef

    Permalink

    Helper trait to step through a Process[F, A]

  15. case class SubstOp(cost: Int) extends EditDistanceOp with Product with Serializable

    Permalink
  16. case class Tag(names: String*) extends IncludeExcludeTag with Product with Serializable

    Permalink

    tags the next element

  17. trait Trees extends AnyRef

    Permalink

    Utility methods for scalaz Trees

  18. case class UniqueNames(separator: String = "_") extends Product with Serializable

    Permalink

    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

Value Members

  1. object AlwaysTag extends NamedTag

    Permalink

    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

  2. object AlwaysWhenNoIncludeTag extends NamedTag

    Permalink

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

  3. object EditDistance extends EditDistance

    Permalink
  4. object EditDistanceCosts

    Permalink
  5. object Fold

    Permalink

    Utility functions for folds

  6. object Graph

    Permalink
  7. object HopcroftKarp

    Permalink

    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

  8. object NamedTag

    Permalink
  9. object Processes extends Processes

    Permalink
  10. object Sized

    Permalink
  11. object StringLevenhsteinCosts extends LevenhsteinCosts[Char]

    Permalink
  12. object TopologicalSort

    Permalink

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

  13. object Trees extends Trees

    Permalink

Ungrouped