Topic: Name the process :: Game 1

[JohnK]

The object of this game is to name the process you want done on this function. The first one to post, gets to name the overall process preformed. Then we have to build our procedures based on those instructions. For instance; here is a sample game played out.


*** POST 1

Given the list: (0 1 2 3 4 5 6 7 8 9)
I want to ___________.

*** POST 2

Return the list with he last item removed.

*** POST 3

(defun pop-last (l)
  (reverse (cdr (reverse l))) )


(Obviously, thats a very simple example, but im not going to build a complex example for something that im not entirely sure is going to 'fly'.) I think this game could be alot of fun because of the lack of direction (so to speak) You are free to do as you want without restraints.

So...

Given the list: (0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9)
I want to ___________.

[uncoolperson]

dent it up real good?



list unique?
(create a list of lists of unique values from a list of not so unique values)

[JohnK]

What?!

[uncoolperson]

i did it once... and i forgot what i did to make it pretty...



turn a list like;
(1 2 3 4 5 4 4 2 1 3 6 7 4 6 9 6 5 1 3)

into
(( 1 2 3 4 5 6 7 9 ) ( 1 2 3 4 5 6 ) ( 1 3 4 6 ) ( 4 ))

[ElpanovEvgeniy]

Code: [Select]

(defun for-theswamp (lst)
  (if lst
    ((lambda (x)
       (cons (vl-sort (car x) '<) (for-theswamp (cadr x)))
     ) ;_  lambda
      (for-theswamp-1 (cdr lst) (list (car lst)) nil)
    )
  ) ;_  if
) ;_  defun
(defun for-theswamp-1 (lst a1 a2)
  (if lst
    (if (member (car lst) a1)
      (for-theswamp-1 (cdr lst) a1 (cons (car lst) a2))
      (for-theswamp-1 (cdr lst) (cons (car lst) a1) a2)
    ) ;_  if
    (list a1 a2)
  ) ;_  if
) ;_  defun


(for-theswamp  '(1 2 3 4 5 4 4 2 1 3 6 7 4 6 9 6 5 1 3))
;; => '((1 2 3 4 5 6 7 9) (1 2 3 4 5 6) (1 3 4 6) (4))

[uncoolperson]

i thought i had killed this

[ElpanovEvgeniy]

i thought i had killed this

I have not understood you...
I have written this program today.

[CAB]

AS I understand uncoolperson comment, I think he was saying that he killed the thread due to the lack of activity.
I just think people are too busy to participate, anyway that's my excuse.

[ElpanovEvgeniy]

Thank for explanations Alan

[CAB]

You are welcome.

[ElpanovEvgeniy]

You are welcome.

If, my course...

Sort the list which is not using SETQ, VL-*

Code: [Select]

(setq lst '(7 3 4 6 9 6 7 2 5 3 2 3 6 4 6 3 1)
      f   (function <)
)
(defun sort (lst f)
  ?????
)
 

[CAB]

Code: [Select]

(defun sort (lst)
  (dos_sortlist lst)
)

[ElpanovEvgeniy]

Shortly, but for me does not work...

[ElpanovEvgeniy]

Code: [Select]

(defun sort (lst)
  (dos_sortlist lst)
)

For this program, it is necessary dos_lib?

[ElpanovEvgeniy]

Probably, I have not understood, game rules...
Where I can see or explain me.
Beforehand thank!