968int count = rgen.Next(2) == 0 ? len : rgen.Next(len); 979indices = new int[count + rgen.Next(excess)]; 982indices[i] = rgen.Next(200) - 100; 983if (indices.Length == 0 && rgen.Next(2) == 0) 986float[] values = new float[count + rgen.Next(excess)]; 989if (values.Length == 0 && rgen.Next(2) == 0) 999indices[i] = rgen.Next(max); 1100subcase = (GenLogic)rgen.Next(cases); 1112GenerateVBuffer(rgen, len, rgen.Next(len), out b); 1117GenerateVBuffer(rgen, len, rgen.Next(len), out a); 1126GenerateVBuffer(rgen, len, rgen.Next(len), out a); 1127GenerateVBuffer(rgen, a.GetValues().Length, rgen.Next(a.GetValues().Length), out b); 1136GenerateVBuffer(rgen, len, rgen.Next(len), out a); 1137GenerateVBuffer(rgen, len, rgen.Next(len), out b); 1140GenerateVBuffer(rgen, len, rgen.Next(len), out a); 1141int boundary = rgen.Next(a.GetValues().Length + 1); 1155if (rgen.Next(2) == 0)

Prediction\Calibrator.cs (1)

1417index = _random.Next(_itemsSeen); // 0 to items_seen - 1.

Transforms\RowShufflingTransformer.cs (1)

659int circularSwapIndex = (_rand.Next(Math.Min(_liveCount, _poolRows)) + _circularIndex) % _pipeIndices.Length;

SumupPerformanceCommand.cs (2)

107yield return rgen.Next(_bins); 144yield return rgen.Next(_bins);

Training\Applications\ObjectiveFunction.cs (1)

58int sampleIndex = _rnd.Next(GradSamplingRate);

Training\DocumentPartitioning.cs (1)

182var randInst = _leafBegin[i] + rand.Next(_leafCount[i]);

Training\OptimizationAlgorithms\GradientDescent.cs (1)

54droppedTrees = new int[] { DropoutRng.Next(numberOfTrees) };

Utils\LinqExtensions.cs (1)

267return rand.Next(len);

MistralCausalLMAgent.cs (1)

164.Select(s => s[random.Next(s.Length)]).ToArray());

LightGbmTrainerBase.cs (2)

963step = rand.Next((int)(2 * averageStep - 1)) + 1; 1016step = rand.Next((int)(2 * averageStep - 1)) + 1;

BenchmarkBase.cs (3)

79lineSB.Append(CreateRandomColumn(random.Next(100), maxWordLength, random)); 106columnSB.Append(characters[random.Next(characters.Length)]); 114if (random.Next(2) == 0) // sometimes return the column as lowercase

CacheDataViewBench.cs (1)

62_positions[i] = rand.Next(Length);

Dynamic\Trainers\BinaryClassification\PermutationFeatureImportance.cs (2)

105Feature1 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)), 106Feature2 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)),

Dynamic\Trainers\BinaryClassification\PermutationFeatureImportanceLoadFromDisk.cs (2)

91Feature1 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)), 92Feature2 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)),

Dynamic\Trainers\MulticlassClassification\PermutationFeatureImportance.cs (2)

110Feature1 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)), 111Feature2 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)),

Dynamic\Trainers\MulticlassClassification\PermutationFeatureImportanceLoadFromDisk.cs (2)

119Feature1 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)), 120Feature2 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)),

Dynamic\Trainers\Ranking\PermutationFeatureImportance.cs (2)

121Feature1 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)), 122Feature2 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)),

Dynamic\Trainers\Ranking\PermutationFeatureImportanceLoadFromDisk.cs (2)

128Feature1 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)), 129Feature2 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)),

Dynamic\Trainers\Regression\PermutationFeatureImportance.cs (2)

115Feature1 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)), 116Feature2 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)),

Dynamic\Trainers\Regression\PermutationFeatureImportanceLoadFromDisk.cs (2)

122Feature1 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)), 123Feature2 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)),

Dynamic\Transforms\CalculateFeatureContribution.cs (2)

124Feature1 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)), 125Feature2 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)),

Dynamic\Transforms\CalculateFeatureContributionCalibrated.cs (2)

131Feature1 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)), 132Feature2 = (float)(rng.Next(10) * (rng.NextDouble() - 0.5)),

LdSvm\LdSvmTrainer.cs (5)

