newlispfanclub.alh.net

newBert

I really like NewLISP and yet I miss the optimised terminal recursion too. I'm interested in your macro, which I'm currently testing. It seems a bit slower than the 'trampolines' (just an impression, not verified), but it is much easier to use, and also more elegant. Obviously, an iterative loop wil...

newBert

I tried this, unpretentious: https://controlc.com/10370640

(Sorry ! Impossible to paste code here, because of "internal server error")

newBert

Sorry, I could not indent the previous code, because it caused an "internal server error" (?!)

newBert

So, maybe like this (probably improvable):

Code: Select all

(define-macro (make-adder) (local (name val) (bind (args) true) (set (expand name 'name) (expand (lambda (x) (+ val x)) 'val))))

(make-adder (name 'add10) (val 10))
(println (add10 3))
; 13

newBert

Oh my apologies! I reversed x and y (in `letex`) when transcribing... :/

Code: Select all

(define (make-adder x)
  (letex (y x)
    (fn (z) (+ y z))))
    
(setq add2 (make-adder 2))
(println (add2 4))
; 6

newBert

Maybe this way, but it's not quite the same:

Code: Select all

(define (make-adder x)
  (letex (x y)
    (fn (z) (+ y z))))
    
(setq add2 (make-adder 2))
(println (add2 4))
> 6

newBert

First, you need to understand how the function import works. And see some examples where it is used, like here for instance (see especially the first part with the 'import' and the 'constant' ). Then after recovering all the functions from Allegro , the rest is a work of patience, a little repetitiv...

newBert

cameyo wrote: ↑
Wed Sep 02, 2020 7:34 am
the "ref-all" and "ref" functions have a parameter to get data instead of indexes.

Well seen ! I had completely forgotten this option.
Thanks, Cameyo.

newBert

Sorry, I don't have time to answer from a concrete example that should first be created. But I think there are some interesting tracks in the wikibook, especially here (see 'find-all' at the end).

newBert

One possibility, probably among others: > (define (g (x nil)) x) (lambda ((x nil)) x) > (define-macro (f) (setf (nth '(0 0 1) g) (args 0))) (lambda-macro () (setf (nth '(0 0 1) g) (args 0))) > (f 1) 1 > (g) 1 > (f '(+ 1 2)) '(+ 1 2) > (g) (+ 1 2) P.S. : I preferred (args 0) instead of 'data' for mac...

newBert

lyl wrote: ↑
Fri Aug 28, 2020 5:54 am
Code: Select all
(setq a '(a1 a2))
(dolist (x a)
  (let (z $idx)
    (setq x (lambda(y) z))
    ))
What's wrong with my code, and how to solve it?

Maybe with :

Code: Select all

(dolist (x a)
  (let (z $idx)
    (set (sym x) (expand (lambda (y) z) 'z))))

newBert

cameyo wrote: ↑
Fri Jul 03, 2020 10:26 am
thank you. I learned new things.

You're welcome! I learned new things too... :)

newBert

In this case we could also do:

Code: Select all

> (apply + (map (fn (x) (int (if (starts-with x "0") (rest x) x))) (find-all {[0-9]+} "o123p010iru5")))
138

newBert

I think the definition of ‘rember-f’ is wrong. A correct writing of this lambda would be : (define rember-f (lambda (test? a l) (cond ((null? l) '()) ((test? (first l) a) (rest l)) (true (cons (first l) (rember-f test? a (rest l))))))) > (rember-f = 'tuna '(shrimp salad and tuna salad)) (shrimp sala...

newBert

Yes, map is a very useful function which works well in parallel.
It is handy too to take the place of ‘list comprehensions’...

newBert

Just another way to do it (with what comes to hand):

Code: Select all

> (setq x 2 y 3)
3
> (map set '(x y) (list (+ 1 y) (+ 1 x)))
(4 3)

> (setq x 1 y 2 z 3)
3
> (map set '(x y z) (list (+ x y z) (- z y x) (- x y z)))
(6 0 -4)

:)

newBert

My quesstion is: Is there an universal method to determine whether a list can be evaluated or not? Oops ! Why didn't I think of catch ? > (setq a '(1 2 3)) (1 2 3) > (catch (eval a) 'result) nil ; `a` can't be evaluated (see error below in `result`) > result "ERR: illegal parameter type in function...

newBert

Sorry for the late answer, but the forum was inaccessible for a moment.
I think the solution is in “widgets-demo.lsp”.
Maybe you should use ‘base64-dec’ to decode the value of combo-box.

newBert

(setq a '(1 2 3)) ;; This list can not be evaled It's normal, because ‘1’ is neither a primitive nor a lambda (setq b '(1 a)) ;; This list can be evaled, (eval b) --> (2 3) Also normal, because (1 a) is equivalent to (rest a) <- implicit indexing (setq c '(+ 1 2)) ;; This list can be evaled, (eval ...

newBert

Indeed, I've just tried again now, in a new NewLISP session, and I get the expected result: (1 2 3 (4 5 6 7) (nil nil nil nil)) . I'm reassured :). Thank you , RalphRonnquist, Cameyo and Rickyboy for your replies and advice. I don't know what could have happened... I probably forgot NewLISP has no l...

newBert

I don't understand why letn isn't required here, or why let doesn't cause an error:

Code: Select all

(let (a 1 b 2 c 3 d '(4 5 6 7) e (flat (list a b c d)))
  (println (list a b c d e)))
;−> (1 2 3 (4 5 6 7) (1 2 3 4 5 6 7))

newBert

(With some delay...)
I think we could also write: (set 'funclist (list myfunc myfunc myfunc myfunc myfunc)), so we don't need ‘eval’ in (set 'afunc (funclist 2))

newBert

Here is a solution (probably not the only one, nor the best) : newLISP v.10.7.5 64-bit on Linux IPv4/6 UTF-8 libffi, options: newlisp -h > (select '(0 1 2 3 4) (difference (index true? '(0 1 2 3 4)) '(1 2))) (0 3 4) > ;; maybe clearer: > (let (lst '(0 1 2 3 4)) (select lst (difference (index true? ...

newBert

Here is a solution (probably not the only one, nor the best) : newLISP v.10.7.5 64-bit on Linux IPv4/6 UTF-8 libffi, options: newlisp -h > (select '(0 1 2 3 4) (difference (index true? '(0 1 2 3 4)) '(1 2))) (0 3 4) > ;; maybe clearer: > (let (lst '(0 1 2 3 4)) (select lst (difference (index true? l...

newBert

Hi newbert, I have found these functions in an old article on Lisp (to define a function it use DE, maybe Portable Standard Lisp). GETDEF gets the definition of a function. Thanks for infos. A Function in newLISP is not a "closure", so we can examine its content typing its name without parentheses ...

newlispfanclub.alh.net

Search found 156 matches

Re: loop & recur

Re: Code Lisp-ish enough??

Re: Create a function with a function

Re: Create a function with a function

Re: Create a function with a function

Re: Create a function with a function

Re: Running "allegro game library" within NewLisp?

Re: using ref data

Re: using ref data

Re: how to prevent unwanted eval?

Re: Setup functions by setq

Re: Sum of integers in a string

Re: Sum of integers in a string

Re: From "The Little Schemer" to newLISP

Re: Parallel assignment

Re: Parallel assignment

Re: How to determine whether a list can be evaluated

Re: Combo-box

Re: How to determine whether a list can be evaluated

Re: let and letn [resolved]

let and letn

Re: list of functions question

Re: anti-select elements of a list

Re: anti-select elements of a list

Re: FUNCALL and GETDEF