如何将一个表按一定长度等分为N个表

hao3ren

程序中字符串太长，程序编译不了，如何将其按一定长度等分为N个表，然后将这N各表在串成一个表打包

hao3ren

上面说错了，不是等分，应该是比如表中有10500个元素，将其按2000长度分，最后剩余不足的为一个表

cabinsummer

已存在的表为alist，flist为最终输出表，tlist为临时表

1. (defun devidelist(alist / flist tlist)
   
2.   (setq tlist nil flist nil n 0)
   
3.   (repeat (length alist)
   
4.     (setq tlist (append tlist (list (nth n alist))))
   
5.     (setq n (1+ n))
   
6.     (if (= (rem n 2000) 0);余数为0，则将临时表追加到输出表后面，并将临时表重新置空
   
7.       (progn
   
8.         (setq flist (append flist (list tlist)))
   
9.         (setq tlist nil)
   
10.       )
    
11.     )
    
12.   )
    
13.   (if tlist (setq flist (append flist (list tlist))));处理最后一组不够2000个的表
    
14.   flist
    
15. )

(defun devidelist(alist / flist tlist)<br />   (setq tlist nil flist nil n 0)<br />   (repeat (length alist)<br />     (setq tlist (append tlist (list (nth n alist))))<br />     (setq n (1+ n))<br />     (if (= (rem n 2000) 0);余数为0，则将临时表追加到输出表后面，并将临时表重新置空<br />       (progn<br />         (setq flist (append flist (list tlist)))<br />         (setq tlist nil)<br />       )<br />     )<br />   )<br />   (if tlist (setq flist (append flist (list tlist))));处理最后一组不够2000个的表<br />   flist<br /> )

yoyoho

感谢 cabinsummer 分享函数!

duotu007

cabinsummer 发表于 2011-10-12 07:18
已存在的表为alist，flist为最终输出表，tlist为临时表

修改下，完美了，呵呵。
;;;alist 待分割表 ; m分格长度 ; flist 返回分完的表
;;;(devidelist '(1 2 3 4 5 6 7 8 9 10 11 12 13) 3)
;;;->((1 2 3) (4 5 6) (7 8 9) (10 11 12) (13))
(defun devidelist ( alist m / flist tlist n )
  (setq tlist nil flist nil n 0)
  (repeat (length alist)
    (setq tlist (append tlist (list (nth n alist))))
    (setq n (1+ n))
    (if (= (rem n m) 0);余数为0，则将临时表追加到输出表后面，并将临时表重新置空
      (progn
        (setq flist (append flist (list tlist)))
        (setq tlist nil)
      )
    )
  )
  (setq flist (append flist (list tlist)));处理最后一组不够2000个的表
  flist
)

cabinsummer

duotu007 发表于 2011-10-12 08:50
修改下，完美了，呵呵。
;;;alist 待分割表 ; m分格长度 ; flist 返回分完的表
;;;(devidelist '(1 2 3 ...

其实我写的那个根本就没有测试，感谢duotu007帮忙测试。看来效果还不错

cabinsummer

1. (defun devidelist ( alist m / flist tlist n )
   
2.   (setq tlist nil flist nil n 0)
   
3.   (repeat (length alist)
   
4.     (setq tlist (append tlist (list (nth n alist))))
   
5.     (setq n (1+ n))
   
6.     (if (= (rem n m) 0)
   
7.       (progn
   
8.         (setq flist (append flist (list tlist)))
   
9.         (setq tlist nil)
   
10.       )
    
11.     )
    
12.   )
    
13.   (if tlist (setq flist (append flist (list tlist))))
    
14.   flist
    
15. )

(defun devidelist ( alist m / flist tlist n )<br />   (setq tlist nil flist nil n 0)<br />   (repeat (length alist)<br />     (setq tlist (append tlist (list (nth n alist))))<br />     (setq n (1+ n))<br />     (if (= (rem n m) 0)<br />       (progn<br />         (setq flist (append flist (list tlist)))<br />         (setq tlist nil)<br />       )<br />     )<br />   )<br />   (if tlist (setq flist (append flist (list tlist))))<br />   flist<br /> )

lijiao

2. (defun devidelist (alist m / OUT OUT1)
   
3.   (repeat (1+ (fix (/ (length alist) m)))
   
4.     (setq out1 '())
   
5.     (repeat (fix m)
   
6.       (setq out1 (cons (car alist) out1)
   
7.             alist (cdr alist)))
   
8.     (setq out (cons (reverse (vl-remove nil out1)) out))
   
9.     )
   
10.   (reverse (vl-remove nil out))
    
11.   )

(defun devidelist (alist m / OUT OUT1)<br />   (repeat (1+ (fix (/ (length alist) m)))<br />     (setq out1 '())<br />     (repeat (fix m)<br />       (setq out1 (cons (car alist) out1)<br />             alist (cdr alist)))<br />     (setq out (cons (reverse (vl-remove nil out1)) out))<br />     )<br />   (reverse (vl-remove nil out))<br />   )