240int thetaIdx = Host.Rand.Next(numLeaf - 1); 537int randIdx = k + rand.Next(length - k); 552int index = rand.Next(length); 587_indices2[i] = rand.Next(length); 626int randIdx = k + rand.Next(length - k);

Optimizer\DifferentiableFunction.cs (2)

208int index = _r.Next((int)x.Length); 210index = _r.Next((int)x.Length);

Algorithms\Grid.cs (1)

184return new ParameterSet(SweepParameters.Select(sweepParameter => sweepParameter[Host.Rand.Next(sweepParameter.Count)]));

DataPipe\TestDataPipe.cs (1)

1186bizValues[i] = (rgen.Next(2) == 1);

CalibratedModelParametersTests.cs (5)

108var x1 = rand.Next(1000); 110var x2Important = rand.Next(10000); 112var x3 = rand.Next(5000); 114var x4Rand = rand.Next(1000); 117var noise = rand.Next(50);

FastTreeSumupParityTests.cs (4)

142values[i] = rand.Next(256); 163values.Add(maxExclusive <= 1 ? 0 : rand.Next(maxExclusive)); 240values[i] = rand.Next(numBins); 300if (rand.Next(2) == 0)

FeatureContributionTests.cs (10)

269var x1 = rand.Next(1000); 271var x3Important = rand.Next(10000); 278vb = new VBuffer<float>(4, 3, new float[] { rand.Next(1000), rand.Next(1000), rand.Next(1000) }, new int[] { 0, 2, 3 }); 282vb = new VBuffer<float>(4, 4, new float[] { rand.Next(1000), rand.Next(1000), rand.Next(1000), rand.Next(1000) }, new int[] { 0, 1, 2, 3 }); 293var noise = rand.Next(50);

PermutationFeatureImportanceTests.cs (15)

826var x1 = rand.Next(1000); 828var x2Important = rand.Next(10000); 830var x3 = rand.Next(5000); 832var x4Rand = rand.Next(1000); 835var noise = rand.Next(50); 893var x1 = rand.Next(1000); 895var x3Important = rand.Next(10000); 902vb = new VBuffer<float>(4, 3, new float[] { rand.Next(1000), rand.Next(1000), rand.Next(1000) }, new int[] { 0, 2, 3 }); 906vb = new VBuffer<float>(4, 4, new float[] { rand.Next(1000), rand.Next(1000), rand.Next(1000), rand.Next(1000) }, new int[] { 0, 1, 2, 3 }); 917var noise = rand.Next(50);

Tasks\Kudu\KuduDeploy.cs (1)

168string zipFileFullPath = Path.Combine(Path.GetTempPath(), string.Format("Publish{0}.zip", new Random().Next(int.MaxValue)));

HttpSource\HttpRetryHandler.cs (1)

92await Task.Delay(TimeSpan.FromMilliseconds((Math.Pow(2, tries) * request.RetryDelay.TotalMilliseconds) + new Random().Next(200)), cancellationToken);

Program.cs (1)

190if (Random.Shared.Next(2) == 0)

System\Linq\Shuffle.SpeedOpt.cs (1)

223int r = Random.Shared.Next(i + 1);

System\Net\NetworkInformation\Ping.RawSocket.cs (1)

28ushort id = (ushort)Random.Shared.Next(ushort.MaxValue + 1);

src\runtime\src\libraries\System.Private.CoreLib\src\System\Random.CompatImpl.cs (3)

212((ulong)(uint)_parent.Next(1 << 22)) | 213(((ulong)(uint)_parent.Next(1 << 22)) << 22) | 214(((ulong)(uint)_parent.Next(1 << 20)) << 44);

src\runtime\src\libraries\System.Private.CoreLib\src\System\Random.cs (5)

305return T.CreateTruncating(Next(int.CreateTruncating(maxExclusive))); 478/// The method uses <see cref="Next(int)" /> to select items randomly from <paramref name="choices" /> 574destination[i] = choices[Next(choices.Length)]; 592/// The method uses <see cref="Next(int)" /> to select items randomly from <paramref name="choices" /> 613/// The method uses <see cref="Next(int)" /> to select items randomly from <paramref name="choices" />

System\Text\RegularExpressions\Regex.Cache.cs (2)

256int minListIndex = useRandom ? s_random.Next(s_cacheList.Count) : 0; 262int nextIndex = useRandom ? s_random.Next(s_cacheList.Count) : i;

Program.cs (1)

30summaries[Random.Shared.Next(summaries.Length)]

Program.cs (1)

26summaries[Random.Shared.Next(summaries.Length)]