newlispfanclub.alh.net

As this example shows, the expression in the exp-N position in each (exp-N body-N) pair is completely unevaluated. > (set 'a 5) 5 > (set 'test '(eval a)) (eval a) > (eval test) 5 > (case test (5 'zero) ((eval a) 'one) (pete 'two) (true 'magoo)) one That is, no attempt is made to evaluate the express...

You could write your own version of push -- mypush-- that would be used something like this: (mypush 1 2 3 'a) Notice that I quote the stack (in this case 'a) to prevent it from being evaluated. Something like this (this code doesn't work): (define (mypush) (let ( stack (last (args)) list-of-items (...

Being unfamiliar with Scheme's named let, it's hard for me to read the Scheme code. Here is my straightforward newLisp solution which is, I think, tail recursive. ;; recursive version ;; (define (myfilter pred? items) (reverse (myfilter-aux pred? items '())) ) (define (myfilter-aux pred? items resul...

Because I can't figure out how to leave a comment at http://newlisper.blogspot.com, I'll post my answers here: Newlisper's problem statements is: Christmas quiz: four by four Here's a version of a traditional puzzle to exercise your mental maths muscles before Christmas. In newLISP, define symbols z...

Perhaps this site will help.

http://personal.vsnl.com/erwin/recursion.htm

Thanks, cormullion.

This is great! Because it's "nothing but newLisp," it works in Windows, too, with the obvious change.

-- Sam

My two cents: Mark wrote: "Ideally I could just put the CAR of the recursive value in the first part of the list and put the new value in CDR however it doesn't want to play that way." In newLisp as well as Scheme, a reasonable approach is to write in the language you wish you had, and then implemen...

Improved so that (magoo "no such food" food-lists) returns nil. (define (magoo key aList) (let ( vec (ref key aList) ) ;body of let (and vec (aList (vec 0)) ) )) > (magoo "no such food" food-lists) nil > (magoo "celery" food-lists) ("vegatables" "lettuce" "celery" "cucumbers" "olives" "onions")

(set 'food-lists '( ("fruit" "bannana" "pear" "apple" "plum" "grapes") ("vegatables" "lettuce" "celery" "cucumbers" "olives" "onions") ("junk food" "ice cream" "licorice" "chocolate bar" "carmel apple" "bubble gum") )) (define (magoo findme a-list) (a-list ((ref findme a-list) 0)) ) Then > (magoo "...

See the (dotimes ...) example in the Throw section of the help file.
-- Sam

Hello Hans-Peter,

Yes, I need it in Neobook. The best solution would support Win98 as well as WinNT, Win2K and WinXP.

Thanks,
-- Sam

Does anyone know of a windows function and associated DLL that will return a list of all running processs and/or applications — lists similar to those provided by Task Manager?

Thanks,
-- Sam

Thanks, HPW ... macro? it is!

lambda? returns true as expected in the following:

> (define (bob))
(lambda ())
> (lambda? bob)
true

Should lambda? also return true in the following?

> (define-macro (bob))
(lambda-macro ())
> (lambda? bob)
nil

Would something like this work? (define (fnparse SOURCE) (letn ( LP "(" ;) left paren SP " " ; space LPSP "( " ;) left paren and space NULL "" ; null string keep (lambda (L K) (dolist (x L) (if (= (x 0) LP) (push x K))) K) s (parse (replace LPSP (join (parse SOURCE) SP) LP) SP) ) ;body of letn (uniq...

(apply max b)

(context 'rot13) (define (rot13:aux ch , i) (if (set 'i (find ch "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ")) ("nopqrstuvwxyzabcdefghijklmNOPQRSTUVWXYZABCDEFGHIJKLM" i) ch )) (define (rot13:rot13 str) (join (map rot13:aux (explode str))) ) (context 'MAIN) > (silent (setq s (read-file "n...

Hello Christer, It is intentional! Unless told otherwise (see manual), 'int' understands that number strings beginnning with numeral "0" (zero) are octal numbers. Since "08" is not a valid octal number, 'int' stops parsing the octal string at "0" and returns zero as the result. The manual gives comp...

Here is a pair of functions that might do the job: (define (good-count N L) (let ;if N=3.3 and L=(1 3 4) then pairs=((1 2.3) (3 0.3) (4 0.7)) ( pairs (map (fn (x) (list x (abs (sub x N)))) L) ) ;body of let ((min-pair pairs) 0) )) (define (min-pair L) (let ( MIN-PAIR (L 0) ) ;body of let (dolist (PA...

Hello Dmi, When I searched Google for "newlisp in 21 minutes" (quotes included), it found a "cached" version for me which I downloaded as an HTML file and then zipped. I can send the zipped file to you (how?) or perhaps you will have similar success with Google or another search engine. Here is the ...

> (setq x '(1 2))
(1 2)
> (setq x (cons x '(3 4)))
((1 2) 3 4)
> x
((1 2) 3 4)

Based on work in this forum by Nigel Brown and HPW, the function (doc) has already been written. (define (doc f) "(doc f) --> display function f's doc string, if present" (if (and (or (lambda? f) (macro? f))(string?(nth 1 f))) (begin (print(nth 1 f)) (write-line) true) nil)) Using the following func...

Hi eddier,

I think you version works better like this:

try (append "-" o {\s*(\w*)(\s*-|$)}) in which I replaced the double-quote string delimiters with left and right brace string delimiters, instead of (append "-" o "\s*(\w*)(\s*-|$)") Using braces instead of double-quotes removes the need to treat the backslash characters with special care. -- sam