Ooops, thank you Mike. Another correction:
N ( [ (] ; bar2) bar1 )&>/@]^:([ > 0 #@{:: ] )^:_ X0 ; Y0
On Saturday, January 26, 2019, 11:25:10 a.m. EST, 'Mike Day' via
Programming wrote:
Pascal Jasmin’s power verb looks neat, but I don’t think one pass does quite
what Brian’s foo d
Pascal Jasmin’s power verb looks neat, but I don’t think one pass does quite
what Brian’s foo does:
one pass of foo modifies x with bar1 before changing y with bar2 using the new
x.
eg,
x1 =. x bar1 y
y =. x1 bar2 y
x =. x
I _think_ (bar1 ; bar2 ) &>/ x0;y0
returns
(x0 bar1 y0); x
correction to ^: conversion
N (bar1 ; bar2 )&>/@]^:([ > 0 #@{:: ] )^:_ X0 ; Y0
On Saturday, January 26, 2019, 8:42:14 a.m. EST, 'Pascal Jasmin' via
Programming wrote:
How many times do you guess the function is recursing
the power version (with X0 Y0 initial values for x and y)
10
Henry,
That was the trick and an easy while. loop conversion.
--
For information about J forums see http://www.jsoftware.com/forums.htm
Henry,
Thank you.
I was hoping that were possible.
I'll ponder it.
On Sat, Jan 26, 2019 at 10:33 AM Henry Rich wrote:
> It seems to me that you could use a loop, and not have recursion at all.
>
> Henry Rich
>
>
>
--
For inform
It seems to me that you could use a loop, and not have recursion at all.
Henry Rich
On 1/26/2019 10:13 AM, Brian Schott wrote:
Pascal,
Thank you.
I added a counter and when it failed the counter was 1998.
N is over 500,000.
x is the large growing noun.
I also assigned x to a global name then a
Pascal,
Thank you.
I added a counter and when it failed the counter was 1998.
N is over 500,000.
x is the large growing noun.
I also assigned x to a global name then and at failure #x was 2656.
It will take me a little while to translate my real verbs into bar1 and
bar2.
Are you optimistic about
How many times do you guess the function is recursing
the power version (with X0 Y0 initial values for x and y)
10 (bar1 ; bar2 )&>/^:([ > 0 #@{:: ] )^:_ X0 ; Y0
On Friday, January 25, 2019, 11:43:01 p.m. EST, Brian Schott
wrote:
I am getting a stack error from code foo like that at t
I am getting a stack error from code foo like that at the bottom of this
post. First of all can I assume the error is due to the recursion? J says
the stack error is occurring in the verb bar1 in my code.
If so, is it likely that I (or someone) can circumvent the stack error just
by rewriting the
