[LISP程序]：机件轮廓选择集排序编程一例

lsjjm

机件轮廓选择集排序编程一例

2. 
   
3. (defun sortsets (ents / slist n ss)   
   
4.   (setq ss (ssadd))
   
5.   (setq n 0)
   
6.   (while (< n (sslength ents))
   
7.     (pt (ssname ents n))
   
8.     (setq slist (append slist (list (list (ssname ents n) pt1 pt2))))
   
9.     (setq n (1+ n))
   
10.   );w
    
11.   (setq slist (vl-sort slist '(lambda (x1 x2)
    
12.     (if (equal (car (cadr x1))(car (cadr x2)) 0.001)
    
13.       (< (car (last x1))(car (last x2)))
    
14.       (< (car (cadr x1))(car (cadr x2)))
    
15.     )
    
16.   )))
    
17.   (foreach i slist (setq ss (ssadd (car i) ss)))
    
18.   ss
    
19. );
    
20. pt--求实体端点函数:

<br /> (defun sortsets (ents / slist n ss)   <br />   (setq ss (ssadd))<br />   (setq n 0)<br />   (while (< n (sslength ents))<br />     (pt (ssname ents n))<br />     (setq slist (append slist (list (list (ssname ents n) pt1 pt2))))<br />     (setq n (1+ n))<br />   );w<br />   (setq slist (vl-sort slist '(lambda (x1 x2)<br />     (if (equal (car (cadr x1))(car (cadr x2)) 0.001)<br />       (< (car (last x1))(car (last x2)))<br />       (< (car (cadr x1))(car (cadr x2)))<br />     )<br />   )))<br />   (foreach i slist (setq ss (ssadd (car i) ss)))<br />   ss<br /> );<br /> pt--求实体端点函数:

qsg12

能不能加一点注解