Module

Test.Spec.Tree

#Tree

data Tree c a

Constructors

Instances

#Item

newtype Item :: (Type -> Type) -> Type -> Typenewtype Item m a

Constructors

Instances

#ActionWith

type ActionWith :: (Type -> Type) -> Type -> Typetype ActionWith m a = a -> m Unit

#bimapTree

bimapTree :: forall a b c d. (Array String -> a -> b) -> (NonEmptyArray String -> c -> d) -> Tree a c -> Tree b d

#countTests

countTests :: forall c t. Array (Tree c t) -> Int

Count the total number of tests in a spec

#isAllParallelizable

isAllParallelizable :: forall c m a. Tree c (Item m a) -> Boolean

Return true if all items in the tree are parallelizable

#discardUnfocused

discardUnfocused :: forall c m a. Array (Tree c (Item m a)) -> Array (Tree c (Item m a))

If there is at least one focused element, all paths which don't lead to a focused element will be remove. otherwise input will be returned as unchanged.

#modifyAroundAction

modifyAroundAction :: forall g a b. (ActionWith g a -> ActionWith g b) -> Item g a -> Item g b

Modify around action of an Item

#PathItem

newtype PathItem

Constructors

Instances

#Path

#parentSuiteName

#parentSuite

parentSuite :: Path -> Maybe { name :: String, path :: Path }

Modules