genetic-search
Version:
Multiprocessing genetic algorithm implementation library
266 lines • 10.3 kB
JavaScript
"use strict";
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 };
}
};
var __read = (this && this.__read) || function (o, n) {
var m = typeof Symbol === "function" && o[Symbol.iterator];
if (!m) return o;
var i = m.call(o), r, ar = [], e;
try {
while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
}
catch (error) { e = { error: error }; }
finally {
try {
if (r && !r.done && (m = i["return"])) m.call(i);
}
finally { if (e) throw e.error; }
}
return ar;
};
var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
if (ar || !(i in from)) {
if (!ar) ar = Array.prototype.slice.call(from, 0, i);
ar[i] = from[i];
}
}
return to.concat(ar || Array.prototype.slice.call(from));
};
var __values = (this && this.__values) || function(o) {
var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
if (m) return m.call(o);
if (o && typeof o.length === "number") return {
next: function () {
if (o && i >= o.length) o = void 0;
return { value: o && o[i++], done: !o };
}
};
throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.sort = sort;
exports.repeat = repeat;
exports.zip = zip;
exports.distinctBy = distinctBy;
/**
* Sorts an iterable of values based on a custom comparator.
*
* @template T - The type of the iterable to be sorted.
* @param data - The iterable to be sorted.
* @param comparator - The comparator function to be used for sorting.
* @returns An iterable of the sorted values.
*
* @example
* const numbers = [1, 2, 3];
* const sorted = sort(numbers, (lhs, rhs) => lhs - rhs);
* for (const number of sorted) {
* console.log(number);
* }
* // Prints 1, 2, 3
*
* @category IterTools
*/
function sort(data, comparator) {
var result, result_1, result_1_1, datum, e_1_1;
var e_1, _a;
return __generator(this, function (_b) {
switch (_b.label) {
case 0:
result = __spreadArray([], __read(data), false);
result.sort(comparator);
_b.label = 1;
case 1:
_b.trys.push([1, 6, 7, 8]);
result_1 = __values(result), result_1_1 = result_1.next();
_b.label = 2;
case 2:
if (!!result_1_1.done) return [3 /*break*/, 5];
datum = result_1_1.value;
return [4 /*yield*/, datum];
case 3:
_b.sent();
_b.label = 4;
case 4:
result_1_1 = result_1.next();
return [3 /*break*/, 2];
case 5: return [3 /*break*/, 8];
case 6:
e_1_1 = _b.sent();
e_1 = { error: e_1_1 };
return [3 /*break*/, 8];
case 7:
try {
if (result_1_1 && !result_1_1.done && (_a = result_1.return)) _a.call(result_1);
}
finally { if (e_1) throw e_1.error; }
return [7 /*endfinally*/];
case 8: return [2 /*return*/];
}
});
}
/**
* Repeats the given item the specified number of times.
*
* @template T - The type of the item to be repeated.
* @param item - The item to be repeated.
* @param repetitions - The number of times to repeat the item.
* @returns An iterable of the repeated items.
*
* @category IterTools
*/
function repeat(item, repetitions) {
var i;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
i = repetitions;
_a.label = 1;
case 1:
if (!(i > 0)) return [3 /*break*/, 4];
return [4 /*yield*/, item];
case 2:
_a.sent();
_a.label = 3;
case 3:
--i;
return [3 /*break*/, 1];
case 4: return [2 /*return*/];
}
});
}
/**
* Combines multiple iterables into a single iterable of tuples. Each tuple
* contains the elements from the input iterables at the same position.
*
* @template T - An array of iterables to be zipped together.
* @param iterables - The iterables to be zipped.
* @returns An iterable of tuples, where each tuple contains elements from
* each of the input iterables at the corresponding position.
*
* @example
* const numbers = [1, 2, 3];
* const letters = ['a', 'b', 'c'];
* for (const pair of zip(numbers, letters)) {
* console.log(pair); // Logs: [1, 'a'], [2, 'b'], [3, 'c']
* }
*
* @category IterTools
*/
function zip() {
var _i, iterators, tuple, iterators_1, iterators_1_1, iterator, next;
var e_2, _a;
var iterables = [];
for (_i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __generator(this, function (_b) {
switch (_b.label) {
case 0:
iterators = iterables.map(function (iterable) { return iterable[Symbol.iterator](); });
_b.label = 1;
case 1:
if (!true) return [3 /*break*/, 3];
tuple = [];
try {
for (iterators_1 = (e_2 = void 0, __values(iterators)), iterators_1_1 = iterators_1.next(); !iterators_1_1.done; iterators_1_1 = iterators_1.next()) {
iterator = iterators_1_1.value;
next = iterator.next();
if (next.done) {
return [3 /*break*/, 3];
}
tuple.push(next.value);
}
}
catch (e_2_1) { e_2 = { error: e_2_1 }; }
finally {
try {
if (iterators_1_1 && !iterators_1_1.done && (_a = iterators_1.return)) _a.call(iterators_1);
}
finally { if (e_2) throw e_2.error; }
}
return [4 /*yield*/, tuple];
case 2:
_b.sent();
return [3 /*break*/, 1];
case 3: return [2 /*return*/];
}
});
}
/**
* Returns an iterable of unique elements from the input data, where uniqueness
* is determined by the value returned from the provided `compareBy` function.
*
* @template T - The type of elements in the input data.
* @param data - The input iterable containing elements to be filtered for uniqueness.
* @param compareBy - A function that takes an element from the input data and
* returns a comparable value to determine uniqueness.
* @returns An iterable of unique elements from the input data.
*
* @category IterTools
*/
function distinctBy(data, compareBy) {
var used, data_1, data_1_1, datum, comparable, e_3_1;
var e_3, _a;
return __generator(this, function (_b) {
switch (_b.label) {
case 0:
used = new Set();
_b.label = 1;
case 1:
_b.trys.push([1, 6, 7, 8]);
data_1 = __values(data), data_1_1 = data_1.next();
_b.label = 2;
case 2:
if (!!data_1_1.done) return [3 /*break*/, 5];
datum = data_1_1.value;
comparable = compareBy(datum);
if (!!used.has(comparable)) return [3 /*break*/, 4];
return [4 /*yield*/, datum];
case 3:
_b.sent();
used.add(comparable);
_b.label = 4;
case 4:
data_1_1 = data_1.next();
return [3 /*break*/, 2];
case 5: return [3 /*break*/, 8];
case 6:
e_3_1 = _b.sent();
e_3 = { error: e_3_1 };
return [3 /*break*/, 8];
case 7:
try {
if (data_1_1 && !data_1_1.done && (_a = data_1.return)) _a.call(data_1);
}
finally { if (e_3) throw e_3.error; }
return [7 /*endfinally*/];
case 8: return [2 /*return*/];
}
});
}
//# sourceMappingURL=itertools.js.map