promise的实现原理
https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/description/ 无重复字符的最长子串
实现 Array.prototype.Map 实现 add(1)(2)(3).sum() 实现
const request = createRequest({pool: 3});
for(let i = 0; i < 10; i++) {
request('/test/url').then(() => console.log(i));
}