comp.lang.java.programmer Google Group

Re: The future of Java

redgrittybr...@spamweary.invalid (RedGrittyBrick) — Wed, 25 Nov 2009 10:04:57 UT

Yes it does, AIUI a company that wholly acquires another as a going
concern also acquires all of it's legal obligations, including those
prescribed in licence terms. If MySQL gave you a licence to use MySQl,
that licence is still valid after MySQL are taken over by Sun or Oracle.
Not retroactively. As copyright owners they can cease making available

Re: Windows 7 and all my Java stuff.

duncan.idaho2...@googlemail.com (DuncanIdaho) — Wed, 25 Nov 2009 09:28:40 UT

snip
OK, the responses to my original post have really got my head buzzing
with all this low level stuff now, it's been years and I forgot how
obssessive I can get about these nitty gritty little bits and pieces
however the bottom line for me, in a practical sense is (Ignoring
execution issues for the time being) ...

ღ۞ღ۞ 2009 Chanel handbag and wallet cheap wholesale at www.fjrjtrade.com

fjrjtra...@sina.com (www.fjrjtrade.com) — Wed, 25 Nov 2009 08:50:52 UT

ღ۞ღ۞ 2009 Chanel handbag and wallet cheap wholesale at [link]
<Paypal Payment>
Welcome to visit [link]
Cheap wholesale handbag [link]
Cheap wholesale handbag
[link]
Cheap wholesale purse
[link]

Re: converting from one charset encoding to another ...

lbrt...@gmail.com (Albretch Mueller) — Wed, 25 Nov 2009 08:18:17 UT

OK, you have made me wonder about what to do when you don't know the
encoding of a file you got. As long as I know this is not taken care
by Readers even though some heuristics may be used
So, what do you do in those situations?
Thank you
lbrtchx

Re: Thread in a hashtable

mcmurt...@pixelmemory.us (Kevin McMurtrie) — Wed, 25 Nov 2009 06:23:49 UT

In article <RUKOm.50406$KP1.36...@newsfe1 6.ams2>,
. . .
Guesses:
- Improve multithreading adoption at a time when most coders were afraid
of it or considered it voodoo
- Most of the JFCs were Java example code too
- There would have been Applet security holes if synchronization didn't
prevent unpredictable updates to the basic data types like HashMap,

Re: book request

see_webs...@mindprod.com.invalid (Roedy Green) — Wed, 25 Nov 2009 06:08:23 UT

On Mon, 23 Nov 2009 23:45:27 -0800 (PST), Ztx4 <oladham...@gmail.com>
wrote, quoted or indirectly quoted someone who said :
It will be easier to find with this info:
978-0136012672 ISBN
Daniel Liang
See [link]

Re: book request

mscottschill...@hotmail.com (Mike Schilling) — Wed, 25 Nov 2009 05:12:01 UT

It's consdierably less expensive at
[link]

Re: Hash table performance

nos...@nospam.invalid (John B. Matthews) — Wed, 25 Nov 2009 04:35:41 UT

In article <hei5nr$5n...@news.eternal-sep tember.org>,
Ah, perhaps a cache of expensive function results.
I see what you mean: floats and doubles are just rational approximations
of reals, so they always end in zero or repeat.

The method hash() is adapted to the power-of-two array size:
<[link]>

Re: Hash table performance

newsgroup.spamfil...@virtualinfinity.net (Daniel Pitts) — Wed, 25 Nov 2009 04:25:48 UT

I did a quick microbench to test division versus shifting. I was
surprised by the result, I expected them to be "close enough", but it
looks like, on my machine at least, there is an order of magnitude
difference:
<results>
Nothing: count = 874270000
Shift: count = 869828000
Divide: count = 91958000

Re: Hash table performance

nos...@nowhere.com (markspace) — Wed, 25 Nov 2009 02:45:12 UT

I dunno. I have a feeling that while the example is contrived, it isn't
unreasonable. Doubles and their bit pattern don't seem to be as random
as people expect.
Look at Tom's attempt to introduce some randomness by dividing by ten.
I don't think those he produced bit patterns are random at all. I see a

Re: Hash table performance

nos...@nospam.invalid (John B. Matthews) — Wed, 25 Nov 2009 02:30:45 UT

In article <hehvr3$qs...@news.eternal-sep tember.org>,
Is this just the contrived nature of the example? If the keys were
really positive integers less than 10 million, then HashMap<Integer,
Double> would solve the problem. If the domain were some other subset of
the reals for which Double's hashCode() proved inadequate, one might

Re: The future of Java

see_webs...@mindprod.com.invalid (Roedy Green) — Wed, 25 Nov 2009 01:42:57 UT

On Sun, 22 Nov 2009 21:56:54 -0500, Arne Vajhøj <a...@vajhoej.dk>
wrote, quoted or indirectly quoted someone who said :
I have seen vendors wriggle out of these sorts of promise by creating
a new product and just letting the old one languish. The wording of
the GPL licence may make that difficult for Sun and Oracle. Does the

Re: The future of Java

see_webs...@mindprod.com.invalid (Roedy Green) — Wed, 25 Nov 2009 01:23:00 UT

On Sun, 22 Nov 2009 22:05:05 -0500, Arne Vajhøj <a...@vajhoej.dk>
wrote, quoted or indirectly quoted someone who said :
Under heavy loads a system can have can a variety of behaviours:
in increasing desirability
1. the system crashes outright.
2. the throughput drops precipitously. (e.g. virtual ram thrashing).

Re: Hash table performance

nos...@nowhere.com (markspace) — Wed, 25 Nov 2009 01:04:32 UT

I wasn't using bit masking and powers of two, I was using double the
previous table size then add 1, and integer modulo to limit the hash
index to the table size. I even started with a hash table size of 101.
I was using closed hashing however, which did not help.
I was *still* getting a huge clump of collisions right in the middle of

Re: Hash table performance

t...@urchin.earth.li (Tom Anderson) — Tue, 24 Nov 2009 23:58:33 UT

Ahaaa, yes, of course. Those bits in full:
0.0 000000000000000000000000000000 000000000000000000000000000000 0000
1.0 001111111111000000000000000000 000000000000000000000000000000 0000
2.0 010000000000000000000000000000 000000000000000000000000000000 0000
3.0 010000000000100000000000000000 000000000000000000000000000000 0000