Created
January 11, 2013 10:05
-
-
Save debop/4509456 to your computer and use it in GitHub Desktop.
Parallels Test Code
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
@Slf4j | |
public class ParallelsTest { | |
private static final int LowerBound = 0; | |
private static final int UpperBound = 99999; | |
@Test | |
public void parallelRunAction() { | |
final Action1<Integer> action1 = | |
new Action1<Integer>() { | |
@Override | |
public void perform(Integer x) { | |
for (int i = LowerBound; i < UpperBound; i++) { | |
Hero.findRoot(i); | |
} | |
if (log.isDebugEnabled()) | |
log.debug("FindRoot({}) returns [{}]", UpperBound, Hero.findRoot(UpperBound)); | |
} | |
}; | |
@Cleanup | |
AutoStopwatch stopwatch = new AutoStopwatch(); | |
Parallels.run(Range.range(0, 100), action1); | |
} | |
@Test | |
public void parallelRunFunction() { | |
final Function1<Integer, Double> function1 = | |
new Function1<Integer, Double>() { | |
@Override | |
public Double execute(Integer x) { | |
for (int i = LowerBound; i < UpperBound; i++) { | |
Hero.findRoot(i); | |
} | |
if (log.isDebugEnabled()) | |
log.debug("FindRoot({}) returns [{}]", UpperBound, Hero.findRoot(UpperBound)); | |
return Hero.findRoot(UpperBound); | |
} | |
}; | |
@Cleanup | |
AutoStopwatch stopwatch = new AutoStopwatch(); | |
List<Double> results = Parallels.run(Range.range(0, 100), function1); | |
Assert.assertNotNull(results); | |
Assert.assertEquals(100, results.size()); | |
} | |
public static class Hero { | |
private static final double Tolerance = 1.0e-10; | |
public static double findRoot(double number) { | |
double guess = 1.0; | |
double error = Math.abs(guess * guess - number); | |
while (error > Tolerance) { | |
guess = (number / guess + guess) / 2.0; | |
error = Math.abs(guess * guess - number); | |
} | |
return guess; | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment