让VL-POSITION返回多个索引

st788796 · 发表于 2017-5-15 19:44:49

本帖最后由 newer 于 2017-5-15 19:46 编辑

和黄老的意思一样

(defun vl-position8 (n l / i ll)
(setq i 0)
(foreach x l
(if (eq x n)
(setq ll (cons i ll))
)
(setq i (1+ i))
)
(reverse ll)
)

newer · 发表于 2017-5-15 19:45:15

wowan1314 发表于 2017-5-15 19:28

重启了CAD, 测试了5次

命令: test
Elapsed milliseconds / relative speed for 16384 iteration(s):
(VL-POSITIONS7 1 LST).....1172 / 1.64 <fastest>
(VL-POSITIONS6 1 LST).....1343 / 1.43
(VL-POSITIONS4 1 LST).....1344 / 1.43
(VL-POSITIONS5 1 LST).....1609 / 1.19
(VL-POSITIONS2 1 LST).....1734 / 1.11
(VL-POSITIONS1 1 LST).....1922 / 1 <slowest>
命令:
命令: test
Elapsed milliseconds / relative speed for 16384 iteration(s):
(VL-POSITIONS6 1 LST).....1281 / 1.53 <fastest>
(VL-POSITIONS7 1 LST).....1281 / 1.53
(VL-POSITIONS4 1 LST).....1422 / 1.37
(VL-POSITIONS5 1 LST).....1672 / 1.17
(VL-POSITIONS2 1 LST).....1859 / 1.05
(VL-POSITIONS1 1 LST).....1954 / 1 <slowest>
命令:
命令:
Elapsed milliseconds / relative speed for 16384 iteration(s):
(VL-POSITIONS6 1 LST).....1219 / 1.51 <fastest>
(VL-POSITIONS7 1 LST).....1328 / 1.39
(VL-POSITIONS4 1 LST).....1578 / 1.17
(VL-POSITIONS5 1 LST).....1641 / 1.12
(VL-POSITIONS2 1 LST).....1704 / 1.08
(VL-POSITIONS1 1 LST).....1844 / 1 <slowest>
命令:
命令:
Elapsed milliseconds / relative speed for 16384 iteration(s):
(VL-POSITIONS7 1 LST).....1093 / 1.89 <fastest>
(VL-POSITIONS6 1 LST).....1219 / 1.69
(VL-POSITIONS4 1 LST).....1422 / 1.45
(VL-POSITIONS5 1 LST).....1813 / 1.14
(VL-POSITIONS2 1 LST).....2015 / 1.02
(VL-POSITIONS1 1 LST).....2062 / 1 <slowest>
命令:
命令:
Elapsed milliseconds / relative speed for 16384 iteration(s):
(VL-POSITIONS6 1 LST).....1172 / 1.59 <fastest>
(VL-POSITIONS7 1 LST).....1172 / 1.59
(VL-POSITIONS4 1 LST).....1281 / 1.45
(VL-POSITIONS5 1 LST).....1500 / 1.24
(VL-POSITIONS2 1 LST).....1656 / 1.12
(VL-POSITIONS1 1 LST).....1860 / 1 <slowest>
命令:

复制代码

7---两次第一
6---一次第一
7，6 并列两次第一

总体看，还是7快。

newer · 发表于 2017-5-15 19:55:01

ST的 VL-POSITIONS8加入战团

5次测试结果：

命令: (repeat 5 (c:test))
Elapsed milliseconds / relative speed for 16384 iteration(s):
(VL-POSITIONS7 1 LST).....1031 / 1.74 <fastest>
(VL-POSITIONS6 1 LST).....1047 / 1.72
(VL-POSITIONS8 1 LST).....1078 / 1.67
(VL-POSITIONS4 1 LST).....1421 / 1.26
(VL-POSITIONS5 1 LST).....1453 / 1.24
(VL-POSITIONS2 1 LST).....1656 / 1.09
(VL-POSITIONS1 1 LST).....1797 / 1 <slowest>
Elapsed milliseconds / relative speed for 16384 iteration(s):
(VL-POSITIONS8 1 LST).....1093 / 1.6 <fastest>
(VL-POSITIONS7 1 LST).....1109 / 1.58
(VL-POSITIONS6 1 LST).....1188 / 1.47
(VL-POSITIONS4 1 LST).....1297 / 1.35
(VL-POSITIONS1 1 LST).....1641 / 1.07
(VL-POSITIONS2 1 LST).....1672 / 1.05
(VL-POSITIONS5 1 LST).....1750 / 1 <slowest>
Elapsed milliseconds / relative speed for 16384 iteration(s):
(VL-POSITIONS6 1 LST).....1265 / 1.48 <fastest>
(VL-POSITIONS8 1 LST).....1266 / 1.48
(VL-POSITIONS4 1 LST).....1313 / 1.43
(VL-POSITIONS7 1 LST).....1422 / 1.32
(VL-POSITIONS5 1 LST).....1656 / 1.13
(VL-POSITIONS1 1 LST).....1843 / 1.02
(VL-POSITIONS2 1 LST).....1875 / 1 <slowest>
Elapsed milliseconds / relative speed for 16384 iteration(s):
(VL-POSITIONS8 1 LST).....1125 / 1.89 <fastest>
(VL-POSITIONS7 1 LST).....1281 / 1.66
(VL-POSITIONS5 1 LST).....1687 / 1.26
(VL-POSITIONS1 1 LST).....1734 / 1.23
(VL-POSITIONS6 1 LST).....1969 / 1.08
(VL-POSITIONS2 1 LST).....2032 / 1.05
(VL-POSITIONS4 1 LST).....2125 / 1 <slowest>
Elapsed milliseconds / relative speed for 16384 iteration(s):
(VL-POSITIONS8 1 LST).....1078 / 2.09 <fastest>
(VL-POSITIONS6 1 LST).....1250 / 1.8
(VL-POSITIONS7 1 LST).....1359 / 1.66
(VL-POSITIONS4 1 LST).....1406 / 1.6
(VL-POSITIONS5 1 LST).....1609 / 1.4
(VL-POSITIONS1 1 LST).....2016 / 1.12
(VL-POSITIONS2 1 LST).....2250 / 1 <slowest>

