Hi all,
I have seen (and used) generic interfaces for structures in Racket. However,
they are limited to the same degree as message-passing OOP is limited: the
dispatch is based on one argument only.
I know there is Swindle (is it still active?) and I could find GLS in packages
for DrRacket. I
Hi John,
I am a PhD student doing a degree in chemical engineering. I am doing some
process modelling work using MIT-Scheme (scmutils to be precise) at the moment
but I would like to port it to Racket, which is feasible, but does require some
extra work:
- Racket already has great plotting lib
links I am checking MPFR-wrapper now.
Cheers,
Alexey
-Original Message-
From: Asumu Takikawa [mailto:as...@ccs.neu.edu]
Sent: Saturday, 24 October 2015 3:44 AM
To: Alexey Cherkaev
Cc: racket-users@googlegroups.com
Subject: Re: [racket-users] Sundials FFI wrapper
Hi Alexey,
On 2015-10-
Hi all,
I am interested in creating the Racket wrapping for the Sundials numeric
library (http://computation.llnl.gov/casc/sundials/main.html). Ivan Raikov
did a similar job for Chicken (http://wiki.call-cc.org/eggref/4/sundials).
Chicken has quite a different way of dealing with C code compare
: Robby Findler [mailto:ro...@eecs.northwestern.edu]
Sent: Friday, 16 October 2015 4:56 PM
To: Alexey Cherkaev
Cc: Racket Users
Subject: Re: [racket-users] Error requiring library from PlaneT : tcp-connect
forbidden client access
Are you seeing this error in the red line along the bottom of
Hi all,
I am trying to use the library "derive" from PlaneT. Using either new or old
syntax:
(require (planet wmfarr/deriv:3:0/deriv-lang))
OR
(require (planet "deriv-lang.ss" ("wmfarr" "deriv.plt" 3 0)))
Get an error:
tcp-connect: forbidden client access to planet.racket-lang.org:80
I have
uner wrote:
>
> > On 6/30/2015 5:34 PM, 'John Clements' via Racket Users wrote:
> >> > On Jun 30, 2015, at 8:10 AM, Alexey Cherkaev <
> alexey.cherk...@gmail.com> wrote:
> >> >
> >> > ... wouldn't it be beneficial to have such a ge
>
> On Jun 29, 2015, at 5:56 AM, Alexey Cherkaev
> wrote:
>
> > For example, I was thinking of defining syntax to access my
> implementation of multidimensional arrays
> > as
> >
> > (define-syntax aref
> > (syntax-rules (set!)
> >[(set! (aref ?
Hi all,
Common Lisp has a very useful idiom of SETF that can set values to arbitrary
places. For example, one can set (1 2)-th item of an array A as:
(SETF (AREF A 1 2) 20.0d0)
Scheme preferred way is to use `*-set!` procedures. However, sometimes it is
inconvenient. For example, if I want to
My lazy-sequence implementation was exactly following SICP: while
theoretically pure and good, might not be the best in practice, so I
believe your implementation can be much better.
Major performance boost in stateful implementation compared to
lazy-sequence with delay and force comes from removi
Hi, the full code is attached (I hope Google Groups will preserve it...).
Best regards,
Alexey
On 29 May 2015 at 11:51, Alexis King wrote:
> > Maybe this belongs a bit more to your previous thread, but it can also
> relate here:
> > I see you are making generic sequence interface to collection
It looks great! Thanks for putting time and effort into this.
I think Racket in general will benefit from better support of immutable
collections: it has already made the departure from Scheme by making cons-cells
immutable. So, this is next logical step.
Maybe this belongs a bit more to your p
Hi,
I am trying to create something similar to LaTeX's \newtheorem command. Very
simple implementation (still incomplete) for an "Exercise" block:
#lang racket
(require scribble/manual)
(provide exercise)
(define exercise-counter 0)
(define (exercise cont)
(set! exercise-counter (add1 exerc
(log N) access and update. Since
> N is limited by the address space so that log N is limited to less than 30
> or 62 (depending on the platform), log N can be treated reasonably as a
> constant."
>
> I don't think you can do better than O(n log n) if you want to produce
Hi all,
Is it possible to union/merge two immutable hash-maps in linear time? I could
implement it myself if I could have linear time constructor of hashmap from a
sorted list (and assuming converting hash-map->list is i) linear and ii)
produces sorted list).
Regards,
Alexey
--
You received
Hi,
I hope the author of the SICP package is on this email list. I have encountered
this problem doing affine transformation of the picture:
(paint ((transform-painter (make-vect 0 0) (make-vect 0.5 0.1) (make-vect 0
0.5)) einstein))
. .
../../../../../../Library/Racket/planet/300/6.1/cache/
extremely slow. A place-message send must copy the
>> vector to send it as a message, but the copy shouldn't take so long.
>> I'll investigate further.
>>
>> Meanwhile, an option in this case might be to created a "shared
>> flvector", which can be passed directl
Hi,
I am looking at parallelising some numerical computation with Racket. I’ve
tried future/touch first. However, the data for computation is passed as
vectors and in my experiments with future/touch it would always find
"synchronisation task” upon which all multicore-threads collapse into one
18 matches
Mail list logo
