Thanks Alex,
I appreciate the suggestions. As ever, I learn something from them ;)
/Lindsay
On Fri, Mar 3, 2017 at 10:10 PM, Alexander Burger
wrote:
> Hi Lindsay,
>
> > The code below is the recursive Gosper implementation I came up with that
> > uses very little stack. This version just emits
Hi Lindsay,
> The code below is the recursive Gosper implementation I came up with that
> uses very little stack. This version just emits states.
> ...
> Picolisp continues to impress me with its expressiveness and power.
As ever, I can't resist to suggest some optimizations :)
> (de Plot (L)
>
Thanks Alex,
Your explanation was the motivation I needed to attempt the recursive
version...
/Lindsay
> Yes and no. It is correct that the garbage collector does not run at each
> release. Instead, it runs when a new cell is needed and the current heap is
> found to be full.
>
> So garbage colle
Hi Alex, Joh-Tob,
A 'co may be exactly what I am looking for in this case. Thanks!
Generating all the states at once was nice in one sense as I could
immediately scale the view when rendering the results.
Picolisp easily supported lists of ~2M elements on the 4GB, single-core
virtual box I am c
Makes sense probably.
The greatest compliment i received in months.
2017-03-03 20:04 GMT+01:00 Alexander Burger :
> On Fri, Mar 03, 2017 at 01:39:25PM +0100, Joh-Tob Schäg wrote:
> > I haven't figured out how to do it yet, but I think, in this case, a
> > 'recursive' solution that renders as poi
On Fri, Mar 03, 2017 at 01:39:25PM +0100, Joh-Tob Schäg wrote:
> I haven't figured out how to do it yet, but I think, in this case, a
> 'recursive' solution that renders as points are created would use a lot
> less resources, assuming that processed replacement rules are garbage
> collected as the
Hi Lindsay, Joh-Tob,
On Fri, Mar 03, 2017 at 12:47:12PM +0100, Joh-Tob Schäg wrote:
> > Is the garbage collection in picolisp immediate if the resource can be
> > released?
>
> No, picolisp uses a mark and sweep halt the world garage collector. During
> sweep phase the complete allocated RAM is c
Mhh it seems that my answer is not relevant to your question.
I haven't figured out how to do it yet, but I think, in this case, a
'recursive' solution that renders as points are created would use a lot
less resources, assuming that processed replacement rules are garbage
collected as the stack un
The initial iterative replacement solution I came up with (below) quickly
runs out of resources as it has to build the entire list before starting to
draw.
What error did you get?
How much resources does picolisp use?
Do you call ulimit before?
I think you may have some fundamental problems
Is the garbage collection in picolisp immediate if the resource can be
released?
No, picolisp uses a mark and sweep halt the world garage collector. During
sweep phase the complete allocated RAM is checked. If that would happen
after each release of a resource picolisp would be very slow.
Furtherm
Is the garbage collection in picolisp immediate if the resource can be
released?
The initial iterative replacement solution I came up with (below) quickly
runs out of resources as it has to build the entire list before starting to
draw.
I haven't figured out how to do it yet, but I think, in this
11 matches
Mail list logo