fannkuch-redux is all about "Indexed-access to tiny integer-sequence" so it really is all int[]
meteor-contest int[] byte[] OkPieces[] SPiece[] Piece[]
fasta byte[] double[] frequency[]
spectral-norm double[] Approximate[]
reverse-complement byte[] int[] ArrayList<byte[]> LinkedList<Integer>
mandelbrot byte[][] double[] Thread[]
and then the ones you didn't mention:
binary-trees custom binary trees
chameneos-redux ArrayBlockingQueue<Creature> Creature[] Thread[]
knucleotide byte[] int[] LinkedBlockingQueue<AbstractCounter> ArrayList<LinkedBlockingQueue<WorkChunk>> AbstractCounter[] ArrayList<CountString> StringBuilder TreeMap<Integer, Map<Byte, AbstractCounter>> HashSet<AbstractCounter> ByteBuffer ArrayBlockingQueue<Runnable>
pidigits long[] Semaphore[] exec[]
regexdna Thread[] StringBuffer HashMap<String, String>
thread-ring custom ring (also Node[] LinkedList<Node>)
That doesn't seem much more than a big fat assumption - aren't there also going to be many situations when the right thing to do is use an array?
What I'm doing is responding to your claim -- write everything directly on top of primitive arrays (as is done on the shootout).
>> When you need a hash table <<
Task description from the home page -- "Repeatedly update hashtables and k-nucleotide strings"
Sure, with a language that has super slow boxing semantics....
Just look at BinaryTree. The benchmark would show a very different picture if it would compare Tree<Integer> implementations instead of allowing a primitive int.
Please tell us specifically which Java programs in the benchmarks game, you say, are written directly on top of primitive arrays.