Buddhism8003
/
AdventOfCode
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Refactor `Permutations` in `EnumerableExtensions` by extracting `RotateIndices` method to simplify and reuse index rotation logic

This commit is contained in:
Sebastian Lindemeier 2025-12-16 08:00:03 +01:00
parent 9d4051ece1
commit d878ab186e
1 changed files with 13 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
AdventOfCode.Extensions/EnumerableExtensions.cs
View File

@ -117,12 +117,7 @@ public static class EnumerableExtensions
cycles[i] -= 1; cycles[i] -= 1;
if (cycles[i] == 0) if (cycles[i] == 0)
{ {
var tmp = indices[i]; RotateIndices(indices, i);
for (var j = i; j < indices.Length - 1; j++)
{
indices[j] = indices[j + 1];
}
indices[^1] = tmp;
cycles[i] = poolLength - i; cycles[i] = poolLength - i;
} }
else else
@ -135,6 +130,18 @@ public static class EnumerableExtensions
} }
} }
} }
yield break;
static void RotateIndices(int[] indices, int from)
{
var tmp = indices[from];
for (var j = from; j < indices.Length - 1; j++)
{
indices[j] = indices[j + 1];
}
indices[^1] = tmp;
}
} }
private static TValue[] GetCombination<TValue>(int[] innerIndices, TValue[] innerPool) => private static TValue[] GetCombination<TValue>(int[] innerIndices, TValue[] innerPool) =>