newlispfanclub.alh.net

kesha

Hi,
http://www.newlisp.org/downloads/newlis ... .html#join

> (set 'MYLIST '("a" "b" "c"))
("a" "b" "c")
> (join MYLIST)
"abc"
> (join MYLIST "-")
"a-b-c"
> (join MYLIST (string "-" (join MYLIST) "-"))
"a-abc-b-abc-c"

kesha

Thanks Lutz!

kesha

newLISP v.10.7.1 64-bit on Linux IPv4/6 UTF-8 libffi, options: newlisp -h > (= 'A 'A) true > (= 'A 'B) nil <--------------- !!! > (define (Test A B C)) (lambda (A B C)) > (++ (find 'D (first Test))) 1 > (= 'A 'A) true > (= 'A 'B) 1 <---------------- ???

kesha

I don't think this is the correct behaviour.
The program falls, without the possibility to fix something.

kesha

OS: GNU/Linux Gentoo x86_64 and Gentoo x86
gcc: 4.9.3

Code: Select all

newLISP v.10.7.0 64-bit on Linux IPv4/6 UTF-8 libffi, options: newlisp -h
> (unpack "c" 1)
segmentation fault

Code: Select all

newLISP v.10.7.1 32-bit on Linux IPv4/6 UTF-8, options: newlisp -h
> (unpack "c" 1)
segmentation fault

Oops...

kesha

It's just food for thought on the use of recursion. If refined, could get interesting. For example: #!/usr/bin/env newlisp (define (test-case KEY) (case KEY (0 (begin (println "KEY => " KEY)(test-case (++ KEY)))) (1 (begin (println "KEY => " KEY)(test-case (++ KEY)))) (2 (begin (println "KEY => " KE...

kesha

Hi All, how can perform multiple checks. (define (test-case KEY) (case KEY (0 (begin (println "KEY => " KEY)(test-case (++ KEY)))) (1 (begin (println "KEY => " KEY)(test-case (++ KEY)))) (2 (begin (println "KEY => " KEY)(test-case (++ KEY)))) (3 (begin (println "KEY => " KEY)(test-case (++ KEY)))) (...

newlispfanclub.alh.net

Search found 7 matches

Re: string function returns literal list

Re: bug?

bug?

Re: segmentation fault

segmentation fault

Re: case

case