Different Duff's device and normal loop test


/*
* This is a test to check the performance of different Duff's device and normal loop
*/
var myArray = new Array(1000033);
var myArray1 = new Array(1000033);
var myArray2 = new Array(1000033);

// Jeff Greenberg's implementation of Duff's device
function jeffDuff(){
var iterations = Math.ceil(myArray.length / 8),
startAt = myArray.length % 8,
i = 0;

do {
switch(startAt){
case 0: myArray[i++] = i;
case 7: myArray[i++] = i;
case 6: myArray[i++] = i;
case 5: myArray[i++] = i;
case 4: myArray[i++] = i;
case 3: myArray[i++] = i;
case 2: myArray[i++] = i;
case 1: myArray[i++] = i;
}
startAt = 0;
} while (--iterations > 0);
}

// Andrew B. King's implementation of Duff's device
function kingDuff(){
var iterations = Math.floor(myArray1.length / 8),
leftover = myArray1.length % 8,
i = 0;

if (leftover > 0){
do {
myArray1[i++] = i;
} while (--leftover > 0);
}

do {
myArray1[i++] = i;
myArray1[i++] = i;
myArray1[i++] = i;
myArray1[i++] = i;
myArray1[i++] = i;
myArray1[i++] = i;
myArray1[i++] = i;
myArray1[i++] = i;
} while (--iterations > 0);
}

// normal loop
function normalLoop(){
for(var i=0, len=myArray2.length;i<len;i++){
myArray2[i++] = i;
}
}

console.time("normalLoop");
normalLoop();
console.timeEnd("normalLoop");

console.time("kingDuff");
kingDuff();
console.timeEnd("kingDuff");

console.time("jeffDuff");
jeffDuff();
console.timeEnd("jeffDuff");

// release memory
myArray = null;
myArray1 = null;
myArray2 = null;
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值