复制代码

8 ---- 三次第一，一次第二，一次第三
7 ----一次第一，二次第二，二次第三
6 ----一次第一，二次第二，一次第三，一次第五

冠军易主， vl-positions8 目前排位第一。

st788796 · 发表于 2017-5-15 20:01:18

前面高飞有过一个测试和讨论。foreach 分区点，这个函数稳定且快速，简单分析下
vl-position --> 依次遍历 -> 找到计数停止，如果加上 member ，前面也是要比较然后截断，
多重 position 最小可能是 n, foreach 方法就是 n , 只是中间多了一个计数和 cons，规矩写法有规矩的优点

/db_自贡黄明儒_ · 发表于 2017-5-15 20:09:53

st788796 发表于 2017-5-15 20:01

分析得很有道理，我还是比较鼓劲foreach。递归是最伤神了

wowan1314 · 发表于 2017-5-15 20:24:05

本帖最后由 wowan1314 于 2017-5-15 20:30 编辑

st788796 发表于 2017-5-15 20:01

意思是能用foreach 就别用mapcar  ??

我也用写了个foreach的（4号代码），怎么老排第四！难道是我用了and 而你用了if  ?

下面是我以前写的！
(defun yy-lst-allpos (at lst / a nlst)
(setq a 0)
(mapcar
      '(lambda(x)
         (if(= x at)(setq nlst(cons a nlst)))(setq a(1+ a))
      )
      lst
)
(reverse nlst)
)

newer · 发表于 2017-5-15 20:32:24

wowan1314 发表于 2017-5-15 20:24

有可能哦
可能汇编的机器码，IF更短，IF就两个分支，而AND可能很多个条件。

st788796 · 发表于 2017-5-15 21:21:55

wowan1314 发表于 2017-5-15 20:24

mapcar 在需要返回表的时候是第一选择，而且 mapcar 的实现应该比 foreach 更复杂，
在 ARX 中 foreach 流程可能是下面这样
int i=0;
vector<int> pos=new vector<int>();
while (!arg)
{
   if (  == )
      pos.push(i);
   i++;
}
return pos;

newer · 发表于 2017-5-15 21:30:35

st788796 发表于 2017-5-15 21:21

更可能是
for (int i=0;i<array.length();i++)
{
type item = array[ i];
....
}

Lispboy · 发表于 2017-5-15 22:40:11

提供一个

(defun vl-positions9 (n l / i j r)
(setq j -1)
(while
(setq i (vl-position n l))
(setq r (cons (setq j (+ 1 i j)) r))
(setq l (cdr (member n l)))
)
(reverse r)
)

newer · 发表于 2017-5-15 22:46:30

Lispboy 发表于 2017-5-15 22:40

9个代码的测试结果

命令: test
Elapsed milliseconds / relative speed for 16384 iteration(s):
(VL-POSITIONS8 1 LST).....1250 / 1.56 <fastest>
(VL-POSITIONS9 1 LST).....1281 / 1.52
(VL-POSITIONS7 1 LST).....1313 / 1.49
(VL-POSITIONS6 1 LST).....1328 / 1.47
(VL-POSITIONS4 1 LST).....1438 / 1.36
(VL-POSITIONS5 1 LST).....1703 / 1.15
(VL-POSITIONS2 1 LST).....1907 / 1.02
(VL-POSITIONS1 1 LST).....1953 / 1 <slowest>

复制代码

