Categories

Updated: 06/02/2001

Improve the performance of your Java code

Many algorithms are expressed most concisely as tail-recursive methods. Compilers can automatically transform such methods into loops and thereby improve program performance, but this transformation is not required by the Java language specification, so not all JVMs will perform it. This means that tail-recursive methods in the Java language can result in unexpectedly large memory usage. This article demonstrates that dynamic compilation maintains the language''s semantics while static compilation often doesn''t. Learn why this matters and get a bit of code to help you determine whether your just-in-time (JIT) compiler can transform tail recursion on code while preserving semantics.
Similar Scripts for "Improve the performance of your Java code"

City Simulator

City Simulator is a scalable, three-dimensional model city that enables creation of dynamic spatial data simulating the motion of up to 1 million people. City Simulator is written in Java and is designed to generate realistic data for evaluation of d...

tButton

tButton is simple 3D button navigation mane Java applet with mouseover visual effects. Souce code available.

JVMine

JVMine is a Java version of WinMine game. It features three different game levels: debutant, moyen, and expert. With all java source code

Java TreeView tListe

tListe is a nice and fast TreeView Java Applet. The applet''s size is very small (between 12 and 25 Ko). tListe runs on all browsers with JDK 1.02 support. It features multi-font support, text alerts, unlimited images, status bar message, and mu...

Browser Properties

More information about the web browser than you knew existed. Find out the code name, color depth, platform, if java is enabled, resolution, ip address, hostname, and more.
©2003-2008 jCay.com