Re: P35 Prime Factors

The purpose of the list is to increase the speed of the algorithm by skipping some numbers. This is possible because of the math of Differences between consecutive primes but i am currently verifying the algorithm if it works, since the list might be wrong. 2017-02-25 7:44 GMT+01:00 Lindsay John

Re: P35 Prime Factors

Hi Lindsay, Joh-Tob, On Sat, Feb 25, 2017 at 09:36:04AM +0100, Joh-Tob Schäg wrote: > The purpose of the list is to increase the speed of the algorithm by > skipping some numbers. This is possible because of the math of Differences Correct. > between consecutive primes but i am currently

Re: P35 Prime Factors

I verified that it works for all numbers lower than 1000. My code: (let N 2 (while (> 1000 N ) (ifn (= N (apply '* (prime-factors N))) (print N)) (inc 'N))) 2017-02-25 9:58 GMT+01:00 Alexander Burger : > Hi Lindsay, Joh-Tob, > > On Sat, Feb

later and output

I tried to parallelize the following code: '(let N 2 (while (> 1000 N ) (check N) (inc 'N))) where (check N) is defined as '(ifn (= N (apply '* (prime-factors N))) (print N)) 'later has the following form '(later place_where_to_save_the_return_result . program to execute)

Re: Future of PicoLisp?

Thanks Lindsay, Mansur, good hints. I take a look at alternate ways, hopefully without Python, to Let's Encrypt. ♪♫ Alex -- UNSUBSCRIBE: mailto:picolisp@software-lab.de?subject=Unsubscribe

Re: BBWT

Hi Lindsay, > Bijective Burrows Wheeler Transform > https://github.com/thinknlive/picolisp-bbwt Cool! This code looks very good! :) > As I was working on this I realized I need to start thinking about how to > organize my code... > > The two main functions, encodeBBWT and decodeBBWT feel

Re: exercism.io

Hi Mike, > I've implemented tasks from A to F: > https://bitbucket.org/mihailp/tankfeeder/src/9de46f9e807786fdbf4a86604aca20dd25f0c19e/exercism-io/?at=default Great! Thanks for sharing! ♪♫ Alex -- UNSUBSCRIBE: mailto:picolisp@software-lab.de?subject=Unsubscribe

Re: Destructive element modification?

On Sat, Feb 25, 2017 at 09:13:46AM +0200, Mike Pechkin wrote: > ast start point: > http://ideone.com/zPndpA > > On Sat, Feb 25, 2017 at 9:01 AM, Christopher Howard < > christopher.how...@qlfiles.net> wrote: > > > Hi list. How do I *destructively* modify the value of one element in a > > list?

Workers for multicore processing (Question and RFC)

There are limits on how many processes can exist at the same time and having more 'later processes than cores is wasteful and Linux only allows for 1024 file descriptors per process. ? (for N 1 (later (cons) (* N N))) !? (pipe (pr (prog (* N N Pipe error: Too many open files ? N -> 339 Is

Re: later and output

On Sat, Feb 25, 2017 at 11:24:15AM +0100, Joh-Tob Schäg wrote: > I tried to parallelize the following code: > '(let N 2 >(while (> 1000 N ) > (check N) > (inc 'N))) > where (check N) is defined as '(ifn (= N (apply '* (prime-factors N))) > (print N)) OK, good! > 'later has

Re: Workers for multicore processing (Question and RFC)

> > > > > Is there some "worker" implementation which keeps a queue of task to do > and creates N worker processes which take tasks from the queue when they > are finished? > > ​you have to implement everything by yourself. as start point:

Re: Vip and different file types

Hi Alex, Thanks for the suggestions! I'll continue to play with it - Erik

Re: P35 Prime Factors

Hi Alex, Joh-Tob, Thank you. With the Knuth reference the code makes a lot more sense! I had implemented a more basic version. For large ranges, the performance difference of the Alex's iterative version that utilizes the sequence is much better! It is a very nice use of circular lists. :

Re: BBWT

Thanks Alex, The feedback is appreciated. This is a good clarification of how namespaces work in the 64bit version. Also, somehow, it had not 'clicked' with me that transient symbols could be used in this regard. Re-read that section of the documentation again... =) "With that mechanism,

Re: later and output

My earlier function 'primeFactorz' had a bug! returning the wrong results for actual prime numbers :( : (primeFactorz 17) -> (3 5) # WRONG! I have to be more careful with integer arithmetic. The corrected function is: (de primeFactorz (N) (use Result (recur (N) (let (Root

Re: later and output

I am glad i could be of some help. To be honest Linsday you do a good job for the community and a better job than i do to be honest. Maybe somebody can spend some time and spin this in to a draft for the future less terse picolisp documentation. I am currently busy with learning for pre-exames.

Re: exercism.io

Thanks for sharing. Can you link the list of tasks or is it behind a login wall? 2017-02-25 9:42 GMT+01:00 Alexander Burger : > Hi Mike, > > > I've implemented tasks from A to F: > > https://bitbucket.org/mihailp/tankfeeder/src/ >

Lifespan of memory of parameters

Hi list, could someone educate me a little regarding the following (or point me to the right documentation): Say I have function (foo (Lst) (bar (copy Lst)) ) My question is: At the point when bar is called, is Lst now gone (i.e., marked for garbage collection) or does that wait until bar

Re: exercism.io

https://github.com/exercism/x-common/tree/master/exercises On Sun, Feb 26, 2017 at 1:20 AM, Joh-Tob Schäg wrote: > Thanks for sharing. > Can you link the list of tasks or is it behind a login wall? > > 2017-02-25 9:42 GMT+01:00 Alexander Burger : > >>

Re: Lifespan of memory of parameters

Hi Christopher, > Hi list, could someone educate me a little regarding the following (or > point me to the right documentation): > > Say I have function > > (foo (Lst) >(bar (copy Lst)) ) > > My question is: At the point when bar is called, is Lst now gone (i.e., > marked for garbage

Re: exercism.io

There is some very nice code in here. For me, the 'allbase' function is a particularly nice gem. /Lindsay On Fri, Feb 24, 2017 at 8:44 PM, Mike Pechkin wrote: > hi all, > > I've implemented tasks from A to F: > https://bitbucket.org/mihailp/tankfeeder/src/ >