Here is my code: (require \'hash-table) (define (hash-table-get htable key) ((hash-inquirer equal?) htable key))
I wrote a quick-sort in scheme (racket) #lang racket (define (quick-sort xs) (let* ([p (list-ref xs 0)] [tail (list-tail xs 1)]
It hurts to ask it here. It really does. Every time I search in vain for the answers to my troubles, I see it. Taunting me. Stack Overflow.
Trying to understand free-identifier=? and bound-identifier=?. Can anyone give me equivalent code examples wher开发者_C百科e using free-identifier=? would return true and using bound-identifier=? woul
Does anyone know of any semi-portable way to write console applications (e.g. basic animation) in scheme? I heard of an ncurses wrapper but I couldn\'t find anythi开发者_StackOverflow社区ng.You can\'t
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical andcannot be reasonably answered in its current form. For help clari
I am trying to find a resource where I can practice my programming skills in scheme. I have a class coming up that uses scheme exclusively. While I have done moderate amounts of programming in C++ a
I am trying to make a function call using the data I read from an input file. I have the following function that takes a list of vertices and an arbitrary numbers of commands. (I simplified the functi
This bit of code is in Ikarus\' implementation of vector-map: (let f ([p p] [v v] [i 0] [n (vector-length v)] [ac \'()])
I have this script as an .scm in Gimp: ;MIT license. (define (script-fu-export-layers img drw path outnameformat)
加载中,请稍侯......