This is Exercise 28.1.2 from HtDP. I\'ve successfully implemented the neighbors function and all test cases pass.
I\'m working through Exercise 21.2.3 of HtDP on my own and was wondering if this is idiomatic usage of the various functions. This is what I have so far:
I need some advice on abstracting the find and check-callback functions. The code works fine, but it seems that there is a lot of unnecessary repetition. Is there a more elegant way to re-write them?
I\'m using the Dr. Racket development environment and the language definition #lang scheme to do work for a course. However, I\'m not sure 开发者_高级运维how to best use this tool for debugging. I wou
I\'m hacking in Racket and I keep getting errors. The default error handler shows a s开发者_运维技巧tack trace.At the end of the stack trace, it shows the \"top level\" evaluation as \"/path/to/file/
I\'m using Dr. Racket, language Pretty Big, and I\'m trying to make a simple binary search tree \"in?\" method, that will return if a value is in the binary search tree or not. It needs to be general,
In Racket scheme are th开发者_Python百科ere any libraries that allow you to read in a png, alter the image and write it back to disk?Failing png any other common image formats.There is support for PNG
I\'m trying to emulate a stack in scheme. I\'m using DrScheme and I select the language R5RS. I need to create functions that pop, push, and peek. But i\'m having trouble figuring out how to pass by r
I followed this tutorial and successfully installed Emacs, STk, Quack. The question is how can I load my program like I do in Racket?
Currently learning Scheme/Racket and have problem running this piece of code. (if (or (< aftnHour 0) (> aftnHour 6))
加载中,请稍侯......