"use strict";
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 (_) 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.WordEmbeddingsManager = void 0;
/* eslint-disable @typescript-eslint/unbound-method */
var tfjs_node_1 = require("@tensorflow/tfjs-node");
var wembeddings_db_helper_1 = require("./wembeddings-db-helper");
var WordEmbeddingsManager = /** @class */ (function () {
    function WordEmbeddingsManager(matrix) {
        this.matrix = matrix;
    }
    // TODO: Change the way word embedding is check to be valid.
    WordEmbeddingsManager.withConfig = function (config) {
        return __awaiter(this, void 0, void 0, function () {
            var dbHelper, maxInitValue, minInitValue, rowsCount, colsCount, matrix, i, j, _i, _a, _b, word, i, embedding;
            return __generator(this, function (_c) {
                switch (_c.label) {
                    case 0:
                        dbHelper = new wembeddings_db_helper_1.WordEmbeddingsDBHelper(config.type, config.dimension, config.language);
                        return [4 /*yield*/, dbHelper.initialize({ logProcess: true })];
                    case 1:
                        _c.sent();
                        maxInitValue = 1;
                        minInitValue = -1;
                        rowsCount = Object.keys(config.vocabulary).length;
                        colsCount = config.dimension;
                        matrix = new Array(rowsCount);
                        for (i = 0; i < rowsCount; i++) {
                            matrix[i] = new Array(colsCount);
                            for (j = 0; j < colsCount; j++) {
                                matrix[i][j] =
                                    Math.random() * (maxInitValue - minInitValue) + minInitValue;
                            }
                        }
                        _i = 0, _a = Object.entries(config.vocabulary);
                        _c.label = 2;
                    case 2:
                        if (!(_i < _a.length)) return [3 /*break*/, 5];
                        _b = _a[_i], word = _b[0], i = _b[1];
                        return [4 /*yield*/, dbHelper.select(word)];
                    case 3:
                        embedding = _c.sent();
                        if (embedding)
                            matrix[i] = embedding.vector;
                        _c.label = 4;
                    case 4:
                        _i++;
                        return [3 /*break*/, 2];
                    case 5: return [2 /*return*/, new WordEmbeddingsManager(tfjs_node_1.tensor(matrix))];
                }
            });
        });
    };
    return WordEmbeddingsManager;
}());
exports.WordEmbeddingsManager = WordEmbeddingsManager;
//# sourceMappingURL=word-embeddings-manager.js.map