Test #2 Title *
Async
Code *
var __awaiter = (this && this .__awaiter ) || function (thisArg, _arguments, P, generator ) {
return new (P || (P = Promise ))(function (resolve, reject ) {
function fulfilled (value ) { try { step (generator.next (value)); } catch (e) { reject (e); } }
function rejected (value ) { try { step (generator["throw" ](value)); } catch (e) { reject (e); } }
function step (result ) { result.done ? resolve (result.value ) : new P (function (resolve ) { resolve (result.value ); }).then (fulfilled, rejected); }
step ((generator = generator.apply (thisArg, _arguments || [])).next ());
});
};
var __generator = (this && this .__generator ) || function (thisArg, body ) {
var _ = { label : 0 , sent : function ( ) { if (t[0 ] & 1 ) throw t[1 ]; return t[1 ]; }, trys : [], ops : [] }, f, y, t, g;
return g = { next : verb (0 ), "throw" : verb (1 ), "return" : verb (2 ) }, typeof Symbol === "function" && (g[Symbol .iterator ] = function ( ) { return this ; }), g;
function verb (n ) { return function (v ) { return step ([n, v]); }; }
function step (op ) {
if (f) throw new TypeError ("Generator is already executing." );
while (_) try {
if (f = 1 , y && (t = op[0 ] & 2 ? y["return" ] : op[0 ] ? y["throw" ] || ((t = y["return" ]) && t.call (y), 0 ) : y.next ) && !(t = t.call (y, op[1 ])).done ) return t;
if (y = 0 , t) op = [op[0 ] & 2 , t.value ];
switch (op[0 ]) {
case 0 : case 1 : t = op; break ;
case 4 : _.label ++; return { value : op[1 ], done : false };
case 5 : _.label ++; y = op[1 ]; op = [0 ]; continue ;
case 7 : op = _.ops .pop (); _.trys .pop (); continue ;
default :
if (!(t = _.trys , t = t.length > 0 && t[t.length - 1 ]) && (op[0 ] === 6 || op[0 ] === 2 )) { _ = 0 ; continue ; }
if (op[0 ] === 3 && (!t || (op[1 ] > t[0 ] && op[1 ] < t[3 ]))) { _.label = op[1 ]; break ; }
if (op[0 ] === 6 && _.label < t[1 ]) { _.label = t[1 ]; t = op; break ; }
if (t && _.label < t[2 ]) { _.label = t[2 ]; _.ops .push (op); break ; }
if (t[2 ]) _.ops .pop ();
_.trys .pop (); continue ;
}
op = body.call (thisArg, _);
} catch (e) { op = [6 , e]; y = 0 ; } finally { f = t = 0 ; }
if (op[0 ] & 5 ) throw op[1 ]; return { value : op[0 ] ? op[1 ] : void 0 , done : true };
}
};
var _this = this ;
var b = function ( ) { return new Promise (function (resolve, reject ) {
resolve (1 );
}); };
var a = function ( ) { return __awaiter (_this, void 0 , void 0 , function ( ) {
return __generator (this , function (_a ) {
switch (_a.label ) {
case 0 : return [4 , b ()];
case 1 :
_a.sent ();
deferred.resolve ();
return [2 ];
}
});
}); };
a ()
Title *
Async
Code *
"use strict" ;
function asyncGeneratorStep (gen, resolve, reject, _next, _throw, key, arg ) { try { var info = gen[key](arg); var value = info.value ; } catch (error) { reject (error); return ; } if (info.done ) { resolve (value); } else { Promise .resolve (value).then (_next, _throw); } }
function _asyncToGenerator (fn ) { return function ( ) { var self = this , args = arguments ; return new Promise (function (resolve, reject ) { var gen = fn.apply (self, args); function _next (value ) { asyncGeneratorStep (gen, resolve, reject, _next, _throw, "next" , value); } function _throw (err ) { asyncGeneratorStep (gen, resolve, reject, _next, _throw, "throw" , err); } _next (undefined ); }); }; }
var b = function b ( ) {
return new Promise (function (resolve, reject ) {
resolve (1 );
});
};
var a =
function ( ) {
var _ref = _asyncToGenerator (
regeneratorRuntime.mark (function _callee ( ) {
return regeneratorRuntime.wrap (function _callee$ (_context ) {
while (1 ) {
switch (_context.prev = _context.next ) {
case 0 :
_context.next = 2 ;
return b ();
case 2 :
deferred.resolve ();
case 3 :
case "end" :
return _context.stop ();
}
}
}, _callee, this );
}));
return function a ( ) {
return _ref.apply (this , arguments );
};
}();
a ();