syphonx-core
Version:
SyphonX is a template-driven solution for extracting data from HTML in a highly efficient way. It combines the power of jQuery, Regular Expressions, and Javascript into a declarative template-driven format that extracts and reshapes HTML data into JSON.
89 lines • 4.92 kB
JavaScript
;
var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
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) : adopt(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 (g && (g = 0, op[0] && (_ = 0)), _) 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 };
}
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.attempt = void 0;
var index_js_1 = require("./index.js");
function attempt(onTry, onBeforeRetry, options) {
return __awaiter(this, void 0, void 0, function () {
var _a, _b, retries, _c, retryDelay, _d, rethrow, _e, quiet, retry, result, error_1, seconds;
return __generator(this, function (_f) {
switch (_f.label) {
case 0:
_a = options || {}, _b = _a.retries, retries = _b === void 0 ? 2 : _b, _c = _a.retryDelay, retryDelay = _c === void 0 ? [1, 10, 30] : _c, _d = _a.rethrow, rethrow = _d === void 0 ? true : _d, _e = _a.quiet, quiet = _e === void 0 ? false : _e;
if (!onBeforeRetry)
onBeforeRetry = function () { return true; };
retry = 0;
_f.label = 1;
case 1:
if (!true) return [3, 9];
_f.label = 2;
case 2:
_f.trys.push([2, 4, , 8]);
return [4, onTry()];
case 3:
result = _f.sent();
return [2, { result: result }];
case 4:
error_1 = _f.sent();
if (!(++retry <= retries && onBeforeRetry(error_1))) return [3, 6];
if (!quiet)
console.warn("".concat(error_1 instanceof Error ? error_1.message : JSON.stringify(error_1)));
seconds = retryDelay[retry - 1] || retryDelay[retryDelay.length - 1];
if (!quiet)
console.log("RETRY #".concat(retry, "/").concat(retries, " sleeping for ").concat(seconds, " seconds..."));
return [4, (0, index_js_1.sleep)(seconds * 1000)];
case 5:
_f.sent();
return [3, 7];
case 6:
if (rethrow) {
throw error_1;
}
else {
return [2, { error: error_1 }];
}
_f.label = 7;
case 7: return [3, 8];
case 8: return [3, 1];
case 9: return [2];
}
});
});
}
exports.attempt = attempt;
//# sourceMappingURL=attempt.js.map