[求助]：请问有没有对数据列表排序的函数?

mhy007 · 发表于 2007-1-26 23:14:57

马上注册，结交更多好友，享用更多功能，让你轻松玩转社区。

您需要登录才可以下载或查看，没有账号？立即注册

×

比如列表(22 55 33 66 11 44 )从小到大排序后成为(11 22 33 44 55 66)?

carrot1983 · 发表于 2007-1-27 02:03:35

[php]
(defun listremoveatom (delatom lstin)
 (apply
'append
(subst
 nil
 (list delatom)
 (mapcar
'list
lstin
 )
)
 )
)
(defun sortlst(lst / len k abc lst_sort)
 (setq len (length lst))
 (setq k 1)
 (while (<= k len)
(setq abc (eval (append '(max) lst)))
(setq lst (listremoveatom abc lst))
(setq lst_sort (cons abc lst_sort))
(setq k (1+ k))
 )
 (reverse lst_sort)
)
[/php]
运行：
 (setq lst '(55 11 33 44 22 66))
 (reverse (sortlst lst))
结果：
(11 22 33 44 55 66)

zml84 · 发表于 2007-1-27 08:22:25

何必亲自动手？使用vl-sort函数即可。
[PHP]
(setq list '(55 11 33 44 22 66))
(vl-sort list '< )
[/PHP]

taner · 发表于 2007-1-27 08:48:03

[FONT=courier new]
STDLIB裏最全面了.
Synopsis
(std-sort <lst> <less-pred>)
(std-stable-sort <lst> <less-pred>) ; keeps order intact
(std-fast-sort <lst> <less-pred>) ; may remove duplicates
Description
All return a sorted list, sort order determined by the less predicate. Increasing numbers should be sorted with <
Most of the time you may use STD-FAST-SORT, if you accept the restrictions.
STD-SORT may be slower than STD-FAST-SORT but keeps all elements of the list. Duplicates are not removed.
STD-STABLE-SORT maybe slower than STD-SORT and STD-FAST-SORT but keeps the elements in its original order. Only on VILL and VLISP it is different from std-sort, which is the same as STD-FAST-SORT.
STD-FAST-SORT may remove duplicate entries. (implementation dependent). To keep all elements use STD-SORT instead. This was introduced with VLX-SORT and VL-SORT. On VILL and VLISP this is the same as STD-SORT.
All the functions besides the internal VL[X]-SORT use a stable and iterative merge-sort algorithm, which is equally fast for ordered or random lists and has no stack overflow problems.
So STD-STABLE-SORT is for now the same as std-sort, until a faster but not stable sort algorithm is found. In plain AutoLISP even all three of them are the same.
Examples
(std-fast-sort '(2 0 1 2 3 4 0) '<)
=> (0 1 2 3 4)
or (0 0 1 2 2 3 4)
(std-stable-sort '(2 0 1 2 3 4 0) '<) => (0 0 1 2 2 3 4)
(std-fast-sort '("2" "1" "3" "4" "0") '<) => ("0" "1" "2" "3" "4")
(std-sort pointlist '(lambda (x y) (< (car x) (car y))))
=> pointlist sorted according increasing x-value
Arguments
lst: any proper list
less-pred: a function or lambda list accepting 2 arguments, and returning nil if the second argument is lower or equal than the first. For numbers and strings use '<.
Return Value
A sorted list. STD-SORT and STD-STABLE SORT return a list of the same length as the argument.
Side Effects
Not confirmed yet: STD-FAST-SORT is the only function which might destructivly change the original list (in Vital Lisp or Visual Lisp). So if you want to keep the original list intact, use a copy of the list, use STD-COPY-TREE, just for safety reasons.
The predicate also might produce side-effects, but this is generally not a good idea!
[/FONT]

复制代码

Underway · 发表于 2007-1-27 09:54:08

验证 VL-SORT
Command: (vl-sort lst '< )
(11 22 33 44 55 66)

Command: (setq lst '(55 11 33 66 44 22 66 55 44))
(55 11 33 66 44 22 66 55 44)

Command: (vl-sort lst '< )
(11 22 33 44 55 66) ; may remove duplicates

carrot1983 · 发表于 2007-1-27 12:23:31

我那个也不行。不能有两个相同的数字在里面。。
还得改进。。。喜欢用R14，所以。。坚持不用VL的函数语言。

mhy007 · 发表于 2007-1-27 13:15:52

就看大家要用于什么目的,我要的是找出一个数据列表里面的一个最小值或最大值,因此zm184的方法对于我的要求最简洁，欣然采纳之。而其他各位朋友的方法也都很不错，收藏起来慢慢消化。谢谢各位！

taner · 发表于 2007-1-27 15:36:39

[FONT=courier new]
;;; ==================================================================
(defun std-count (ele lst / i)
(setq i 0)
(foreach x lst
(if (= ele x)
(setq i (1+ i))
)
)
i
)
;;; (std-count x lst) 返回元素x在表lst中的个数
;;; ==================================================================
(defun std-remove-duplicates (lst / ele new)
(setq new nil)
(foreach ele lst
(if (not (member ele new))
(setq new (cons ele new))
)
)
(reverse new)
)
;;; (std-remove-duplicates lst) 删除重复元素，排序不破坏。
;;; ==================================================================
(defun th-list-addnth (lst pos val / lst1 lst2 cnt nverts)
(setq cnt 0
lst1 '()
nverts (length lst)
)
(repeat pos
(setq lst1 (cons (nth cnt lst) lst1)
cnt (1+ cnt)
)
)
(setq lst1 (cons val lst1)
lst1 (reverse lst1)
cnt pos
)
(if (> nverts pos)
(progn
(setq lst2 '())
(repeat (- nverts pos)
(setq lst2 (cons (nth cnt lst) lst2)
cnt (1+ cnt)
)
)
(setq lst2 (reverse lst2)
lst1 (append
lst1
lst2
)
)
)
)
lst1
)
;;; (th-list-addnth 表位置新元素). 在表的第n項位置增增加一元素
;;; ==================================================================
(defun th-sort< (lst / lst1 len lst2 i n)
(setq lst1 (std-remove-duplicates lst))
(setq lst2 (vl-sort lst1 '<))
(setq len (length lst))
(setq i 0)
(while (< i len)
(if (> (setq n (std-count (setq el (nth i lst2))
lst
)
)
1
)
(repeat (1- n)
(setq lst2 (th-list-addnth lst2 i el))
)
)
(setq i (+ n i))
)
lst2
)
;;; ==================================================================
(defun th-sort> (lst / lst1 len lst2 i n)
(setq lst1 (std-remove-duplicates lst))
(setq lst2 (vl-sort lst1 '>))
(setq len (length lst))
(setq i 0)
(while (< i len)
(if (> (setq n (std-count (setq el (nth i lst2))
lst
)
)
1
)
(repeat (1- n)
(setq lst2 (th-list-addnth lst2 i el))
)
)
(setq i (+ n i))
)
lst2
)
;;; ==================================================================
;;;測試:
;;;命令: !a (4 6 7 9 3 0 4 3 2 3 5 55 66 99 55 77 0 3 6 4 2 1)
;;;命令: (th-sort< a)
;;;(0 0 1 2 2 3 3 3 3 4 4 4 5 6 6 7 9 55 55 66 77 99)
;;;命令: (th-sort> a)
;;;(99 77 66 55 55 9 7 6 6 5 4 4 4 3 3 3 3 2 2 1 0 0)
[/FONT]

[FONT=courier new] 
;;; ================================================================== 
(defun std-count (ele lst / i) 
  (setq i 0) 
  (foreach x lst 
    (if (= ele x) 
      (setq i (1+ i)) 
    ) 
  ) 
  i 
) 
;;; (std-count x lst) 返回元素x在表lst中的个数 
;;; ================================================================== 
(defun std-remove-duplicates (lst / ele new) 
  (setq new nil) 
  (foreach ele lst 
    (if (not (member ele new)) 
      (setq new (cons ele new)) 
    ) 
  ) 
  (reverse new) 
) 
;;; (std-remove-duplicates lst) 删除重复元素，排序不破坏。 
;;; ================================================================== 
(defun th-list-addnth (lst pos val / lst1 lst2 cnt nverts) 
  (setq cnt 0 
        lst1 '() 
        nverts (length lst) 
  ) 
  (repeat pos 
    (setq lst1 (cons (nth cnt lst) lst1) 
          cnt (1+ cnt) 
    ) 
  ) 
  (setq lst1 (cons val lst1) 
        lst1 (reverse lst1) 
        cnt pos 
  ) 
  (if (> nverts pos) 
    (progn 
      (setq lst2 '()) 
      (repeat (- nverts pos) 
        (setq lst2 (cons (nth cnt lst) lst2) 
              cnt (1+ cnt) 
        ) 
      ) 
      (setq lst2 (reverse lst2) 
            lst1 (append 
                   lst1 
                   lst2 
                 ) 
      ) 
    ) 
  ) 
  lst1 
) 
;;; (th-list-addnth 表 位置 新元素). 在表的第n項位置增增加一元素 
 
;;; ================================================================== 
(defun th-sort< (lst / lst1 len lst2 i n) 
  (setq lst1 (std-remove-duplicates lst)) 
  (setq lst2 (vl-sort lst1 '<)) 
  (setq len (length lst)) 
  (setq i 0) 
  (while (
    (if (> (setq n (std-count (setq el (nth i lst2)) 
                              lst 
                   ) 
           ) 
           1 
        ) 
      (repeat (1- n) 
        (setq lst2 (th-list-addnth lst2 i el)) 
      ) 
    ) 
    (setq i (+ n i)) 
  ) 
  lst2 
) 
;;; ================================================================== 
(defun th-sort> (lst / lst1 len lst2 i n) 
  (setq lst1 (std-remove-duplicates lst)) 
  (setq lst2 (vl-sort lst1 '>)) 
  (setq len (length lst)) 
  (setq i 0) 
  (while (
    (if (> (setq n (std-count (setq el (nth i lst2)) 
                              lst 
                   ) 
           ) 
           1 
        ) 
      (repeat (1- n) 
        (setq lst2 (th-list-addnth lst2 i el)) 
      ) 
    ) 
    (setq i (+ n i)) 
  ) 
  lst2 
) 
;;; ================================================================== 
;;;測試: 
;;;命令: !a (4 6 7 9 3 0 4 3 2 3 5 55 66 99 55 77 0 3 6 4 2 1) 
 
;;;命令: (th-sort< a) 
;;;(0 0 1 2 2 3 3 3 3 4 4 4 5 6 6 7 9 55 55 66 77 99) 
 
;;;命令: (th-sort> a) 
;;;(99 77 66 55 55 9 7 6 6 5 4 4 4 3 3 3 3 2 2 1 0 0) 
  [/FONT]

carrot1983 · 发表于 2007-1-27 17:25:48

修改了一下。把原来相同的数字也考虑进去的排序：
[php]
(defun LI_DelLst (Idx Lst / nlst cnt elem)
 (setq
nlst '()
cnt 1
 )
 (foreach elem lst
(if (/= cnt Idx)
 (setq nlst (cons elem nlst))
)
(setq cnt (1+ cnt))
 )
 (reverse nlst)
)

(defun sortlist (lis / len k abc nn len_nn plis)
 (setq len (length lis))
 (setq k 1)
 (while (<= k len)
(setq abc (eval (append '(max) lis)))
(setq nn 1)
(setq len_nn (length lis))
(while (<= nn len_nn)
 (if (= (nth (1- nn) lis) abc)
(progn
 (setq lis (LI_DelLst nn lis))
 (setq plis (cons abc plis))
)
 )
 (setq nn (1+ nn))
)
(setq k (1+ k))
 )
 (reverse plis)
)
[/php]
运行:
(sortlist '(11 55 44 66 33 22 66 55))
结果:
(66 66 55 55 44 33 22 11)

taner · 发表于 2007-1-28 10:51:32

最初由 carrot1983 发布
[B]修改了一下。把原来相同的数字也考虑进去的排序：
[php]
(defun LI_DelLst (Idx Lst / nlst cnt elem)
  (setq
nlst '()
cnt    1
  )
  (foreach elem lst
(if (/= cnt Idx)
   (setq nlst (... [/B]

再作一點小的改動.

[FONT=courier new]
;;;刪除表中第n個元素,從0開始計數
(defun li_dellst (idx lst / nlst cnt elem)
(setq nlst '()
cnt 0
)
(foreach elem lst
(if (/= cnt idx)
(setq nlst (cons elem nlst))
)
(setq cnt (1+ cnt))
)
(reverse nlst)
)
(defun sortlist> (lis / len k abc n len_n plis)
(setq len (length lis))
(setq k 0)
(while (< k len)
(setq abc (apply
'max
lis
)
)
(setq n 0)
(setq len_n (length lis))
(while (< n len_n)
(if (= (nth n lis) abc)
(progn
(setq lis (li_dellst n lis))
(setq plis (cons abc plis))
)
)
(setq n (1+ n))
)
(setq k (1+ k))
)
(reverse plis)
)
(defun sortlist< (lis / len k abc n len_n plis)
(setq len (length lis))
(setq k 0)
(while (< k len)
(setq abc (apply
'min
lis
)
)
(setq n 0)
(setq len_n (length lis))
(while (< n len_n)
(if (= (nth n lis) abc)
(progn
(setq lis (li_dellst n lis))
(setq plis (cons abc plis))
)
)
(setq n (1+ n))
)
(setq k (1+ k))
)
(reverse plis)
)
;;;命令: !a
;;;(4 6 7 9 3 0 4 3 2 3 5 55 66 99 55 77 0 3 6 4 2 1)
;;;命令: (sortlist> a)
;;;(99 77 66 55 55 9 7 6 6 5 4 4 4 3 3 3 3 2 2 1 0 0)
;;;命令: (sortlist< a)
;;;(0 0 1 2 2 3 3 3 3 4 4 4 5 6 6 7 9 55 55 66 77 99)
[/FONT]

[FONT=courier new] 
;;;刪除表中第n個元素,從0開始計數 
(defun li_dellst (idx lst / nlst cnt elem) 
  (setq nlst '() 
        cnt 0 
  ) 
  (foreach elem lst 
    (if (/= cnt idx) 
      (setq nlst (cons elem nlst)) 
    ) 
    (setq cnt (1+ cnt)) 
  ) 
  (reverse nlst) 
) 
(defun sortlist> (lis / len k abc n len_n plis) 
  (setq len (length lis)) 
  (setq k 0) 
  (while (< k len) 
    (setq abc (apply 
                'max 
                lis 
              ) 
    ) 
    (setq n 0) 
    (setq len_n (length lis)) 
    (while (< n len_n) 
      (if (= (nth n lis) abc) 
        (progn 
          (setq lis (li_dellst n lis)) 
          (setq plis (cons abc plis)) 
        ) 
      ) 
      (setq n (1+ n)) 
    ) 
    (setq k (1+ k)) 
  ) 
  (reverse plis) 
) 
(defun sortlist< (lis / len k abc n len_n plis) 
  (setq len (length lis)) 
  (setq k 0) 
  (while (< k len) 
    (setq abc (apply 
                'min 
                lis 
              ) 
    ) 
    (setq n 0) 
    (setq len_n (length lis)) 
    (while (< n len_n) 
      (if (= (nth n lis) abc) 
        (progn 
          (setq lis (li_dellst n lis)) 
          (setq plis (cons abc plis)) 
        ) 
      ) 
      (setq n (1+ n)) 
    ) 
    (setq k (1+ k)) 
  ) 
  (reverse plis) 
) 
;;;命令: !a 
;;;(4 6 7 9 3 0 4 3 2 3 5 55 66 99 55 77 0 3 6 4 2 1) 
 
;;;命令: (sortlist> a) 
;;;(99 77 66 55 55 9 7 6 6 5 4 4 4 3 3 3 3 2 2 1 0 0) 
 
;;;命令: (sortlist< a) 
;;;(0 0 1 2 2 3 3 3 3 4 4 4 5 6 6 7 9 55 55 66 77 99) 
 
  [/FONT]

雨箭风刀 · 发表于 2007-1-29 01:24:04

运行:
(sortlist '(11 55 44 66 33 22 66 55))
结果:
(66 66 55 55 44 33 22 11)

;;
(defun tt (lst)
(mapcar '(lambda(x)(nth x lst))(vl-sort-i lst '>))
)
(tt '(11 55 44 66 33 22 66 55)) ->(66 66 55 55 44 33 22 11)

taner · 发表于 2007-1-29 07:56:23

還是VLISP強!要好好學習VLISP啊!不過,在用純LISP達到這些功能時,對我們菜鳥學習編程還是蠻有幫助的.

zml84 · 发表于 2007-1-29 08:39:00

最初由 mhy007 发布
[B]就看大家要用于什么目的,我要的是找出一个数据列表里面的一个最小值或最大值,因此zm184的方法对于我的要求最简洁，欣然采纳之。而其他各位朋友的方法也都很不错，收藏起来慢慢消化。谢谢各位！ [/B]

若是需求是找最大值、最小值的话，则不必先对表进行排序操作。
直接调用max、min两各函数即可。实例如下：
[PHP]
(setq a '(11 55 44 66 33 22 66 55)
b (apply 'max a)
c (apply 'min a)
)
[/PHP]
另：对于vLISP的态度，亦不必一味或依赖。
能以纯ALISP从底层实现是好的，但使用vLISP提供的函数也未尝不可。
因为LISP语言的精髓便是函数调用和递归。

845245015 · 发表于 2020-1-9 15:47:12

学习学习学习学习学习学习学习学习学习学习学习学习学习学习学习学习学习学习学习学习学习学习学习学习学习学习学习学习学习学习

账号		自动登录	找回密码
密码			立即注册

[求助] [求助]：请问有没有对数据列表排序的函数?

马上注册，结交更多好友，享用更多功能，让你轻松玩转社区。

相关帖子