Welcome to OGeek Q&A Community for programmer and developer-Open, Learning and Share
Welcome To Ask or Share your Answers For Others

Categories

0 votes
123 views
in Technique[技术] by (71.8m points)

一个promise面试题

有一个数组,里面都是promise的实例。代码实现如下要求:每次执行数组里的前n个实例,在这n个promise实例执行完后(即这n个promise的状态都是Fulfilled或Rejected)再开始下次n个实例执行,直到数组里的实例都被执行完


与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
Welcome To Ask or Share your Answers For Others

1 Reply

0 votes
by (71.8m points)
(function (){
    let data=[1,2,3,4,5,6,7,8,9];
    let n=4;
    function executePromiseGroup(dataList,groupSize){
        let _dataList_ = [...dataList];
        let finalResultData = [];
        return new Promise((resolve,reject)=>{
            let groupIndex = 0; 
            let _next_ = (groupIndex)=>{
                let _promise_all_data_ = _dataList_.splice(0,groupSize);
                if(_promise_all_data_.length===0){
                    resolve(finalResultData);
                    return;    
                }
                Promise.all(_promise_all_data_.map((data)=>{
                        return new Promise((resolve,reject)=>{
                            setTimeout(()=>{
                                 if(data === 4){
                                    resolve('模拟异步请求发生错误啦:'+data);
                                 }else{
                                    resolve('group_index:'+groupIndex+'>>'+data);
                                 }                           
                            },100);
                            //此处处理异步请求,在此处catch异步异常情况,然后resolve
                        });
                })).then((resultDataList)=>{
                    finalResultData = finalResultData.concat(resultDataList);
                    _next_(++groupIndex);
                });
            }

            _next_(groupIndex);
        });

    }
    executePromiseGroup(data,n).then((data)=>{
        console.log(data);
    })
}());

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
OGeek|极客中国-欢迎来到极客的世界,一个免费开放的程序员编程交流平台!开放,进步,分享!让技术改变生活,让极客改变未来! Welcome to OGeek Q&A Community for programmer and developer-Open, Learning and Share
Click Here to Ask a Question

...