Re: [racket-users] Recursevly processing a list with "wholes"

> On Nov 15, 2016, at 19:52, meino.cra...@gmx.de wrote: > > Hi, > > I have a list of sublists. Some of the sublists are empty. > The list should be processed recursevly and the resulting > list should no longer contain empty sublists. Is this homework? if so: can you show your test cases?

[racket-users] Recursevly processing a list with "wholes"

Hi, I have a list of sublists. Some of the sublists are empty. The list should be processed recursevly and the resulting list should no longer contain empty sublists. The code I have so far looks like: (define (step-through-list lst) (if (empty? lst) lst (cons (process-sublist (car

Re: [racket-users] mode-lambda with antialiasing?

On Mon, Nov 14, 2016 at 6:50 PM, Jay McCarthy wrote: > I could be wrong, but I don't think that there's an obvious > anti-aliasing algorithm that fits mode-lambda's use cases. I would > recommend rendering at a high buffer size and then down sampling. I > attached a

Re: [racket-users] If a thunk is a proc of zero arguments, what is a proc of one argument?

On that subject, I just now tried to install racket-mode, but it isn't listed at all. I see it on the website, but not in the M-x package-list-packages list. I have this in my .emacs: (setq package-archives '(("gnu" . "https://elpa.gnu.org/packages/;) ("marmalade" . "

Re: [racket-users] If a thunk is a proc of zero arguments, what is a proc of one argument?

> I did not, but that's a very nice feature. Unfortunately, I'm an Emacs > guy. :/ Well as is often the case Emacs provides only about 42 ways you could do this. :) A few: In racket-mode C-M-y inserts λ. There's also racket-unicode-method-enable:

Re: [racket-users] Higher order function to append-map the application of a list of functions to a set of args?

On Tuesday, November 15, 2016 at 12:58:23 PM UTC-5, Brian Adkins wrote: > On Tuesday, November 15, 2016 at 12:50:49 PM UTC-5, Brian Adkins wrote: > > On Tuesday, November 15, 2016 at 11:53:37 AM UTC-5, johnbclements wrote: > > > > On Nov 15, 2016, at 8:30 AM, Brian Adkins

Re: [racket-users] Higher order function to append-map the application of a list of functions to a set of args?

On Tuesday, November 15, 2016 at 12:50:49 PM UTC-5, Brian Adkins wrote: > On Tuesday, November 15, 2016 at 11:53:37 AM UTC-5, johnbclements wrote: > > > On Nov 15, 2016, at 8:30 AM, Brian Adkins wrote: > > > > > > I'm working on a simple chess engine in Racket as a

Re: [racket-users] Higher order function to append-map the application of a list of functions to a set of args?

On Tuesday, November 15, 2016 at 11:53:37 AM UTC-5, johnbclements wrote: > > On Nov 15, 2016, at 8:30 AM, Brian Adkins wrote: > > > > I'm working on a simple chess engine in Racket as a learning exercise. I > > initially wrote this function: > > > > (define

Re: [racket-users] If a thunk is a proc of zero arguments, what is a proc of one argument?

On Tue, Nov 15, 2016 at 11:57 AM, David Storrs wrote: > I did not, but that's a very nice feature. Unfortunately, I'm an Emacs > guy. :/ Then you have no excuse for not making a λ macro. -- You received this message because you are subscribed to the Google Groups

[racket-users] Re: Higher order function to append-map the application of a list of functions to a set of args?

On Tuesday, November 15, 2016 at 11:30:54 AM UTC-5, Brian Adkins wrote: > I'm working on a simple chess engine in Racket as a learning exercise. I > initially wrote this function: > > (define (valid-queen-moves board idx is-opposite-color?) > (append (valid-bishop-moves board idx

Re: [racket-users] If a thunk is a proc of zero arguments, what is a proc of one argument?

On Sun, Nov 13, 2016 at 9:14 AM, 'John Clements' via Racket Users < racket-users@googlegroups.com> wrote: > > > On Nov 13, 2016, at 06:42, David Storrs wrote: > > > > Thanks, all. Points well taken and I'll go back to writing lambda (x). > I appreciate the pointer to

Re: [racket-users] Higher order function to append-map the application of a list of functions to a set of args?

> On Nov 15, 2016, at 8:30 AM, Brian Adkins wrote: > > I'm working on a simple chess engine in Racket as a learning exercise. I > initially wrote this function: > > (define (valid-queen-moves board idx is-opposite-color?) > (append (valid-bishop-moves board idx

[racket-users] Re: Higher order function to append-map the application of a list of functions to a set of args?

On Tuesday, November 15, 2016 at 11:30:54 AM UTC-5, Brian Adkins wrote: > I'm working on a simple chess engine in Racket as a learning exercise. I > initially wrote this function: > > (define (valid-queen-moves board idx is-opposite-color?) > (append (valid-bishop-moves board idx

[racket-users] Higher order function to append-map the application of a list of functions to a set of args?

I'm working on a simple chess engine in Racket as a learning exercise. I initially wrote this function: (define (valid-queen-moves board idx is-opposite-color?) (append (valid-bishop-moves board idx is-opposite-color?) (valid-rook-moves board idx is-opposite-color?))) I didn't like