When using Dr. Racket (assuming #lang) you are given the option to
incrementally step forward with the Step button while debugging. Does
Dr.Racket also allow you to take 1 step backwards while debugging?
Thanks,
--
Rian Shams
Racket Users list:
http://lists.racket
)
>
> > (define c (make-counter 1))
> > (c)
> 1
> > (c)
> 2
>
> Now you can write your indexing function succinctly:
>
> (define (index-s-exp s-exp index)
> (let ([c (make-counter index)])
> (tree-map (λ (x) (c)) s-exp)))
>
>
> Aside: T
I am trying to build the following indexing function:
;list-of-lists beginning-index-number -> list-of-lists
;The purpose of this function is to convert one list into another list of
incremental numbers, while at the same time, maintaining the structure of
the original list. To basically number ea
gt; At Sat, 4 Jan 2014 18:52:55 -0500,
> Matthias Felleisen wrote:
> >
> > [1 ]
> > [1.1 ]
> >
> > Perhaps you want something like this:
> >
> > Welcome to Racket v6.0.0.1.
> > > (current-print (lambda (x) (if (procedure? x) (printf &quo
(select-random-safe-function)
> '$*
>
>
>
>
> On Jan 4, 2014, at 2:48 AM, Rian Shams wrote:
>
> If I do this I get the results I need for (procedure-arity
> (select-random-safe-function)), but when I call
> (safe-function-set) or (select-random-safe-fun
-arity (select-random-safe-function))
> > error: procedure-arity: contract violation
> > expected: procedure?
> > given: '$+
> >
> > I think the problem is that the safe-functions are passed to
> procedure-arity
> > quoted. Is there a way I can unquote
rocedure?
given: '$+
*I think the problem is that the safe-functions are passed to
procedure-arity quoted. Is there a way I can unquote the functions, or
adjust procedure-arity to make (procedure-arity
(select-random-safe-function)) work?*
Thanks,
--
Rian Shams
Rack
4319006
> 0.6998388642832832
> 0.599233672637633
> 0.5238661544779689
> 0.72734166222789)
> >
>
>
> rac
>
>
>
> On Dec 19, 2013, at 7:42 PM, Rian Shams wrote:
>
> Hello All,
>
> I am new to Racket and just started building an evolutionary computing
> module
y help would be much appreciated.
Best Regards,
--
Rian Shams
Racket Users list:
http://lists.racket-lang.org/users
lette-wheel-ratio '(1 2 3)) '(1/6 2/6 3/6)))
>
> (define (roulette-wheel-ratio generation-fitness)
> (define total-population-fitness (foldl + 0 generation-fitness))
> (map (lambda (fitness) (/ fitness total-population-fitness))
> generation-fitness))
>
>
generation-fitness) remains
unaffected by the natural recursion imposed by roulette-wheel-ratio?
Any help would be appreciated as I am still learning the Racket basics.
Kind Regards,
--
Rian Shams
Racket Users list:
http://lists.racket-lang.org/users
Thank you, this is amazing! I am a Racketeer for life.
On Mon, Aug 26, 2013 at 10:02 PM, Matthias Felleisen
wrote:
>
> Just add fuzzy-set? to the provide specification of fuzzy-set-library.
> Also add other functions as needed and provide them.
>
>
>
> On Aug 26, 2013, a
zy-set-client racket
;; then you replace this with the usual require
(require (submod ".." fuzzy-set-library))
(fuzzy-set
(fuzzy-element 'a .1)
(fuzzy-element 'b .2)
(fuzzy-element 'c .3)
(fuzzy-element 'a .3)))
;; drop this, it exists to test
(require &
inates latter duplicates.
Any guidance on how to create fuzzy-set representation this way or if you
can suggest more concise and elegant methods I would be greatly
appreciative.
Thanks,
--
Rian Shams
Racket Users list:
http://lists.racket-lang.org/users
14 matches
Mail list logo
