Path: csiph.com!x330-a1.tempe.blueboxinc.net!usenet.pasdenom.info!news.albasani.net!.POSTED!not-for-mail
From: Jan Burse <janburse@fastmail.fm>
Newsgroups: comp.lang.java.programmer
Subject: Re: Bulk Array Element Allocation, is it faster?
Date: Sun, 25 Sep 2011 19:21:42 +0200
Organization: albasani.net
Lines: 23
Message-ID: <j5nnv6$t23$1@news.albasani.net>
References: <j5lvf0$bhl$1@news.albasani.net> <ke2t77p38ktjf6bi8fvng7mo0a2a0cad8e@4ax.com> <j5mpq6$lra$1@news.albasani.net> <j5n5jo$r2r$1@dont-email.me>
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
X-Trace: news.albasani.net Q3rfHhT7niCk14jH+Rj3SojL8GPvvhLDu7BUxer1i+UX/NBt5WS3X3N044vk/Byi0QCXe0QF/Y8QPnZE9/h8E7t7vrEpdNfYmyStwSDQmaFYiVogzsYRrO5mH1Ka0S/B
NNTP-Posting-Date: Sun, 25 Sep 2011 17:21:42 +0000 (UTC)
Injection-Info: news.albasani.net; logging-data="6hV6VriFo/VduinAnJMQMNdF3OSKl0qgc2coulLFZxY0VIkctt2cm7XtUh3ikYqVOzHpPHV2wGbe97BNB/KlWoWDWXPOq19m2YQl5RFwv2ov04EYA+dr4Zg/Lg8wAluQ"; mail-complaints-to="abuse@albasani.net"
User-Agent: Mozilla/5.0 (Windows NT 6.1; WOW64; rv:6.0.2) Gecko/20110902 Firefox/6.0.2 SeaMonkey/2.3.3
In-Reply-To: <j5n5jo$r2r$1@dont-email.me>
Cancel-Lock: sha1:ZJszF4lKFKxuVoE2lTPg5CsEdH8=
Xref: x330-a1.tempe.blueboxinc.net comp.lang.java.programmer:8299

Eric Sosman schrieb:
>      Note that the semantics of the bulk and lazy allocations
> in your original example are quite different.  An "optimization"
> that changes the meaning of the code is only a benefit if the
> code was wrong to begin with. ;-)

What I do in the code has nothing to do with my question. My
question circles only around the following code fragment:

     Bla[] bla = new Bla[n];
     for (int i=0; i<n; i++) {
         bla[i] = new Bla();
     }

And what the JIT does. And not what I am doing in a comparison
with lazy. That is why I started my post with:

"I just wonder wether modern JIT do optimize
Code of the following form:"

Please focus on that.

Bye