I use a script/verb to set random seed, it gets 4 bytes from /dev/random using -
host 'dd if=/dev/random bs=4 count=1'
where
host=: [: 2!:0 '(' , ' || true)' ,~ ]
> On 2017Apr 17, at 23:01, Xiao-Yong Jin wrote:
>
> That much I figured. It also doesn't work with fifo (limit error).
That much I figured. It also doesn't work with fifo (limit error).
I hoped this was some kind of bug you guys could fix,
since c standard lib functions wouldn't care.
> On Apr 18, 2017, at 12:33 AM, bill lam wrote:
>
> 1!:x cannot read non regular files.try
> 2!:0'cat /dev/...'
>
>
>
> On 18
You may find the following thread from the forum of interest:
http://www.jsoftware.com/pipermail/programming/2013-March/031870.html
On Tue, Apr 18, 2017 at 5:33 PM, bill lam wrote:
> 1!:x cannot read non regular files.try
> 2!:0'cat /dev/...'
>
>
>
> On 18 Apr, 2017 1:13 pm, "Xiao-Yong Jin" wr
1!:x cannot read non regular files.try
2!:0'cat /dev/...'
On 18 Apr, 2017 1:13 pm, "Xiao-Yong Jin" wrote:
Hi,
I was trying to get some random bits but found out that 1!:11 doesn't work
with /dev/urandom.
_3(3!:4)1!:11'/dev/urandom';0 8
|index error
| _3(3!:4)1!:11'/dev/urandom';0 8
Hi,
I was trying to get some random bits but found out that 1!:11 doesn't work with
/dev/urandom.
_3(3!:4)1!:11'/dev/urandom';0 8
I think julia just calls blas.
Пн, 17 апр 2017, Xiao-Yong Jin написал(а):
>
> > On Apr 17, 2017, at 9:26 PM, Henry Rich wrote:
> >
> > If you have an implementation of +/ . * on double-precision floats that's
> > faster than J 8.06, I would be obliged if you'd send me a copy of the
> > source
> On Apr 17, 2017, at 9:26 PM, Henry Rich wrote:
>
> If you have an implementation of +/ . * on double-precision floats that's
> faster than J 8.06, I would be obliged if you'd send me a copy of the source
> code.
I'm sure your code is much faster than naive c loops. But some how the
matrix
If your arrays are large (say, 1 long) I would expect J to be better
than half the speed of C. Can you share your application?
If you have an implementation of +/ . * on double-precision floats
that's faster than J 8.06, I would be obliged if you'd send me a copy of
the source code.
Hen
there is a script that translates mnemonic to primitive when loading
scripts without execution overhead. Special codes will still work.
http://code.jsoftware.com/wiki/Guides/Primitives
On 18 Apr, 2017 5:23 am, "Michael Goodrich"
wrote:
> Thanks Bob that was very helpful as I was guilty of the
As humans we share that flaw/strength. :-)
It allows us to chunk information into understandable bites which we name, but
f. helps out.
cheers, bob
> On Apr 17, 2017, at 2:22 PM, Michael Goodrich
> wrote:
>
> Thanks Bob that was very helpful as I was guilty of the mnemonic sin!
>
>
>
> Se
Thanks Bob that was very helpful as I was guilty of the mnemonic sin!
Sent from my iPhone
> On Apr 17, 2017, at 5:20 PM, 'Pascal Jasmin' via Programming
> wrote:
>
> You can copy beta to a new directory and run each independently.
>
>
>
>
>
>
> From: Mic
You can copy beta to a new directory and run each independently.
From: Michael Goodrich
To: programm...@jsoftware.com
Sent: Monday, April 17, 2017 5:14 PM
Subject: Re: [Jprogramming] J weirdness #2 - A nasty surprise
This is getting interesting; I was alre
This is getting interesting; I was already impressed with Js speed being only
twice as slow as the C version, and faster than the R version of the same code.
Looking forward to that 806 beta 3!
Btw I should uninstall the latest (stable) and start afresh?
Sent from my iPhone
> On Apr 17, 2017,
Greetings back atcha Michael,
I am guessing that by using
ssq=. +/ @: *:
it would be even quicker. :-)
You may want to look into the f. adverb (Fix).
http://www.jsoftware.com/help/dictionary/dfdot.htm
Henry Riches has a good section in "J for C Programmers" on f. and may further
help you un
I think you were surprised by
http://www.jsoftware.com/help/dictionary/special.htm
Specifically the special handling for +/ .* (which is handled at
parsing time rather than at execution time - the way you have things
arranged, the parser will not see +/ .* and hypothetically you could
arrange for
Greetings:
Got a nasty surprise today. have a non-trivial J app with the following
supporting original definitions:
sum =. +/
dot =. +/ . *
sqrd =. *:
ssq =. +/ @: sqrd
Which I changed (thinking I was being elegant) to
sum =. +/
dot =. sum . *
sqrd =. *:
ssq =. sum @: sqrd
After this change
Here are my results with beta-3:
2017 4 16 4 41
Intel(R) Core(TM) i7-6500U CPU @ 2.50GHz
j805/j64/windows/beta-12/commercial/www.jsoftware.com/2016-09-30T15:50:47
j806/j64avx/windows/beta-3/commercial/www.jsoftware.com/2017-04-10T18:03:23
intsr (small range) special code avoids hash - intbr (big
As you first begin you want to create atoms,lists and tables as you need and
use them. As you get more experience you will have more tables and higher
dimension arrays.
As you do so, you will often have to "manipuladte" lower dimension date to a
shape that will allow you to use verbs with it
18 matches
Mail list logo
