185.50K

Категория:

Программирование

Похожие презентации:

Generic Collections Java Core

Generics. (Lecture 7.3)

Java. Unit and Integration Testing

Java Collections Framework

Вложенные классы и перечисления. Локальные и анонимные классы

7. Java databases and JDBC 3. JDBC Additional Tasks

C# Collections. Generic Collections

Serialization in Java

Interfaces Polymorphism

5. Java collections and Generics. 3. Generics

Prime factors kata. Generating prime factors

1. 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.

2. Generating Prime Factors.

Although quite short, this kata is fascinating in the way it shows how ‘if’ statements
become ‘while’ statements as the number of test cases increase. It’s also a
wonderful example of how algorithms sometimes become simpler as they become
more general.
I stumbled upon this little kata one evening when my son was in 7th grade. He
had just discovered that all numbers can be broken down into a product of primes
and was interested in exploring this further. So I wrote a little ruby program, testfirst, and was stunned by how the algorithm evolved.
I have done this particular kata in Java 5.0. This should give you a feel for the
power and convenience of some of the new features.

3. The Requirements.

Prime Factors
+ generate(n : int)
• Write a class named “PrimeFactors” that
has one static method: generate.
– The generate method takes an integer
argument and returns a List<Integer>. That
list contains the prime factors in numerical
sequence.

4. Begin.

• Create a project named PrimeFactors
• Create a package named primeFactors
• Create a unit test named
PrimeFactorsTest
package primeFactors;
import junit.framework.TestCase;
public class PrimeFactorsTest extends TestCase {
}
No tests found in primeFactors.PrimeFactorsTest

5. The first test.

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

6. The first test.

package primeFactors;
import junit.framework.TestCase;
import java.util.List;
public class PrimeFactorsTest extends TestCase {
public void testOne() throws Exception {
assertEquals(list(),PrimeFactors.generate(1));
}
private List<Integer> list() {
return null;
}
}

7. The first test.

package primeFactors;
package primeFactors;
import junit.framework.TestCase;
public class PrimeFactors {
}
import java.util.List;
public class PrimeFactorsTest extends TestCase {
public void testOne() throws Exception {
assertEquals(list(),PrimeFactors.generate(1));
}
private List<Integer> list() {
return null;
}
}

8. The first test.

package primeFactors;
package primeFactors;
import junit.framework.TestCase;
import java.util.*;
import java.util.List;
public class PrimeFactors {
public static List<Integer> generate(int n) {
return new ArrayList<Integer>();
}
}
public class PrimeFactorsTest extends TestCase {
public void testOne() throws Exception {
assertEquals(list(),PrimeFactors.generate(1));
}
private List<Integer> list() {
return null;
}
}
expected:<null> but was:<[]>

9. The first test.

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

10. The first test.

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

11. The Second Test

12. The Second test.

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

13. The Second test.

package primeFactors;
package primeFactors;
import junit.framework.TestCase;
import java.util.*;
import java.util.*;
public class PrimeFactors {
public static List<Integer> generate(int n) {
return new ArrayList<Integer>();
}
}
public class PrimeFactorsTest extends TestCase {
private List<Integer> list(int... ints) {
List<Integer> list = new ArrayList<Integer>();
for (int i : ints)
list.add(i);
return list;
}
varargs
public void testOne() throws Exception {
assertEquals(list(),PrimeFactors.generate(1));
}
public void testTwo() throws Exception {
assertEquals(list(2),PrimeFactors.generate(2));
}
}
expected:<[2]> but was:<[]>

14. The Second test.

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

15. The Second test.

16. The Third Test

17. The Third test.

package primeFactors;
package primeFactors;
import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;
import java.util.*;
public class PrimeFactorsTest extends TestCase {
private List<Integer> list(int... ints) {
List<Integer> list = new ArrayList<Integer>();
for (int i : ints)
list.add(i);
return list;
}
public class PrimeFactors {
public static List<Integer> generate(int n) {
List<Integer> primes = new ArrayList<Integer>();
if (n > 1) {
primes.add(2);
}
return primes;
}
}
public void testOne() throws Exception {
assertEquals(list(),generate(1));
}
public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}
public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}
}
expected:<[3]> but was:<[2]>

18. The Third test.

19. The Fourth Test

20. The Fourth test.

package primeFactors;
package primeFactors;
import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;
import java.util.*;
public class PrimeFactorsTest extends TestCase {
private List<Integer> list(int... ints) {
List<Integer> list = new ArrayList<Integer>();
for (int i : ints)
list.add(i);
return list;
}
public class PrimeFactors {
public static List<Integer> generate(int n) {
List<Integer> primes = new ArrayList<Integer>();
if (n > 1) {
primes.add(n);
}
return primes;
}
}
public void testOne() throws Exception {
assertEquals(list(),generate(1));
}
public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}
public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}
public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}
}
expected:<[2, 2]> but was:<[4]>

21. The Fourth test.

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

