Hello,
I am trying to use HtDF to create a function to sort a Binary Search Tree.
I am in an intro class so this may be a simple question. I did the
following:
;define-struct a node
(define-struct node (left value right))
;BTS leafs
(define a-node(make-node null "A" null))
(define b-node
Thanks for sharing.
Hi also has a blog.
Racket編程指南 (The Racket Guide)
https://blog.csdn.net/chinazhangyong/category_7386082.html
Racket stuff
https://blog.csdn.net/chinazhangyong/category_7386249.html
Awesome material.
Stephen De Gabrielle於 2020年4月26日星期日 UTC+8下午10時26分20秒寫道:
>
> Hi
>
> I just
Hello,
just a quick and dirty hack I use to get the best of default
dispatch-... for my use-case when dispatching API requests:
(define-for-syntax (dispatch-api-case-helper stx)
(syntax-parse stx
(((method:id (path+args:expr ...) proc:id) rest ...)
#`((("api" path+args ...) #:method
Meanwhile here's my attempt at doing a koyo-like url generation with a
wrapper around web-server/dispatch's url-generating function:
(define-values (app-dispatch app-url)
(dispatch-rules ; the standard one
[...]))
(define (app-url/names route-name . args)
;; define a mapping between
Hi
I just discovered
https://github.com/OnRoadZy/RacketGuideInChinese
I think this is awesome!
Thank you to 张恒源 (OnRoadZy)
Are there any other translations out there?
Kind regards
Stephen
--
--
You received this message because you are subscribed to the Google Groups
"Racket Users"
Thank you for sharing this!
I'm wondering, if this is a common use case, maybe it is worth adding to
web-server/dispatch in some form?
Or, if not, maybe we can extend the documentation to include some hints
on how to approach this otherwise?
It is great to have powerful libraries outside the
6 matches
Mail list logo