UNPKG

@tensorflow/tfjs-core

Version:

Hardware-accelerated JavaScript library for machine intelligence

93 lines 4.61 kB
"use strict"; var __assign = (this && this.__assign) || Object.assign || function(t) { for (var s, i = 1, n = arguments.length; i < n; i++) { s = arguments[i]; for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p]; } return t; }; 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 }; } }; Object.defineProperty(exports, "__esModule", { value: true }); var PassthroughLoader = (function () { function PassthroughLoader(modelTopology, weightSpecs, weightData) { this.modelTopology = modelTopology; this.weightSpecs = weightSpecs; this.weightData = weightData; } PassthroughLoader.prototype.load = function () { return __awaiter(this, void 0, void 0, function () { var result; return __generator(this, function (_a) { result = {}; if (this.modelTopology != null) { result = __assign({ modelTopology: this.modelTopology }, result); } if (this.weightSpecs != null && this.weightSpecs.length > 0) { result = __assign({ weightSpecs: this.weightSpecs }, result); } if (this.weightData != null && this.weightData.byteLength > 0) { result = __assign({ weightData: this.weightData }, result); } return [2, result]; }); }); }; return PassthroughLoader; }()); var PassthroughSaver = (function () { function PassthroughSaver(saveHandler) { this.saveHandler = saveHandler; } PassthroughSaver.prototype.save = function (modelArtifacts) { return __awaiter(this, void 0, void 0, function () { return __generator(this, function (_a) { return [2, this.saveHandler(modelArtifacts)]; }); }); }; return PassthroughSaver; }()); function fromMemory(modelTopology, weightSpecs, weightData) { return new PassthroughLoader(modelTopology, weightSpecs, weightData); } exports.fromMemory = fromMemory; function withSaveHandler(saveHandler) { return new PassthroughSaver(saveHandler); } exports.withSaveHandler = withSaveHandler; //# sourceMappingURL=passthrough.js.map