sudoku-solve/dist/Twin.js

Konni's Sudoku solving library

"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
exports.Twin = void 0;
const NumberArray_1 = require("./NumberArray");
class Twin {
    constructor(number1, number2) {
        this.number1 = number1;
        this.number2 = number2;
        this.values = number1.value.slice();
    }
    static find(group) {
        const twins = [];
        for (let i1 = 0; i1 < 8; i1++) {
            for (let i2 = i1 + 1; i2 < 9; i2++) {
                const n1 = group.numbers[i1];
                const n2 = group.numbers[i2];
                if (n1.value.length === 2 && n2.value.length === 2 &&
                    NumberArray_1.NumberArray.isEqual(n1.value, n2.value)) {
                    twins.push(new Twin(n1, n2));
                }
            }
        }
        return twins;
    }
    toSimpleString() {
        return `${this.number1.value}-${this.number2.value}`;
    }
}
exports.Twin = Twin;