22. The Fifth Test

23. The Fifth test.

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

24. The Sixth Test

25. The Sixth test.

package primeFactors;
package primeFactors;
import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;
import java.util.*;
public class PrimeFactorsTest extends TestCase {
private List<Integer> list(int... ints) {
List<Integer> list = new ArrayList<Integer>();
for (int i : ints)
list.add(i);
return list;
}
public void testOne() throws Exception {
assertEquals(list(),generate(1));
}
public class PrimeFactors {
public static List<Integer> generate(int n) {
List<Integer> primes = new ArrayList<Integer>();
if (n > 1) {
if (n%2 == 0) {
primes.add(2);
n /= 2;
}
if (n > 1)
primes.add(n);
}
return primes;
}
}
public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}
public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}
public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}
public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}
public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}
}
expected:<[2, 2, 2]> but was:<[2, 4]>

26. The Sixth test.

package primeFactors;
package primeFactors;
import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;
import java.util.*;
public class PrimeFactorsTest extends TestCase {
private List<Integer> list(int... ints) {
List<Integer> list = new ArrayList<Integer>();
for (int i : ints)
list.add(i);
return list;
}
public void testOne() throws Exception {
assertEquals(list(),generate(1));
}
public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}
public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}
public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}
public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}
public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}
}
public class PrimeFactors {
public static List<Integer> generate(int n) {
List<Integer> primes = new ArrayList<Integer>();
if (n > 1) {
while (n%2 == 0) {
!!!
primes.add(2);
n /= 2;
}
if (n > 1)
primes.add(n);
}
return primes;
}
}

27. The Seventh Test

28. The Seventh test.

package primeFactors;
The Seventh test.
import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;
public class PrimeFactorsTest extends TestCase {
private List<Integer> list(int... ints) {
List<Integer> list = new ArrayList<Integer>();
for (int i : ints)
list.add(i);
return list;
}
public void testOne() throws Exception {
assertEquals(list(),generate(1));
}
public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}
public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}
package primeFactors;
import java.util.*;
public class PrimeFactors {
public static List<Integer> generate(int n) {
List<Integer> primes = new ArrayList<Integer>();
if (n > 1) {
while (n%2 == 0) {
primes.add(2);
n /= 2;
}
if (n > 1)
primes.add(n);
}
return primes;
}
}
public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}
public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}
public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}
public void testNine() throws Exception {
assertEquals(list(3,3),generate(9));
}
}
expected:<[3, 3]> but was:<[9]>

29. The Seventh test.

package primeFactors;
The Seventh test.
import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;
public class PrimeFactorsTest extends TestCase {
private List<Integer> list(int... ints) {
List<Integer> list = new ArrayList<Integer>();
for (int i : ints)
list.add(i);
return list;
}
public void testOne() throws Exception {
assertEquals(list(),generate(1));
}
public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}
public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}
package primeFactors;
import java.util.*;
public class PrimeFactors {
public static List<Integer> generate(int n) {
List<Integer> primes = new ArrayList<Integer>();
if (n > 1) {
int candidate = 2;
while (n%candidate == 0) {
primes.add(candidate);
n /= candidate;
}
if (n > 1)
primes.add(n);
}
return primes;
}
}
public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}
public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}
public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}
public void testNine() throws Exception {
assertEquals(list(3,3),generate(9));
}
}
expected:<[3, 3]> but was:<[9]>

30. The Seventh test.

package primeFactors;
The Seventh test.
import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;
public class PrimeFactorsTest extends TestCase {
private List<Integer> list(int... ints) {
List<Integer> list = new ArrayList<Integer>();
for (int i : ints)
list.add(i);
return list;
}
public void testOne() throws Exception {
assertEquals(list(),generate(1));
}
public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}
public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}
package primeFactors;
import java.util.*;
public class PrimeFactors {
public static List<Integer> generate(int n) {
List<Integer> primes = new ArrayList<Integer>();
if (n > 1) {
int candidate = 2;
while (n % candidate == 0) {
primes.add(candidate);
n /= candidate;
}
}
if (n > 1)
primes.add(n);
return primes;
}
}
public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}
public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}
public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}
public void testNine() throws Exception {
assertEquals(list(3,3),generate(9));
}
}
expected:<[3, 3]> but was:<[9]>

31. The Seventh test.

package primeFactors;
The Seventh test.
import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;
public class PrimeFactorsTest extends TestCase {
private List<Integer> list(int... ints) {
List<Integer> list = new ArrayList<Integer>();
for (int i : ints)
list.add(i);
return list;
}
public void testOne() throws Exception {
assertEquals(list(),generate(1));
}
public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}
public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}
package primeFactors;
import java.util.*;
public class PrimeFactors {
public static List<Integer> generate(int n) {
List<Integer> primes = new ArrayList<Integer>();
int candidate = 2;
if (n > 1) {
while (n % candidate == 0) {
primes.add(candidate);
n /= candidate;
}
}
if (n > 1)
primes.add(n);
return primes;
}
}
public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}
public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}
public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}
public void testNine() throws Exception {
assertEquals(list(3,3),generate(9));
}
}
expected:<[3, 3]> but was:<[9]>

