On Wed, Apr 8, 2015 at 4:48 AM, Rolf Huehne wrote:
> Q: Does 'i' contain the hash key (as in Perl) or the value?
>
>
the key
--
BPM Camp - Free Virtual Workshop May 6th at 10am PDT/1PM EDT
Develop your own process in ac
On 04/05/2015 05:58 AM, Robert Hanson wrote:
> Rolf, I think you could have a lot of fun with the "JavaScript" functions
> Jmol provides. Jmol never does loops like that. Instead it initializes a
> "three-dimensional binary tree" -- we call it a "binary forest" :) -- and
> you specify a point and
Rolf, I think you could have a lot of fun with the "JavaScript" functions
Jmol provides. Jmol never does loops like that. Instead it initializes a
"three-dimensional binary tree" -- we call it a "binary forest" :) -- and
you specify a point and a radius, then iterate until done. It is far far
fas
Am 03.04.15 um 03:55 schrieb Robert Hanson:
> Rolf, you are definitely pushing the limit there, I think. What exactly
> happens inside the loop you are really interested in using? If it is
> anything much, then the looping itself is going to be insignificant
> compared to the other processing.
>
Bo
Hi Rolf
I was about to suggest what Bob is putting forward: if Javascript is faster,
you
might take part of the code out from JmolScript into JavaScript. I believe he
has demo'ed how.
Another idea: I found that in Javascript there is much improvement in loops
when they are decrementing instea
Rolf, you are definitely pushing the limit there, I think. What exactly
happens inside the loop you are really interested in using? If it is
anything much, then the looping itself is going to be insignificant
compared to the other processing.
I probably will regret suggesting this, but something t
Hi Bob and others,
do you think that there might be some potential for optimizing the loop
speed in Jmol scripts, maybe by reducing flexibility or disabling
interruptions?
For my current project my loops can easily get into the range of
millions and even billions of cycles.
I have done some l
