Repository navigation
Randomize a List in C#: .NET 11, built-in shuffles and a fixed benchmark - #2389
Merged
vladimir-pecanac-main merged 3 commits intoNov 22, 2026
Conversation
…and fix the benchmark Target net11.0 with BenchmarkDotNet 0.15.8 and MSTest 4.5.3. Add Random.Shuffle, LINQ Shuffle, a biased loop for the fairness count and CountOrders. Move the benchmark to its own in-process class that gives the in-place methods a fresh ordered copy per iteration. Tests now check the result is a permutation of the input.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Moves collections-lists/RandomizeGenericListsInCSharp from net7.0 to net11.0 (BenchmarkDotNet 0.15.8, MSTest 4.5.3, Microsoft.NET.Test.Sdk 18.12.0, coverlet.collector 10.1.0), adds Random.Shuffle over CollectionsMarshal.AsSpan, LINQ Shuffle, a labelled biased loop and a CountOrders helper that Program.cs uses to print a fairness count when run without arguments, moves the benchmark into its own in-process class where the two in-place shuffles get a fresh ordered copy per iteration, and rewrites the tests so they check that each shuffle returns a permutation of the input in a new order.