ts-hashlife
Version:
Efficient TypeScript implementation of HashLife, an optimized algorithm for simulating Conway's Game of Life with memoization and quadtree-based compression.
25 lines • 998 B
JavaScript
;
var __importDefault = (this && this.__importDefault) || function (mod) {
return (mod && mod.__esModule) ? mod : { "default": mod };
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.HashLife = exports.EventBus = void 0;
const life_universe_1 = require("./life-universe");
const draw_1 = require("./draw");
const formats_1 = require("./formats");
const macrocell_1 = require("./macrocell");
const event_bus_1 = __importDefault(require("./event-bus"));
exports.EventBus = event_bus_1.default;
const hash_life_1 = __importDefault(require("./hash-life"));
exports.HashLife = hash_life_1.default;
const HashLife = {
EventBus: event_bus_1.default,
Game: hash_life_1.default,
LifeUniverse: life_universe_1.LifeUniverse,
TreeNode: life_universe_1.TreeNode,
LifeCanvasDrawer: draw_1.LifeCanvasDrawer,
formats: formats_1.formats,
load_macrocell: macrocell_1.load_macrocell,
};
exports.default = HashLife;
//# sourceMappingURL=index.js.map