LispForum

Ok,all right! Thank you Well, actually, BUTLAST has an optional 2nd argument that lets you say "but the last n elements". Be that as it may, this solutions is actually just incorrect. It relies on the assumption that all elements in the list are unique. SET-DIFFERENCE is for taking the dif...

sw2wolf wrote:(set-difference '(1 2 3 4 5 6 7) (butlast '(1 2 3 4 5 6 7)))

Soluciòn interesante, no conocìa la funciòn "set-difference". Pero suppongo que no hay manera de hacerlo por "los ultimos n".

I don't why..but I was thinking the code you just wrote is the SAME I tried (without success) in the beginning.. ...however it works! Thank you List isn't a keyword, but it does happen to be the name of a common function. But call your variables what you wish. I think you are confused on how the equ...

Well... 1) About your function: WORKS (but I changes list to LISTA , because "list" is a KEY-WORD ). Just I don't understand: how can it works? equal match pointers... 2 integers are supposed to be the same if they are the same object..not the same value.. Indeed, I used EQL and it works f...

Yeah. Thank you for the very exaustive explanation. However I'm doing a BASIC common list course at university...but the info you gave me will be useful (and I will save them on my PC) because I'm (and I will keep) studying A.I. . (I don't well how to format the code..etc..I'm a "novice" o...

(Sorry for double reply) I tried to update the code to handle "last n elements". I know it give INFINITIVE LOOP because I will go matching NIL with NIL. But how to save the lenght of the list t to match it? For example: - I pass list of 7 elements: ' (1 2 3 4 5 6 7) - I want last 4 element...

ok thank you. But is not supposed to be "automatically" done by the compiler?
I mean new compilers optimize the code

I cannot understand what you mean with "replace the line".
I don't see any way to replace that line...is the "end condition" (recursion is based on: end case , recursive call. No?)

thank you very much!!
Very useful
Any hints to make the "full" version? (the one which returns "last n elements")

Hello everyone. I'm trying to implement ITERATIVE "last" function. But it doesn't seem to work. It is important I use do* . However if you have any suggestion of good "alternatives" it's ok! I know "last" function accepts &optional n , but this is a "simplified...