mirror of
https://github.com/lscharen/iigs-sprite-compiler.git
synced 2024-08-31 18:29:06 +00:00
Improved code generation required reducing the optimal cost of the single-byte test
This commit is contained in:
parent
21058f3e06
commit
ab5413f885
@ -64,7 +64,7 @@ namespace SpriteCompiler.Test
|
||||
{
|
||||
// Arrange
|
||||
var problem = SpriteGeneratorSearchProblem.CreateSearchProblem();
|
||||
var search = SpriteGeneratorSearchProblem.Create(80); // max budget of 80 cycles
|
||||
var search = SpriteGeneratorSearchProblem.Create(); // max budget of 80 cycles
|
||||
var sprite = new List<SpriteByte>
|
||||
{
|
||||
new SpriteByte(0x11, 0x00, 3),
|
||||
|
@ -44,14 +44,14 @@ namespace SpriteCompiler.Test
|
||||
// TCS
|
||||
// SHORT A
|
||||
// LDA #$AA
|
||||
// STA 0,s
|
||||
// LONG A = 14 cycles
|
||||
// PHA
|
||||
// LONG A = 13 cycles
|
||||
|
||||
// Write out the solution
|
||||
WriteOutSolution(solution);
|
||||
|
||||
Assert.AreEqual(5, solution.Count());
|
||||
Assert.AreEqual(14, (int)solution.Last().PathCost);
|
||||
Assert.AreEqual(13, (int)solution.Last().PathCost);
|
||||
}
|
||||
|
||||
[TestMethod]
|
||||
|
Loading…
Reference in New Issue
Block a user