Dear Racketeers,
I've recently been doing some work on Amazon Web Services and came
across Greg Hendershott's AWS package for Racket (thank you,
Greg!). This did nearly everything I'd wanted to do, modulo:
1. I didn't see an easy way to manually supply the
X-Amz-Security-Token when it's not
Hi Bob
My pleasure.
(in-value ...) is a very neat facility that I suspect could do with a
couple of examples in the Racket Guide and Reference to highlight its
utility and application.
Dan
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To
Classes are really nice and easy for tasks like this, it took me a little
bit to get used to the class syntax, but now I love them.
I found that it helps to look at real code that uses classes, because the
documentation quickly goes into quite advanced/special use cases.
You can use them to
Daniel,
Thank you.
The piece of the puzzle I was missing was in-value.
Your version is much easier to read than mine. It is also easy to
modify it to get a list of the primes that occur, which is nice.
Regards,
Bob
--
You received this message because you are subscribed to the Google Groups
Thank you sir, I plan on posting more original content when time allows.
Dex
> On Jul 9, 2019, at 4:56 PM, stewart mackenzie wrote:
>
> That's some cool bloggery going on there, thanks for sharing.
>
>> On Fri, 21 Jun 2019, 16:16 Dexter Lagan, wrote:
>> www.newlisper.com/blog
>>
That's some cool bloggery going on there, thanks for sharing.
On Fri, 21 Jun 2019, 16:16 Dexter Lagan, wrote:
> www.newlisper.com/blog
> www.eicm.net/blog
>
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe from this group and
朗 Wow! I get it, thanks.
在 2019年7月9日星期二 UTC+8下午10:04:59，Alex Knauth写道：
>
>
> On Jul 7, 2019, at 10:24 AM, 曹朝 > wrote:
>
> This is a simple algorithm for compute the shortest edit distance, it can
> work with `#lang racket/base`.
> But in Typed Racket, I just got the error message: "insufficient
It's funny how just knowing that there is an easy solution to a problem
makes the problem easier to solve. My first thought about returning objects
(prior to sending initial email) was that I would return all of the objects
unnamed but then I was confused about how to specify the parents of the
> On Jul 7, 2019, at 10:24 AM, 曹朝 wrote:
>
> This is a simple algorithm for compute the shortest edit distance, it can
> work with `#lang racket/base`.
> But in Typed Racket, I just got the error message: "insufficient type
> information to typecheck". I don't know why this code can't pass
Hi Bob
Here's how I'd write your function using for*/sum:
(define (count-primes-in-seq/2 f bound)
(for*/sum ([n (in-range bound)]
[k (in-value (f n))]
#:when (and (positive? k) (prime? k)))
1))
Performance is similar to your original.
Dan
--
You received this
Another way to promote Racket (and possibly Scheme?) is to publish in
http://joss.theoj.org/
On Monday, June 24, 2019 at 12:29:41 AM UTC+2, Eric Griffis wrote:
>
> This is the kind of stuff I look for in my Twitter feed. If I knew how
> to subscribe to updates, I would.
>
> Eric
>
>
> On Fri,
Dear all,
I recently wanted to count the number of primes in the sequences 2^n+3
and 2^n-3 (and a few more besides) where n is a positive integer.
After a while I realised that I had no real idea how to do this in racket /
scheme. I think part of my problem is that I really think of the problem
There are several ways to solve this (including deriving classes), but the
simplest for you right now is probably to have `initialize-progress-bar'
return the gui widgets (in particular `gauge' and `msg'), assign the values
to `the-gauge' and `the-msg' (say) from the return values of
Hi All,
I was playing around with creating a progress bar. The basic idea was
straightforward.
#lang racket/gui
(define frame (new frame%
[label "Progress Bar"]
[width 300]))
(define hpane (new horizontal-pane%
[parent frame]))
(define
14 matches
Mail list logo
