SPB Git

Repository Public License

PatternLockEngineTests.swift 3.5 KB 66 lines swift

1// ORIX Alarm2// File: Packages/AlarmCore/Tests/AlarmCoreTests/PatternLockEngineTests.swift3// Description: Pattern Lock engine tests: determinism, distinct nodes, legal moves, lengths by level and validation.4//5// Author: Simon-Pierre Boucher6// Contact: contact@spboucher.ai7import XCTest8@testable import AlarmCore910final class PatternLockEngineTests: XCTestCase {11    func testDeterministic() {12        for level in 1...4 {13            for round in 0..<10 {14                XCTAssertEqual(PatternLockEngine.generate(level: level, round: round, seed: 77), PatternLockEngine.generate(level: level, round: round, seed: 77))15            }16        }17        XCTAssertNotEqual((0..<6).map { PatternLockEngine.generate(level: 3, round: $0, seed: 1).path },18                          (0..<6).map { PatternLockEngine.generate(level: 3, round: $0, seed: 2).path })19    }2021    func testLegalMoves() {22        XCTAssertTrue(PatternLockEngine.isLegalMove(from: 0, to: 1, size: 3))23        XCTAssertTrue(PatternLockEngine.isLegalMove(from: 0, to: 4, size: 3))24        XCTAssertFalse(PatternLockEngine.isLegalMove(from: 0, to: 2, size: 3), "cannot jump over a node")25        XCTAssertFalse(PatternLockEngine.isLegalMove(from: 2, to: 3, size: 3), "row ends are not neighbours")26        XCTAssertFalse(PatternLockEngine.isLegalMove(from: 4, to: 4, size: 3))27        XCTAssertFalse(PatternLockEngine.isLegalMove(from: 0, to: 9, size: 3))28        XCTAssertEqual(PatternLockEngine.neighbours(of: 4, size: 3).count, 8)29        XCTAssertEqual(PatternLockEngine.neighbours(of: 0, size: 4), [1, 4, 5])30    }3132    func testValidityOverManyPuzzles() {33        for level in 1...4 {34            for i in 0..<2_500 {35                let round = i % 1036                let puzzle = PatternLockEngine.generate(level: level, round: round, seed: UInt64(i) &* 15_485_863)37                XCTAssertEqual(puzzle.size, level <= 2 ? 3 : 4)38                XCTAssertEqual(puzzle.path.count, PatternLockEngine.pathLength(level: level, round: round))39                XCTAssertGreaterThanOrEqual(puzzle.path.count, 4)40                XCTAssertLessThan(puzzle.path.count, puzzle.size * puzzle.size)41                XCTAssertEqual(Set(puzzle.path).count, puzzle.path.count, "nodes must be distinct")42                XCTAssertTrue(puzzle.path.allSatisfy { (0..<(puzzle.size * puzzle.size)).contains($0) })43                for (a, b) in zip(puzzle.path, puzzle.path.dropFirst()) {44                    XCTAssertTrue(PatternLockEngine.isLegalMove(from: a, to: b, size: puzzle.size), "\(puzzle.path)")45                }46                XCTAssertTrue(PatternLockEngine.validate(puzzle, answer: puzzle.path))47                XCTAssertFalse(PatternLockEngine.validate(puzzle, answer: Array(puzzle.path.reversed())))48                XCTAssertFalse(PatternLockEngine.validate(puzzle, answer: Array(puzzle.path.dropLast())))49                XCTAssertFalse(PatternLockEngine.validate(puzzle, answer: Array(puzzle.path.dropFirst())))50                XCTAssertFalse(PatternLockEngine.validate(puzzle, answer: []))51            }52        }53    }5455    func testPathsGetLongerWithLevelAndRound() {56        for level in 1...3 {57            XCTAssertLessThan(PatternLockEngine.pathLength(level: level, round: 0), PatternLockEngine.pathLength(level: level + 1, round: 0))58        }59        for level in 1...4 {60            let lengths = (0..<10).map { PatternLockEngine.pathLength(level: level, round: $0) }61            XCTAssertEqual(lengths, lengths.sorted())62            XCTAssertGreaterThan(lengths.last!, lengths.first!)63        }64    }65}66
Files main
Menu

Theme