Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.lang.java.programmer > #28495

Re: Benchmarking hashcode algorithms

From Roedy Green <see_website@mindprod.com.invalid>
Newsgroups comp.lang.java.programmer
Subject Re: Benchmarking hashcode algorithms
Date 2014-05-16 16:28 -0700
Organization Canadian Mind Products
Message-ID <en7dn95vjbgpo16r7b985fio1h7m0s8jkd@4ax.com> (permalink)
References <klnnl9ls2ovfnt6slsp4hsh6tcig3j5ka9@4ax.com> <b71ol91g81ig0u3o2rkgete4ltj9m100r5@4ax.com> <bsprrfFddd2U1@mid.individual.net>

Show all headers | View raw


On Mon, 05 May 2014 11:17:05 -0500, Mike Amling <mamling@chaff.us>
wrote, quoted or indirectly quoted someone who said :

>
>Did you implement using all 16 bits of each char of the String or only 
>the low-order 8 bits?

I converted to a byte[] using UTF-8 encoding. So the answer is mu.
-- 
Roedy Green Canadian Mind Products http://mindprod.com
Young man, in mathematics you don’t understand things.
You just get used to them. 
~ John von Neumann (born: 1903-12-28 died: 1957-02-08 at age: 53)

Back to comp.lang.java.programmer | Previous | Next — Previous in thread | Find similar | Unroll thread


Thread

Benchmarking hashcode algorithms Roedy Green <see_website@mindprod.com.invalid> - 2014-04-26 09:49 -0700
  Re: Benchmarking hashcode algorithms Marcel Müller <news.5.maazl@spamgourmet.org> - 2014-04-26 18:54 +0200
  Re: Benchmarking hashcode algorithms Roedy Green <see_website@mindprod.com.invalid> - 2014-04-26 12:24 -0700
    Re: Benchmarking hashcode algorithms Mike Amling <mamling@chaff.us> - 2014-05-05 11:17 -0500
      Re: Benchmarking hashcode algorithms Roedy Green <see_website@mindprod.com.invalid> - 2014-05-16 16:27 -0700
        Re: Benchmarking hashcode algorithms Silvio <silvio@internet.com> - 2014-05-20 17:32 +0200
      Re: Benchmarking hashcode algorithms Roedy Green <see_website@mindprod.com.invalid> - 2014-05-16 16:28 -0700

csiph-web