build checks.x86_64-linux.mutation-sydtest-mutation-example

  1. 144.11 s [sydtest-mutation-example-gen] coverage (13/32): Example\.LibSpec.addOne.returns 2 for input 1 (4 mutations)
  2. 144.16 s [sydtest-mutation-example-gen] coverage (9/32): Example\.FunctionExceptionLibSpec.addOneArithDisabled.increments by one (2 mutations)
  3. 144.16 s [sydtest-mutation-example-gen] coverage (19/32): Example\.OtherwiseLibSpec.classify.classifies positive numbers (9 mutations)
  4. 144.23 s [sydtest-mutation-example-gen] coverage (16/32): Example\.ListLibSpec.tripleConcat.distinguishes the last element (2 mutations)
  5. 144.23 s [sydtest-mutation-example-gen] coverage (21/32): Example\.OtherwiseLibSpec.classify.classifies zero (9 mutations)
  6. 144.24 s [sydtest-mutation-example-gen] coverage (25/32): Example\.LogicLibSpec.eitherPositive.is False when neither is positive (18 mutations)
  7. 144.25 s [sydtest-mutation-example-gen] coverage (22/32): Example\.DoLibSpec.greet.greets quietly (5 mutations)
  8. 144.30 s [sydtest-mutation-example-gen] coverage (10/32): Example\.FunctionExceptionLibSpec.addOneArithAndIntLitDisabled.increments by one (0 mutations)
  9. 144.41 s [sydtest-mutation-example-gen] coverage (6/32): Example\.BoolLibSpec.negateWrapped.negates Just True to Just False (0 mutations)
  10. 144.42 s [sydtest-mutation-example-gen] coverage (24/32): Example\.LogicLibSpec.eitherPositive.is True when only the first is positive (11 mutations)
  11. 144.48 s [sydtest-mutation-example-gen] coverage (15/32): Example\.ListLibSpec.pairConcat.concatenates both arguments (2 mutations)
  12. 144.48 s [sydtest-mutation-example-gen] coverage (17/32): Example\.ListLibSpec.tripleConcat.distinguishes the first element (2 mutations)
  13. 144.51 s [sydtest-mutation-example-gen] coverage (4/32): Example\.BoolLibSpec.wrapTrue.is Just True (2 mutations)
  14. 144.51 s [sydtest-mutation-example-gen] coverage (3/32): Example\.CaseLibSpec.describeList.describes empty lists (3 mutations)
  15. 144.53 s [sydtest-mutation-example-gen] coverage (14/32): Example\.ListLibSpec.pairConcat.preserves the order (2 mutations)
  16. 144.54 s [sydtest-mutation-example-gen] coverage (20/32): Example\.OtherwiseLibSpec.classify.classifies negative numbers (6 mutations)
  17. 144.55 s [sydtest-mutation-example-gen] coverage (27/32): Example\.LogicLibSpec.eitherPositive.is True when both are positive (11 mutations)
  18. 144.56 s [sydtest-mutation-example-gen] coverage (26/32): Example\.LogicLibSpec.eitherPositive.is True when only the second is positive (18 mutations)
  19. 144.57 s [sydtest-mutation-example-gen] coverage (23/32): Example\.DoLibSpec.greet.greets loudly (5 mutations)
  20. 144.60 s [sydtest-mutation-example-gen] coverage (5/32): Example\.BoolLibSpec.wrapFalse.is Just False (2 mutations)
  21. 144.61 s [sydtest-mutation-example-gen] coverage (2/32): Example\.CaseLibSpec.describeList.describes longer lists (3 mutations)
  22. 144.62 s [sydtest-mutation-example-gen] coverage (11/32): Example\.FunctionExceptionLibSpec.addOneFunctionDisabled.increments by one (0 mutations)
  23. 144.63 s [sydtest-mutation-example-gen] coverage (12/32): Example\.LibSpec.addOne.returns 6 for input 5 (4 mutations)
  24. 144.63 s [sydtest-mutation-example-gen] coverage (29/32): Example\.LogicLibSpec.bothPositive.is True when both are positive (18 mutations)
  25. 144.84 s [sydtest-mutation-example-gen] coverage (28/32): Example\.LogicLibSpec.bothPositive.is False when only the second is positive (11 mutations)