The EditDistance trait provides methods to compute the distance between 2 sequences
An IncludeExcludeTag is defined with inclusion/exclusion patterns
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:
The element is kept if it is included and not excluded
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
Useful functions for processes
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)
A trait for anything that can be sized
Helper trait to step through a Process[F, A]
tags the next element
Utility methods for scalaz Trees
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
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
Similar to the AlwaysTag this tag is keeping elements only if there is no included tags
Utility functions for folds
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
Topological sorting is used to define the order of execution of dependent specifications when they form an acyclic graph
The EditDistance trait provides methods to compute the distance between 2 sequences
http://en.wikipedia.org/wiki/Edit_distance