Mutation test report

Current display: example/source.dart - back to top Detected Total Percentage
Date: 2022-10-29 21:04:55.767501 Mutations: 27 36 75.0 %
Builtin rules: true Timeouts: 0 36 0.0 %

          Source code
       1 /// Copyright 2021, domohuhn.
       2 /// License: BSD-3-Clause
       3 /// See LICENSE for the full text of the license
       4 
       5 int conditions(int a, int b, int c) {

Undetected mutations:
1 :+ if (a == b && (a < c || b > c && b == c)) {

2 :+ if (a == b && (a < c || b > c || b != c)) {

3 :+ if (a == b && (a < c ||!( b > c )|| b == c)) {

4 :+ if (a == b && (a < c || b > c ||!( b == c))) {
Detected mutations:
1 :+ if (a == b || (a < c || b > c || b == c)) {

2 :+ if (a == b && (a < c && b > c || b == c)) {

3 :+ if (a != b && (a < c || b > c || b == c)) {

4 :+ if (!(a == b && (a < c || b > c || b == c))) {

5 :+ if (!(a == b )&& (a < c || b > c || b == c)) {

6 :+ if (a == b &&!(a < c || b > c || b == c)) {
Detected mutations:
1 :+ return a - c;

2 :+ return a * c;
Undetected mutations:
1 :+ } else if (b <= 0 || c > 0) {

2 :+ } else if (b < 0 && c > 0) {
Detected mutations:
1 :+ } else if (b == 0 && c > 0) {

2 :+ } else if (!(b <= 0 && c > 0)) {

3 :+ } else if (!(b <= 0 )&& c > 0) {

4 :+ } else if (b <= 0 &&!( c > 0)) {

5 :+ } else if (!(b <= 0 )&& c > 0) {

6 :+ } else if (b <= 0 &&!( c > 0)) {
Detected mutations:
1 :+ return a + b;

2 :+ return a * b;
10 } 11 for (var i = 0; i < 10; ++i) {} 12 var i = 0; 13 while (i < 10) { 14 ++i; 15 }
Undetected mutations:
1 :+ return a * b - c;
Detected mutations:
1 :+ return a * b * c;

2 :+ return a + b + c;

3 :+ return a - b + c;
17 } 18 19 double poly(double x, double a, double b, double c) {
Undetected mutations:
1 :+ return a * x * x + b * x - c;

2 :+ return a * x + x + b * x + c;
Detected mutations:
1 :+ return a * x * x - b * x + c;

2 :+ return a * x * x * b * x + c;

3 :+ return a * x * x + b * x * c;

4 :+ return a + x * x + b * x + c;

5 :+ return a - x * x + b * x + c;

6 :+ return a * x - x + b * x + c;

7 :+ return a * x * x + b + x + c;

8 :+ return a * x * x + b - x + c;
21 } 22