kqqt6236 · 发表于 2017-5-16 00:17:40

学习了。

danxingpen · 发表于 2017-5-16 09:03:35

本帖最后由 danxingpen 于 2017-5-16 09:04 编辑

(defun vl-positions10 (l lst / n la ns)
(setq n 0
la (car lst)
)
(if (= la l)
(setq ns (cons n ns))
)
(while (setq lst (cdr lst))
(setq la (car lst)
n (1+ n)
)
(if (= la l)
(setq ns (cons n ns))
)
)
(reverse ns)
)

newer · 发表于 2017-5-16 09:26:00

danxingpen 发表于 2017-5-16 09:03

5次测试结果

命令: (repeat 5 (c:test))
Elapsed milliseconds / relative speed for 16384 iteration(s):
(VL-POSITIONS6 1 LST)......2063 / 1.51 <fastest>
(VL-POSITIONS8 1 LST)......2359 / 1.32
(VL-POSITIONS4 1 LST)......2407 / 1.3
(VL-POSITIONS7 1 LST)......2516 / 1.24
(VL-POSITIONS5 1 LST)......2625 / 1.19
(VL-POSITIONS9 1 LST)......2625 / 1.19
(VL-POSITIONS10 1 LST).....2938 / 1.06
(VL-POSITIONS2 1 LST)......3000 / 1.04
(VL-POSITIONS1 1 LST)......3125 / 1 <slowest>
Elapsed milliseconds / relative speed for 8192 iteration(s):
(VL-POSITIONS8 1 LST)......1031 / 2.18 <fastest>
(VL-POSITIONS9 1 LST)......1047 / 2.15
(VL-POSITIONS10 1 LST).....1109 / 2.03
(VL-POSITIONS7 1 LST)......1219 / 1.85
(VL-POSITIONS4 1 LST)......1359 / 1.66
(VL-POSITIONS6 1 LST)......1375 / 1.64
(VL-POSITIONS2 1 LST)......1859 / 1.21
(VL-POSITIONS1 1 LST)......2062 / 1.09
(VL-POSITIONS5 1 LST)......2250 / 1 <slowest>
Elapsed milliseconds / relative speed for 16384 iteration(s):
(VL-POSITIONS9 1 LST)......2188 / 2 <fastest>
(VL-POSITIONS8 1 LST)......2265 / 1.93
(VL-POSITIONS7 1 LST)......2500 / 1.75
(VL-POSITIONS10 1 LST).....2531 / 1.73
(VL-POSITIONS6 1 LST)......2875 / 1.52
(VL-POSITIONS4 1 LST)......2953 / 1.48
(VL-POSITIONS5 1 LST)......3297 / 1.33
(VL-POSITIONS1 1 LST)......3609 / 1.21
(VL-POSITIONS2 1 LST)......4375 / 1 <slowest>
Elapsed milliseconds / relative speed for 8192 iteration(s):
(VL-POSITIONS9 1 LST)......1172 / 1.33 <fastest>
(VL-POSITIONS6 1 LST)......1234 / 1.27
(VL-POSITIONS4 1 LST)......1250 / 1.25
(VL-POSITIONS7 1 LST)......1281 / 1.22
(VL-POSITIONS8 1 LST)......1328 / 1.18
(VL-POSITIONS1 1 LST)......1391 / 1.12
(VL-POSITIONS10 1 LST).....1468 / 1.06
(VL-POSITIONS2 1 LST)......1531 / 1.02
(VL-POSITIONS5 1 LST)......1563 / 1 <slowest>
Elapsed milliseconds / relative speed for 16384 iteration(s):
(VL-POSITIONS7 1 LST)......2031 / 1.78 <fastest>
(VL-POSITIONS8 1 LST)......2047 / 1.77
(VL-POSITIONS4 1 LST)......2281 / 1.59
(VL-POSITIONS9 1 LST)......2297 / 1.58
(VL-POSITIONS6 1 LST)......2422 / 1.5
(VL-POSITIONS10 1 LST).....2656 / 1.36
(VL-POSITIONS5 1 LST)......3110 / 1.17
(VL-POSITIONS2 1 LST)......3296 / 1.1
(VL-POSITIONS1 1 LST)......3625 / 1 <slowest>

复制代码

aimisiyou · 发表于 2017-5-16 14:20:25

本帖最后由 aimisiyou 于 2017-5-16 16:07 编辑

(defun vl-position11 (a lst)
  (setq i -1)
  (setq flst (vl-remove 0
                     (mapcar '*
                              (mapcar '(lambda (x) (if (= a x) 1 0)) lst)
                              (mapcar '(lambda (y) (setq i (+ i 1))) lst)
                     )
            )
)
(if (= a (car lst))  (setq flst (cons 0 flst)))
flst
)

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

[有奖答题] 让VL-POSITION返回多个索引

评分

评分

评分