On Thu, Feb 25, 2021 at 12:43 PM IF Karona wrote:
> Your solution is so elegant. Thank you!
>
> >> PS Do I have the salutation right? Is it 'Hello, IF' or 'Hello,
> Karona'? <<
>
> You may call me Karona. Thank you for asking. :)
>
> Karona
>
>
Cool, good to know and I'm glad you liked the
> On Feb 25, 2021, at 10:12 AM, Norman Gray wrote:
>
>
> I think this is called 'zip', or a convolution [1]. The variant you describe
> is (effectively) with circular lists, but seems to be the same principle.
>
> ...and I see that, with that name in hand, SRFI/1 does indeed have a zip
>
Your solution is so elegant. Thank you!
>> PS Do I have the salutation right? Is it 'Hello, IF' or 'Hello,
Karona'? <<
You may call me Karona. Thank you for asking. :)
Karona
On Wed, Feb 24, 2021 at 11:14 PM David Storrs
wrote:
> Hi IF,
>
> I think this is what you want. You were right
Kevin, hello.
On 25 Feb 2021, at 17:07, Kevin Forchione wrote:
As you can see each element of the sublist corresponds to the list-ref
of the modulo n (length sublist) as n proceeds from 0 to some maximum
value. I’ve created a function that does exactly this, but …
I’ve no idea what this
Hi guys,
I’m trying to find out what this process may be called. Suppose you have lists
of various lengths:
‘(A B C D E F)
‘(1 2)
‘(3 4 5)
And you want tho produce the following:
'((A 1 3) (B 2 4) (C 1 5) (D 2 3) (E 1 4) (F 2 5) (A 1 3) (B 2 4) (C 1 5) (D 2
3) ...)
As you can see each
That's a cute idea. We do something like that already when sharing the
serialized continuation with the world, but Racket could conceivably do
that when it `read`/`write`s things, although it would be very odd.
--
Jay McCarthy
Associate Professor @ CS @ UMass Lowell
http://jeapostrophe.github.io
On 25. 02. 21 10:01, Jens Axel Søgaard wrote:
> Try integer-length.
>
> https://docs.racket-lang.org/reference/generic-numbers.html?q=integer-length#%28def._%28%28quote._~23~25kernel%29._integer-length%29%29
Oh, I completely missed this one. Thank you!!!
>
> I don't know how it is
===
7th ACM SIGPLAN International Workshop on
Functional Art, Music, Modelling and Design
(FARM)
Call for Papers, Demos, and Performance
Try integer-length.
https://docs.racket-lang.org/reference/generic-numbers.html?q=integer-length#%28def._%28%28quote._~23~25kernel%29._integer-length%29%29
I don't know how it is implemented.
/Jens Axel
Den tor. 25. feb. 2021 kl. 09.52 skrev Dominik Pantůček <
dominik.pantu...@trustica.cz>:
>
Hello Racketeers,
I'm slightly stuck with speeding up some calculations and the reason is
that I need to compute the index of highest set bit in a number. So for
1 it is 0, for 2 it is 1, for 8 3, 1023 9 and 1024 10 ...
The fastest Racket code I can come up with is as follows:
The test-suite semantics in rackunit are complex, under-specified, and
quite brittle. I recommend avoiding them entirely and sticking entirely to
test cases and test-begin.
On Monday, February 22, 2021 at 10:19:04 PM UTC-8 William J. Bowman wrote:
> Below is an example that behaves
Could you cryptographically sign the serialized form or something like that?
On Monday, February 22, 2021 at 8:59:29 AM UTC-8 jay.mc...@gmail.com wrote:
> On Sun, Feb 21, 2021 at 2:35 PM je...@lisp.sh wrote:
> >
> > #lang web-server is brilliant. This #lang is, in my view, a really
> excellent
12 matches
Mail list logo
