Path: csiph.com!x330-a1.tempe.blueboxinc.net!usenet.pasdenom.info!news.albasani.net!eternal-september.org!feeder.eternal-september.org!.POSTED!not-for-mail From: Gene Wirchenko Newsgroups: comp.lang.java.programmer Subject: Re: Passing a Method Name to a Method, Redux Date: Thu, 23 Jun 2011 19:42:18 -0700 Organization: A noiseless patient Spider Lines: 28 Message-ID: References: Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Injection-Info: mx04.eternal-september.org; posting-host="7Qrvczazr82YckO5XW8Vtw"; logging-data="22870"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18K+t/Zsp3QIWmPJOreC305AQ8rFvjyAB0=" X-Newsreader: Forte Agent 4.2/32.1118 Cancel-Lock: sha1:HAQQFBHIorISfbTo6U3i+YuXeTY= Xref: x330-a1.tempe.blueboxinc.net comp.lang.java.programmer:5623 On Thu, 23 Jun 2011 17:34:50 -0700, markspace <-@.> wrote: >On 6/23/2011 4:03 PM, Gene Wirchenko wrote: >> search. The times for sequential searching are only a bit worse than >> for binary searching. Treeset searching is about 20% faster. Any >> explanations? > > >Why does your TreeSetSearch() call SequentialSearch? Doesn't that I goofed. >defeat the purpose of your timing comparisons? I'm also not following >the parsing you are doing at all. What is the goal of that method? I am parsing for identifiers. In this test, I just throw them away. [snip] >Odd call indicated above. Doesn't that just do the exact same thing >that TreesetSearch does? Cut and paste did me in. Thank you for catching this. Sincerely, Gene Wirchenko