I have already written about approximations of e^x, log(x) and pow(a, b) in my post Optimized Exponential Functions for Java. Now I have more In particular, the pow() function is now even faster, simpler, and more accurate. Without further ado, I proudly give you the brand new approximation:
Approximation of pow() in Java

public static double [...]

The Javadoc Search Engine now searches JDK 7 too:

Go here: javadoc.ankerl.com

It’s still a draft, so the documentation is surely subject to change. You can also use the search directly from here:

happy hacking!

addthis_url = ‘http%3A%2F%2Fmartin.ankerl.com%2F2007%2F08%2F22%2Fjavadoc-search-engine-updated%2F’;
addthis_title = ‘Javadoc+Search+Engine+Updated’;
addthis_pub = ”;

Thanks to Google Co-op I have just created a new search engine that searches the JDK documentation. It is quite convenient because you can use the labels to choose which version you like to see:

http://javadoc.ankerl.com/

Happy googling.

addthis_url = ‘http%3A%2F%2Fmartin.ankerl.com%2F2007%2F07%2F20%2Fjava-developer-kit-jdk-search-engine%2F’;
addthis_title = ‘Java+Developer+Kit+%28JDK%29+Search+Engine’;
addthis_pub = ”;

I have updated the code for the Math.pow() approximation, now it is 11 times faster on my Pentium IV. Read Optimized Exponential Functions for Java for more information. Now I can also give you some benchmarks:

addthis_url = ‘http%3A%2F%2Fmartin.ankerl.com%2F2007%2F02%2F12%2Fexponential-functions-benchmarks-11-times-faster-mathpow%2F’;
addthis_title = ‘Exponential+Functions%3A+Benchmarks%2C+8+Times+Faster+Math.pow%28%29′;
addthis_pub [...]

As part of another project I am developing ensure4j. The syntax (see the examples here) is working quite nicely, ensure4j is already very useful for internal use.
Lately I was busy adding tests that are able to verify if some code (e.g. an optimizer that uses random, like genetic algorithm, simulated annealing, …) produces the desired [...]