I’ve made an update of my benchmark about file copy methods in Java. I’ve been asked for new informations about this benchmark and for new test, so I’ve included more results and informations. This new version include two new complete benchmarks : Benchmark on the same disk (Ext4) Benchmark between two disks (Ext4 -> Ext4) […]
Yesterday I wondered if the copyFile method in JTheque Utils was the best method or if I need to change. So I decided to do a benchmark. So I searched all the methods to copy a File in Java, even the bad methods and found 5 methods : Native Copy : Make the copy using […]
Finding the closest pair of Point in a given collection of points is a standard problem in computational geometry. In this article I’ll explain an efficient algorithm using plane sweep, compare it to the naive implementation and discuss its complexity.
Several months ago, I wrote an article to compare the performances of short indexes for loops. I wrote that code to achieve my goal : And i found as a result that short was two times slower than int and I was convinced of these results until a week ago. At this time, a reader […]
After a post I read on a french forum, i asked myself of the performances using shorts as loop indexes for loop with few iterations (less than 32768). At first view, it can be tempting because we save 2 octets, so why use an int instead a short ? But, when we think of that, […]