genetic-search-multiprocess/lib/strategies.js

Multiprocessing genetic algorithm implementation library extension

"use strict";
var __extends = (this && this.__extends) || (function () {
    var extendStatics = function (d, b) {
        extendStatics = Object.setPrototypeOf ||
            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
        return extendStatics(d, b);
    };
    return function (d, b) {
        if (typeof b !== "function" && b !== null)
            throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
        extendStatics(d, b);
        function __() { this.constructor = d; }
        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
    };
})();
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 = Object.create((typeof Iterator === "function" ? Iterator : Object).prototype);
    return g.next = verb(0), g["throw"] = verb(1), g["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.BaseMultiprocessingPhenomeStrategy = void 0;
var multiprocessor_1 = require("multiprocessor");
var genetic_search_1 = require("genetic-search");
/**
 * Base class for phenome strategies that uses multiprocessing to execute phenome calculation tasks.
 *
 * @template TGenome - The type of the genome.
 * @template TConfig - The type of the configuration for the phenome strategy.
 * @template TTaskConfig - The type of the configuration for each phenome calculation task.
 *
 * @category Strategies
 */
var BaseMultiprocessingPhenomeStrategy = /** @class */ (function (_super) {
    __extends(BaseMultiprocessingPhenomeStrategy, _super);
    function BaseMultiprocessingPhenomeStrategy() {
        return _super !== null && _super.apply(this, arguments) || this;
    }
    /**
     * Execute the phenome calculation tasks.
     *
     * @param inputs The inputs to the phenome calculation tasks.
     * @returns A matrix of phenome results, where each row corresponds to a single genome.
     */
    BaseMultiprocessingPhenomeStrategy.prototype.execTasks = function (inputs) {
        return __awaiter(this, void 0, void 0, function () {
            var pool, result;
            var _this = this;
            return __generator(this, function (_a) {
                switch (_a.label) {
                    case 0:
                        pool = new multiprocessor_1.Pool(this.config.poolSize);
                        return [4 /*yield*/, pool.map(inputs, this.config.task, { onTaskSuccess: function (result, input) { var _a, _b; return (_b = (_a = _this.config).onTaskResult) === null || _b === void 0 ? void 0 : _b.call(_a, result, input); } })];
                    case 1:
                        result = _a.sent();
                        pool.close();
                        return [2 /*return*/, result];
                }
            });
        });
    };
    return BaseMultiprocessingPhenomeStrategy;
}(genetic_search_1.BasePhenomeStrategy));
exports.BaseMultiprocessingPhenomeStrategy = BaseMultiprocessingPhenomeStrategy;
//# sourceMappingURL=strategies.js.map