نوشته شده توسط
tooraj_azizi_1035
مقادیر رو به دلخواه تغییر بده:
Random rand = new Random();
List<Int32> result = new List<Int32>();
for (Int32 i = 0; i < 300; i++)
{
Int32 curValue = rand.Next(1, 100000);
while (result.Exists(value => value == curValue))
{
curValue = rand.Next(1, 100000);
}
result.Add(curValue);
}
Next در واقع از NextDouble استفاده میکنه.
List به شکل ترتیبی میگرده.
هزینه هر کدوم از اون call های LInQ معادل کل این برنامست.
List به شکل خطی فضا میگیره و در آخر 848 بایت اضافه میاره.
البته با همه ی این تفاسیر مموری برنامه شما کمتر از برنامه من هست.
ولی به سرعتش نمیارزه.
برای بهترین تست عدد ۳۰۰ رو با ۳۰۰۰۰۰ عوض کنید.
بهتر بود از حلقه do while استفاده میکردید.(تفاوتی در اجرا نداره.به جز این که کدتون شلوغ میشه)
Random rand = new Random();
SortedSet<double> result = new SortedSet<double>();
double curValue;
for (Int32 i = 0; i < 300; i++)
{
do
{
curValue = rand.NextDouble();
} while (result.Contains(curValue));
result.Add(curValue);
}
در این برنامه میتونید خودتون Comparer رو طوری تعریف کنید که تعداد اعشاری رو که لازم دارید در نظر بگیره.
و در آخر کد خود کلاس Random
لایسنس دات نت اجازه نمیده کدش رو بزارم اینجا.
این کد دیکامپایل شده مونو هست:
using System;
using System.Runtime.InteropServices;
namespace System
{
[ComVisible (true)]
[Serializable]
public class Random
{
//
// Static Fields
//
private const int MBIG = 2147483647;
private const int MSEED = 161803398;
//
// Fields
//
private int inext;
private int inextp;
private int[] SeedArray = new int[56];
//
// Constructors
//
public Random (int Seed)
{
int num;
if (Seed == -2147483648)
{
num = 161803398 - Math.Abs (-2147483647);
}
else
{
num = 161803398 - Math.Abs (Seed);
}
this.SeedArray [55] = num;
int num2 = 1;
for (int i = 1; i < 55; i++)
{
int num3 = 21 * i % 55;
this.SeedArray [num3] = num2;
num2 = num - num2;
if (num2 < 0)
{
num2 += 2147483647;
}
num = this.SeedArray [num3];
}
for (int j = 1; j < 5; j++)
{
for (int k = 1; k < 56; k++)
{
this.SeedArray [k] -= this.SeedArray [1 + (k + 30) % 55];
if (this.SeedArray [k] < 0)
{
this.SeedArray [k] += 2147483647;
}
}
}
this.inext = 0;
this.inextp = 31;
}
public Random () : this (Environment.TickCount)
{
}
//
// Methods
//
public virtual int Next (int minValue, int maxValue)
{
if (minValue > maxValue)
{
throw new ArgumentOutOfRangeException (Locale.GetText ("Min value is greater than max value."));
}
uint num = (uint)(maxValue - minValue);
if (num <= 1u)
{
return minValue;
}
return (int)((ulong)((uint)(this.Sample () * num)) + (ulong)((long)minValue));
}
public virtual int Next (int maxValue)
{
if (maxValue < 0)
{
throw new ArgumentOutOfRangeException (Locale.GetText ("Max value is less than min value."));
}
return (int)(this.Sample () * (double)maxValue);
}
public virtual int Next ()
{
return (int)(this.Sample () * 2147483647.0);
}
public virtual void NextBytes (byte[] buffer)
{
if (buffer == null)
{
throw new ArgumentNullException ("buffer");
}
for (int i = 0; i < buffer.Length; i++)
{
buffer [i] = (byte)(this.Sample () * 256.0);
}
}
public virtual double NextDouble ()
{
return this.Sample ();
}
protected virtual double Sample ()
{
if (++this.inext >= 56)
{
this.inext = 1;
}
if (++this.inextp >= 56)
{
this.inextp = 1;
}
int num = this.SeedArray [this.inext] - this.SeedArray [this.inextp];
if (num < 0)
{
num += 2147483647;
}
this.SeedArray [this.inext] = num;
return (double)num * 4.6566128752457969E-10;
}
}
}
این هم اصل کد مونو در ورژن ۲.۱۰.۵:
//
// System.Random.cs
//
// Authors:
// Bob Smith (bob@thestuff.net)
// Ben Maurer (bmaurer@users.sourceforge.net)
//
// (C) 2001 Bob Smith. http://www.thestuff.net
// (C) 2003 Ben Maurer
//
//
// Copyright (C) 2004 Novell, Inc (http://www.novell.com)
//
// Permission is hereby granted, free of charge, to any person obtaining
// a copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to
// permit persons to whom the Software is furnished to do so, subject to
// the following conditions:
//
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//
using System.Runtime.InteropServices;
namespace System
{
[Serializable]
[ComVisible (true)]
public class Random
{
const int MBIG = int.MaxValue;
const int MSEED = 161803398;
int inext, inextp;
int [] SeedArray = new int [56];
public Random ()
: this (Environment.TickCount)
{
}
public Random (int Seed)
{
int ii;
int mj, mk;
// Numerical Recipes in C online @ http://www.library.cornell.edu/nr/bookcpdf/c7-1.pdf
// Math.Abs throws on Int32.MinValue, so we need to work around that case.
// Fixes: 605797
if (Seed == Int32.MinValue)
mj = MSEED - Math.Abs (Int32.MinValue + 1);
else
mj = MSEED - Math.Abs (Seed);
SeedArray [55] = mj;
mk = 1;
for (int i = 1; i < 55; i++) { // [1, 55] is special (Knuth)
ii = (21 * i) % 55;
SeedArray [ii] = mk;
mk = mj - mk;
if (mk < 0)
mk += MBIG;
mj = SeedArray [ii];
}
for (int k = 1; k < 5; k++) {
for (int i = 1; i < 56; i++) {
SeedArray [i] -= SeedArray [1 + (i + 30) % 55];
if (SeedArray [i] < 0)
SeedArray [i] += MBIG;
}
}
inext = 0;
inextp = 31;
}
protected virtual double Sample ()
{
int retVal;
if (++inext >= 56) inext = 1;
if (++inextp >= 56) inextp = 1;
retVal = SeedArray [inext] - SeedArray [inextp];
if (retVal < 0)
retVal += MBIG;
SeedArray [inext] = retVal;
return retVal * (1.0 / MBIG);
}
public virtual int Next ()
{
return (int)(Sample () * int.MaxValue);
}
public virtual int Next (int maxValue)
{
if (maxValue < 0)
throw new ArgumentOutOfRangeException(Locale.GetText (
"Max value is less than min value."));
return (int)(Sample () * maxValue);
}
public virtual int Next (int minValue, int maxValue)
{
if (minValue > maxValue)
throw new ArgumentOutOfRangeException (Locale.GetText (
"Min value is greater than max value."));
// special case: a difference of one (or less) will always return the minimum
// e.g. -1,-1 or -1,0 will always return -1
uint diff = (uint) (maxValue - minValue);
if (diff <= 1)
return minValue;
return (int)((uint)(Sample () * diff) + minValue);
}
public virtual void NextBytes (byte [] buffer)
{
if (buffer == null)
throw new ArgumentNullException ("buffer");
for (int i = 0; i < buffer.Length; i++) {
buffer [i] = (byte)(Sample () * (byte.MaxValue + 1));
}
}
public virtual double NextDouble ()
{
return this.Sample ();
}
}
}
برای همین بهتر هست که مقدار seed رو تعیین کنید.
چون در ویندوز TickCount
granularity مناسبی نداره.
تولید اعداد تصادفی بین صفر و یک
قوانین ایجاد تاپیک در تالار
پاسخ با نقل قول