Comparing performance of JDK List Implementations

[Henri Tremblay]

Ok. What I meant by that is that returning a value from the benchmarked
method does the same as putting it into a blackhole. So get could be

  public String get() {
    return list.get(list.size() / 2);
  }


On 22 October 2016 at 12:06, Bruce Eckel <bruceteckel at gmail.com> wrote:

> I thought I was following the pattern I found on
> http://hg.openjdk.java.net/code-tools/jmh/file/d0821c7627fb/
> jmh-samples/src/main/java/org/openjdk/jmh/samples/JMHSample_
> 26_BatchSize.java
> with "measureRight()"
>
>
> -- Bruce Eckel
> www.MindviewInc.com <http://www.mindviewinc.com/>
> Blog: BruceEckel.github.io
> www.WinterTechForum.com
> www.AtomicScala.com
> www.Reinventing-Business.com
> http://www.TrustOrganizations.com <http://www.ScalaSummit.com>
>
>
> On Sat, Oct 22, 2016 at 8:40 AM, Henri Tremblay <henri.tremblay at gmail.com>
> wrote:
>
>> Hi,
>>
>> Quick question: Why are you using a BlackHole for get and returning a
>> value for all the others?
>>
>>
>> On 21 October 2016 at 17:16, Bruce Eckel <bruceteckel at gmail.com> wrote:
>>
>>> Attached is my current version which compares List implementations. I
>>> plan
>>> to do this for the other basic collection types (Set, Map, Queue,
>>> Dequeue),
>>> but would like some feedback on this one. Thanks.
>>>
>>>
>>>
>>> -- Bruce Eckel
>>> www.MindviewInc.com <http://www.mindviewinc.com/>
>>> Blog: BruceEckel.github.io
>>> www.WinterTechForum.com
>>> www.AtomicScala.com
>>> www.Reinventing-Business.com
>>> http://www.TrustOrganizations.com <http://www.ScalaSummit.com>
>>>
>>
>>
>