Tdd

Тесты — хорошо :)
Когда писать тесты?

Сколько писать тестов?

1.You may not write production code until you
have written a failing unit test.
2.You may not write more of a unit test than is
sufficient to fail, and not compiling is failing.
3.You may not write more production code than
is sufficient to pass the currently failing test.

Три закона TDD
«Clean Code», Robert C.Martin

Prime Factors Kata

Object Mentor, Inc.
www.objectmentor.com
blog.objectmentor.com

fitnesse.org www.junit.org
Copyright © 2005 by Object Mentor, Inc
All copies must retain this page unchanged.

1

package primeFactors;

import junit.framework.TestCase;

public class PrimeFactorsTest extends TestCase {
public void testOne() throws Exception {
assertEquals(list(),PrimeFactors.generate(1));
}
}

1



import java.util.List;

}

private List<Integer> list() {
return null;
}
}

1

package primeFactors; package primeFactors;

import junit.framework.TestCase; public class PrimeFactors {
}
import java.util.List;

}

return null;
}
}

1


import junit.framework.TestCase; import java.util.*;

import java.util.List; public class PrimeFactors {
public static List<Integer> generate(int n) {
public class PrimeFactorsTest extends TestCase { return new ArrayList<Integer>();
public void testOne() throws Exception { }
assertEquals(list(),PrimeFactors.generate(1)); }
}

return null;
}
}

1



import java.util.*; public class PrimeFactors {
assertEquals(list(),PrimeFactors.generate(1)); }
}

return new ArrayList<Integer>();
}
}

1



private List<Integer> list() { }
return new ArrayList<Integer>(); }
}

}
}

1 2



private List<Integer> list() { }
return new ArrayList<Integer>(); }
}

}

public void testTwo() throws Exception {
assertEquals(list(2),PrimeFactors.generate(2));
}
}

1 2



private List<Integer> list(int... ints) { varargs }
List<Integer> list = new ArrayList<Integer>(); }
for (int i : ints)
list.add(i);
return list;
}

}

}
}

1 2



public class PrimeFactorsTest extends TestCase { List<Integer> primes = new ArrayList<Integer>();
private List<Integer> list(int... ints) { if (n > 1) {
List<Integer> list = new ArrayList<Integer>(); primes.add(2);
for (int i : ints) }
list.add(i); return primes;
return list; }
} }

}

}
}

1 2


import static primeFactors.PrimeFactors.generate; import java.util.*;
return list; }
} }

assertEquals(list(),generate(1));
}

assertEquals(list(2),generate(2));
}
}

1 2 3


return list; }
} }

}

}

public void testThree() throws Exception {
}
}

1 2 3


List<Integer> list = new ArrayList<Integer>(); primes.add(n);
return list; }
} }

}

}

}
}

1 2 3 4


List<Integer> list = new ArrayList<Integer>(); primes.add(n);
return list; }
} }

}

}

}

public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}
}

1 2 3 4


List<Integer> list = new ArrayList<Integer>(); if (n%2 == 0) {
for (int i : ints) primes.add(2);
list.add(i); n /= 2;
return list; }
} if (n > 1)
primes.add(n);
assertEquals(list(),generate(1)); return primes;
} }
}
}

}

}
}

1 2 3 4 5


return list; }
} if (n > 1)
primes.add(n);
} }
}
}

}

}

public void testFive() throws Exception {
}
}

1 2 3 4 5 6


return list; }
} if (n > 1)
primes.add(n);
} }
}
}

}

}

}

public void testSix() throws Exception {
assertEquals(list(2,2,2),generate(8));
}
}

1 2 3 4 5 6


List<Integer> list = new ArrayList<Integer>(); while (n%2 == 0) {
list.add(i); n /= 2; ! ! !
return list; }
} if (n > 1)
primes.add(n);
} }
}
}

}

}

}

}
}

1 2 3 4 5 6 7

import static primeFactors.PrimeFactors.generate;
import java.util.*; package primeFactors;

public class PrimeFactorsTest extends TestCase { import java.util.*;
private List<Integer> list(int... ints) {
List<Integer> list = new ArrayList<Integer>(); public class PrimeFactors {
for (int i : ints) public static List<Integer> generate(int n) {
list.add(i); List<Integer> primes = new ArrayList<Integer>();
return list; if (n > 1) {
} while (n%2 == 0) {
primes.add(2);
public void testOne() throws Exception { n /= 2;
assertEquals(list(),generate(1)); }
} if (n > 1)
primes.add(n);
public void testTwo() throws Exception { }
return primes;
}
}
}
}

}

}

}

public void testSeven() throws Exception {
}
}

1 2 3 4 5 6 7


} int candidate = 2;
while (n%candidate == 0) {
public void testOne() throws Exception { primes.add(candidate);
assertEquals(list(),generate(1)); n /= candidate;
} }
if (n > 1)
public void testTwo() throws Exception { primes.add(n);
}
}
return primes;
}
assertEquals(list(3),generate(3)); }
}

}

}

}

}
}

1 2 3 4 5 6 7


} int candidate = 2;
while (n % candidate == 0) {
} }
}
public void testTwo() throws Exception { if (n > 1)
primes.add(n);
}
return primes;
}
}

}

}

}

}
}

1 2 3 4 5 6 7


return list; int candidate = 2;
} if (n > 1) {
} }
}
public void testTwo() throws Exception { if (n > 1)
primes.add(n);
}
return primes;
}
}

}

}

}

}
}

1 2 3 4 5 6 7


} while (n > 1) {
while (n % candidate == 0) { ! ! !
} }
candidate++;
if (n > 1)
}
primes.add(n);
return primes;
} }

}

}

}

}
}

1 2 3 4 5 6 7


} while (n > 1) {
} }
candidate++;
return primes;
}
}
}
}

}

}

}

}
}

1 2 3 4 5 6 7


} while (n > 1) {
for (; n%candidate == 0; n/=candidate)
} candidate++;
}
public void testTwo() throws Exception { return primes;
}
}
}
}

}

}

}

}
}

1 2 3 4 5 6 7


return list;
} for (int candidate = 2; n > 1; candidate++)
} return primes;
}
}

}

}

}

}

}
}

1 2 3 4 5 6 7


return list;
} for (int candidate = 2; n > 1; candidate++)
} return primes;
}
}

}


}

3 строчки кода!!!
}

}

}
}

Tdd

More Related Content

What's hot (20)

Viewers also liked (8)

Similar to Tdd (20)

Recently uploaded (20)

Tdd