32. The Seventh test.

package primeFactors;
The Seventh test.
import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;
public class PrimeFactorsTest extends TestCase {
private List<Integer> list(int... ints) {
List<Integer> list = new ArrayList<Integer>();
for (int i : ints)
list.add(i);
return list;
}
public void testOne() throws Exception {
assertEquals(list(),generate(1));
}
public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}
public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}
package primeFactors;
import java.util.*;
public class PrimeFactors {
public static List<Integer> generate(int n) {
List<Integer> primes = new ArrayList<Integer>();
int candidate = 2;
if (n > 1) {
while (n % candidate == 0) {
primes.add(candidate);
n /= candidate;
}
}
if (n > 1)
primes.add(n);
return primes;
}
}
public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}
public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}
public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}
public void testNine() throws Exception {
assertEquals(list(3,3),generate(9));
}
}
expected:<[3, 3]> but was:<[9]>

33. The Seventh test.

package primeFactors;
The Seventh test.
import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;
public class PrimeFactorsTest extends TestCase {
private List<Integer> list(int... ints) {
List<Integer> list = new ArrayList<Integer>();
for (int i : ints)
list.add(i);
return list;
}
public void testOne() throws Exception {
assertEquals(list(),generate(1));
}
public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}
public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}
public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}
public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}
public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}
public void testNine() throws Exception {
assertEquals(list(3,3),generate(9));
}
}
package primeFactors;
import java.util.*;
public class PrimeFactors {
public static List<Integer> generate(int n) {
List<Integer> primes = new ArrayList<Integer>();
int candidate = 2;
while (n > 1) {
!!!
while (n % candidate == 0) {
primes.add(candidate);
n /= candidate;
}
candidate++;
}
if (n > 1)
primes.add(n);
return primes;
}
}

34. The Seventh test.

package primeFactors;
The Seventh test.
import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;
public class PrimeFactorsTest extends TestCase {
private List<Integer> list(int... ints) {
List<Integer> list = new ArrayList<Integer>();
for (int i : ints)
list.add(i);
return list;
}
public void testOne() throws Exception {
assertEquals(list(),generate(1));
}
public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}
public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}
public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}
public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}
public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}
public void testNine() throws Exception {
assertEquals(list(3,3),generate(9));
}
}
package primeFactors;
import java.util.*;
public class PrimeFactors {
public static List<Integer> generate(int n) {
List<Integer> primes = new ArrayList<Integer>();
int candidate = 2;
while (n > 1) {
while (n % candidate == 0) {
primes.add(candidate);
n /= candidate;
}
candidate++;
}
return primes;
}
}

35. The Seventh test.

package primeFactors;
The Seventh test.
import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;
public class PrimeFactorsTest extends TestCase {
private List<Integer> list(int... ints) {
List<Integer> list = new ArrayList<Integer>();
for (int i : ints)
list.add(i);
return list;
}
public void testOne() throws Exception {
assertEquals(list(),generate(1));
}
public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}
public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}
public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}
public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}
public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}
public void testNine() throws Exception {
assertEquals(list(3,3),generate(9));
}
}
package primeFactors;
import java.util.*;
public class PrimeFactors {
public static List<Integer> generate(int n) {
List<Integer> primes = new ArrayList<Integer>();
int candidate = 2;
while (n > 1) {
for (; n%candidate == 0; n/=candidate)
primes.add(candidate);
candidate++;
}
return primes;
}
}

36. The Seventh test.

package primeFactors;
The Seventh test.
import static primeFactors.PrimeFactors.generate;
import junit.framework.TestCase;
import java.util.*;
public class PrimeFactorsTest extends TestCase {
private List<Integer> list(int... ints) {
List<Integer> list = new ArrayList<Integer>();
for (int i : ints)
list.add(i);
return list;
}
package primeFactors;
import java.util.*;
public class PrimeFactors {
public static List<Integer> generate(int n) {
List<Integer> primes = new ArrayList<Integer>();
for (int candidate = 2; n > 1; candidate++)
for (; n%candidate == 0; n/=candidate)
primes.add(candidate);
public void testOne() throws Exception {
assertEquals(list(),generate(1));
}
return primes;
}
public void testTwo() throws Exception {
assertEquals(list(2),generate(2));
}
public void testThree() throws Exception {
assertEquals(list(3),generate(3));
}
public void testFour() throws Exception {
assertEquals(list(2,2),generate(4));
}
public void testSix() throws Exception {
assertEquals(list(2,3),generate(6));
}
public void testEight() throws Exception {
assertEquals(list(2,2,2),generate(8));
}
public void testNine() throws Exception {
assertEquals(list(3,3),generate(9));
}
}
}
The algorith is three lines of code!

37. END

English Русский Правила