使用javascript模拟并行位全加法器

解析：

const A = [1, 0, 0, 1]; const B = [1, 1, 0, 1]; function plus (a, b) { let GList = [], PList = [], res = []; while(a.length) { let ai = a.pop() let bi = b.pop() let Gi = ai && bi; let Pi = ai ^ bi; let worker = new Worker('./worker.js') worker.postMessage({GList, PList}) worker.onmessage = (event) => { let ci = event.data; let si = Pi ^ ci; res.unshift(si) } GList.unshift(Gi) PList.unshift(Pi) } let worker = new Worker('./worker.js') worker.postMessage({GList, PList}) worker.onmessage = (event) => { res.unshift(event.data) console.log(res) return res; } } plus(A, B) 以上 main.js self.addEventListener('message', function (e) { let GList = e.data.GListlet PList = e.data.PListlet ci = 0; while(GList.length) { let gi = GList.pop() let pi = PList.pop() ci = gi || pi && ci; } self.postMessage(ci) self.close() }, false) 以上worker.js

---

1.本站遵循行业规范，任何转载的稿件都会明确标注作者和来源；2.本站的原创文章，会注明原创字样,如未注明都非原创，如有侵权请联系删除！；3.作者投稿可能会经我们编辑修改或补充；4.本站不提供任何储存功能只提供收集或者投稿人的网盘链接。