Java decompilers
compared - JavaWorld - July
1997
Java decompilers
compared - JavaWorld - July
1997 |
The battle of the container
frameworks: which should you use? - JavaWorld - January
1999
The battle of the container
frameworks: which should you use? - JavaWorld - January
1999 |
Programming Java threads in the
real world, Part
3 - JavaWorld -
November 1998
Programming Java threads in the
real world, Part
3 - JavaWorld -
November 1998 |
Make a sweep with
clean beans -
JavaWorld
November 1999
Make a sweep with
clean beans -
JavaWorld
November 1999 |
C#: A language alternative or just J--?, Part 2 - JavaWorld December 2000
C#: A language alternative or just J--?, Part 2 - JavaWorld December 2000 |
Reflection
vs. code generation
Reflection
vs. code generation |
Diagnose common runtime problems with
hprof
Diagnose common runtime problems with
hprof |
Sync up Palm OS with J2ME
Sync up Palm OS with J2ME |
Score big with
JSR 77, the J2EE Management Specification
Score big with
JSR 77, the J2EE Management Specification |
Java Tip 130: Do you
know your data
size?
Java Tip 130: Do you
know your data
size? |
Check out three
collections libraries
Check out three
collections libraries |
Sort it
out
Sort it
out |
Axis-orizing objects for SOAP
Axis-orizing objects for SOAP |
Datastructures and algorithms, Part 1
Datastructures and algorithms, Part 1 |
Navigate through
virtual worlds using Java 3D
Navigate through
virtual worlds using Java 3D |
Practical Reflection: an excerpt from Hardcore Java
Practical Reflection: an excerpt from Hardcore Java
In this chapter from Hardcore Java, "Practical Reflection," Robert Simmons Jr. writes: "Reflection is one of the least understood aspects of Java, but also one of the most powerful. Reflection is used i |
JAligner
JAligner
JAligner is an open source Java implementation of the Smith-Waterman algorithm with Gotoh's improvement for biological local pairwise sequence alignment using the affine gap penalty model. |
Minding the Queue: Java 1.5 Adds a New Data Structure Interface
One of the fundamental data structures in computer science is the queue. You will recall that a queue is a data structure in which elements are removed in the same order in which they were added. This FIFO (first in, first out) data structure was unfortun |
HeapAnalyzer
What is HeapAnalyzer?
HeapAnalyzer allows the finding of a possible JavaTM heap leak area through its heuristic search engine and analysis of the Java heap dump in Java applications.
Java heap areas define objects, arrays, and classes.
|
Enhance looping in Java 5.0 with for/in
The for/in loop -- often called either enhanced for or foreach is largely a convenience feature in Java 5.0. It doesn\\'t really offer any new functionality, but certainly makes several routine coding tasks simpler. |
|
|