Ouch, I correct the previous statement.
> 2019/10/05 10:44、KUSUMOTO Norio のメール:
>
> Leave the code using while instead of nfind until the corresponding
> code is included in the release build.
*I* leave the code using while instead of nfind until the corresponding
code is included in the rele
Thank you for your quick response, John.
Leave the code using while instead of nfind until the corresponding
code is included in the release build.
--
KUSUMOTO Norio
> 2019/10/05 10:20、John Benediktsson のメール:
>
> This works in the non-optimizing compiler (for example, the Listener):
>
> 3 [
This works in the non-optimizing compiler (for example, the Listener):
3 [ f ] times
But not in the optimizing compiler. I pushed a quick fix that makes your
word work:
https://github.com/factor/factor/commit/e17b9119293783728e193b29856d81ba5862c8eb
On Fri, Oct 4, 2019 at 5:29 PM KUSUMOTO No
I would like to use nfind as an escapable 2each, but I'm in trouble.
I simplified the problem as follows:
In scratchpad, when I input:
USE: sequences.generalizations
{ 1 2 3 4 5 } { 5 4 3 2 1 } [ > ] 2 nfind
get:
--- Data stack:
3
4
2
And I define nfind-test and use it:
: nfind-test ( x y --
> 2019/10/02 23:07、Alexander Ilin のメール:
>
> I like the LGBT reference, well done! : )
Oh, that's true. :-)
--
KUSUMOTO Norio
___
Factor-talk mailing list
Factor-talk@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/factor-talk
> 2019/10/02 22:23、John Benediktsson のメール:
>
> Any desire to make it available for others to use?
Yes, of course!
--
KUSUMOTO Norio
___
Factor-talk mailing list
Factor-talk@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/factor
I like the LGBT reference, well done! : )
02.10.2019, 16:14, "KUSUMOTO Norio" :
> 2019/09/23 18:03、Alexander Ilin のメール:
>> Have you used the `backtrack` vocab for this?
>> https://re-factor.blogspot.com/2015/06/send-more-money.html
>
> I ported a Prolog program to solve the same puzzle.
>
> USI
Logica seems pretty cool!
Any desire to make it available for others to use?
Best,
John.
> On Oct 2, 2019, at 9:15 AM, KUSUMOTO Norio wrote:
>
> 2019/09/23 18:03、Alexander Ilin のメール:
>>
>>
>> Have you used the `backtrack` vocab for this?
>> https://re-factor.blogspot.com/2015/06/send-more-
2019/09/23 18:03、Alexander Ilin のメール:
>
>
> Have you used the `backtrack` vocab for this?
> https://re-factor.blogspot.com/2015/06/send-more-money.html
I ported a Prolog program to solve the same puzzle.
USING: logica lists assocs sequences kernel math
locals formatting io ;
IN: logica.test.
> 2019/09/23 18:03、Alexander Ilin のメール:
>
> Have you used the `backtrack` vocab for this?
> https://re-factor.blogspot.com/2015/06/send-more-money.html
No, I didn't. I didn't know it.
This my liblary is a port from tiny_prolog and its descendants, ruby-prolog.
https://github.com/preston/ruby-pro
Have you used the `backtrack` vocab for this?
https://re-factor.blogspot.com/2015/06/send-more-money.html
23.09.2019, 10:43, "KUSUMOTO Norio" :
>> 2019/09/22 20:21、Alexander Ilin のメール:
>>
>> I use `loop` or `while`, depending on the details.
>
> Hello. Thank you for your answer.
>
> I rewrote my
Wow, this looks very cool!
: ))
23.09.2019, 10:43, "KUSUMOTO Norio" :
>> 2019/09/22 20:21、Alexander Ilin のメール:
>>
>> I use `loop` or `while`, depending on the details.
>
> Hello. Thank you for your answer.
>
> I rewrote my program using `loop 'and `while'. The library I'm currently
> building is
> 2019/09/22 20:21、Alexander Ilin のメール:
>
> I use `loop` or `while`, depending on the details.
Hello. Thank you for your answer.
I rewrote my program using `loop 'and `while'. The library I'm currently
building is an extended port from Ruby's one, and I used `with-return`
to mimic the code.
Honestly, I remember asking the same question a long time ago. Haha.
On Sun, Sep 22, 2019 at 8:17 PM KUSUMOTO Norio
wrote:
> > 2019/09/22 22:41、Doug Coleman のメール:
> >
> > You can use 'find' itself as an 'each'. Do whatever you each would do
> before checking the stop condition and return true wh
> 2019/09/22 22:41、Doug Coleman のメール:
>
> You can use 'find' itself as an 'each'. Do whatever you each would do before
> checking the stop condition and return true when your stop condition is met.
> Then drop what you found if you don't need it.
That's true! I was bound by the impression I go
You can use 'find' itself as an 'each'. Do whatever you each would do
before checking the stop condition and return true when your stop condition
is met. Then drop what you found if you don't need it.
On Sun, Sep 22, 2019, 6:21 AM Alexander Ilin wrote:
> I use `loop` or `while`, depending on the
I use `loop` or `while`, depending on the details.
22.09.2019, 13:05, "KUSUMOTO Norio" :
> Hello all,
>
> 'each 'and' 2each 'are very useful for writing iterative processes, but
> sometimes
> I want to get out of a process before repeating it to the end under certain
> conditions.
>
> I think it
Hello all,
'each 'and' 2each 'are very useful for writing iterative processes, but
sometimes
I want to get out of a process before repeating it to the end under certain
conditions.
I think it would be possible to write such a combinator because 'find' stops
iterating
when it finds something
18 matches
Mail list logo