AHA! You got it!
It happens in the tabs which have 'No debugging...' checked, and
doesn't happen otherwise.
2013/1/30, Robby Findler :
> What is the "custom" part of the language settings you have on?
>
> Robby
>
>
> On Tue, Jan 29, 2013 at 7:47 PM, Pierpaolo Bernardi
> wrote:
>
>> Update 2: it
What is the "custom" part of the language settings you have on?
Robby
On Tue, Jan 29, 2013 at 7:47 PM, Pierpaolo Bernardi wrote:
> Update 2: it does not depend on buffer content.
>
> I have 9 tab open in this DrRacket. In 5 of them happen the strange
> message, in 4 of them it doesn't happen.
>
Update 2: it does not depend on buffer content.
I have 9 tab open in this DrRacket. In 5 of them happen the strange
message, in 4 of them it doesn't happen.
I tried closing one in which it happened and then reopening the same
file in a new tab, and in the new tab it doesn't happen.
2013/1/30, R
Update: it happens also for system supplied functions, for example
(car 3) displays the same behavior.
However, it happens always, when certain programs are in the editor,
and never with others.
I don't see a pattern. At this moment I cannot attach a file which
causes this (am typing in a phone..
I agree. Listing important videos on unlikely-to-go-away sites seems
important.
Robby
On Tue, Jan 29, 2013 at 4:44 PM, Matthias Felleisen wrote:
>
>
> 1. Pointing to the wiki from racket-lang.org is a good idea.
>
> 2. But I agree with the original proposal that we really may wish to list
> key
I don't see that with this program:
#lang racket
(define (integer->roman n)
(cond ((not (integer? n))
(raise-argument-error 'integer->roman "integer?" n))
((positive? n)
(apply string-append n))
((negative? n)
(apply string-append "NEGATIVVS " 1))
Yes, exactly. I meant that the strategy of just checking the
canonical element would have the problem I described -- having an
operation for that would fix it.
Sam
On Tue, Jan 29, 2013 at 7:57 PM, Robby Findler
wrote:
> I understood you to be asking for something like this:
>
> (check-equal?
I understood you to be asking for something like this:
(check-equal? (uf-same-set? (uf-new 1) (uf-new 2)) #f)
(check-equal? (uf-same-set? (uf-new 1) (uf-new 1)) #f)
(check-equal? (let ([a (uf-new 1)]
[b (uf-new 1)])
(uf-union! a b)
(u
Thanks. That's a bug.
uf-set-canonical! changes the canonical element of the set (without
affecting the identity of the set).
Robby
On Tue, Jan 29, 2013 at 4:13 PM, Danny Yoo wrote:
> On Tue, Jan 29, 2013 at 2:51 PM, Robby Findler
> wrote:
> > I've just pushed an implementation of the union-
But wouldn't that equate two un-unioned invocations of (uf-new 1)?
On Tue, Jan 29, 2013 at 7:47 PM, Robby Findler
wrote:
> But I should probably provide that, since it can be done more reliably
> inside the library.
>
> Robby
>
>
> On Tue, Jan 29, 2013 at 6:46 PM, Robby Findler
> wrote:
>>
>>
>>
On Tue, Jan 29, 2013 at 4:23 PM, Danny Yoo wrote:
> On Tue, Jan 29, 2013 at 2:51 PM, Robby Findler
> wrote:
> > I've just pushed an implementation of the union-find algorithm to the
> data/
> > collection. I didn't do it quite the way wikipedia recommends, but
> instead
> > made the sets be litt
But I should probably provide that, since it can be done more reliably
inside the library.
Robby
On Tue, Jan 29, 2013 at 6:46 PM, Robby Findler
wrote:
>
>
>
> On Tue, Jan 29, 2013 at 4:20 PM, Sam Tobin-Hochstadt wrote:
>
>> This is probably a silly question, but don't you also need some way to
On Tue, Jan 29, 2013 at 4:20 PM, Sam Tobin-Hochstadt wrote:
> This is probably a silly question, but don't you also need some way to
> check if two sets have been unioned? Does your application not need
> that?
>
>
You check to see if their canonical element is the same.
Robby
> Sam
>
> On Tue
On Mon, Jan 28, 2013 at 8:18 PM, Matthew Flatt wrote:
> At Sat, 29 Dec 2012 14:05:08 +0300, Michael Filonenko wrote:
>> I have prepared a new version of the patch (attached).
>
> Thanks!
A question on the design here: why not make extflonums part of the
numeric tower?
Also, when are extflonums
1. Pointing to the wiki from racket-lang.org is a good idea.
2. But I agree with the original proposal that we really may wish to list key
videos at the main site directly. It is a service to our community.
-- Matthias
_
Racket Developers list:
http://lists.ra
If I use raise-argument-error in my functions, like this:
(define (integer->roman n)
(cond ((not (integer? n))
(raise-argument-error 'integer->roman "integer?" n))
((positive? n)
(apply string-append (positive-integer->roman n)))
((negative? n)
(apply s
On Tue, Jan 29, 2013 at 2:51 PM, Robby Findler
wrote:
> I've just pushed an implementation of the union-find algorithm to the data/
> collection. I didn't do it quite the way wikipedia recommends, but instead
> made the sets be little containers whose canonical element can be mutated.
More code r
This is probably a silly question, but don't you also need some way to
check if two sets have been unioned? Does your application not need
that?
Sam
On Tue, Jan 29, 2013 at 4:51 PM, Robby Findler
wrote:
> I've just pushed an implementation of the union-find algorithm to the data/
> collection.
On Tue, Jan 29, 2013 at 2:51 PM, Robby Findler
wrote:
> I've just pushed an implementation of the union-find algorithm to the data/
> collection. I didn't do it quite the way wikipedia recommends, but instead
> made the sets be little containers whose canonical element can be mutated.
Code review
I've just pushed an implementation of the union-find algorithm to the data/
collection. I didn't do it quite the way wikipedia recommends, but instead
made the sets be little containers whose canonical element can be mutated.
This suits my purposes well, but I wanted to ask if someone on the list
Maybe the main site could just point to the wiki for extra learning
materials.
On Tue, Jan 29, 2013 at 2:18 PM, Danny Yoo wrote:
> On Tue, Jan 29, 2013 at 9:35 AM, Nick Shelley
> wrote:
> > I recently came across a presentation on the Racket way by Matthew Flatt
> > (http://www.infoq.com/prese
On Tue, Jan 29, 2013 at 9:35 AM, Nick Shelley wrote:
> I recently came across a presentation on the Racket way by Matthew Flatt
> (http://www.infoq.com/presentations/Racket) and thought that it would be
> nice to be able to discover this and similar things more easily. I really
> like how all the
I recently came across a presentation on the Racket way by Matthew Flatt (
http://www.infoq.com/presentations/Racket) and thought that it would be
nice to be able to discover this and similar things more easily. I really
like how all the publications are available on the Racket learning page.
Would
At Sat, 26 Jan 2013 10:36:52 -0500, Matthias Felleisen wrote:
>
> [[ I don't really understand the answer. I mean
>I understand the technicality but not the spirit. ]]
>
> The 'f' comes from the macro input in both cases.
> Hence the rename-out could be seen as the actual
> name required.
There seems to be a problem with `expand' and `quote'd module names.
You can work around the problem by using `(submod "." tmp-module-name)'.
At Mon, 28 Jan 2013 03:30:21 -0500, Stephen Chang wrote:
> Actually, moving the rename to the require doesnt work either. But now
> there's a different erro
25 matches
Mail list logo
