2
0

queue.489ba23e.js 1.1 KB

12
  1. "use strict";(self["webpackChunkludash"]=self["webpackChunkludash"]||[]).push([[618],{2021:function(n,e,u){u.r(e),u.d(e,{default:function(){return o}});var t=u(3396),s=u(4870),a=u(8472),l=u(5017);const d=(0,t._)("p",{class:"demo"},"DEMO",-1);var i={__name:"queue",setup(n){const e=(0,s.iH)('import { Queue, nextTick } from "ludash";\n\nconst q = new Queue();\n\nfor (let index = 0; index < 10; index++) {\n q.append({\n async run() {\n await nextTick(1000)\n // 如果return false,队列则会暂停\n // 直到下一次调用startRun才会重新开始\n return true\n },\n });\n}\n\n// finished | stopped\nconst status = await q.startRun();\nconsole.log(status === "finished")');return(n,u)=>((0,t.wg)(),(0,t.iD)("div",null,[(0,t.Wm)(a.Z,{title:"Queue",desc:"这个函数用于创建一个promise队列,并按加入顺序执行"},{default:(0,t.w5)((()=>[d,(0,t.Wm)((0,s.SU)(l.Z1),{modelValue:e.value,"onUpdate:modelValue":u[0]||(u[0]=n=>e.value=n),disabled:!0},null,8,["modelValue"])])),_:1})]))}};const r=i;var o=r}}]);
  2. //# sourceMappingURL=queue.489ba23e.js.map