C#

Wheels012 wrote:

Array.BinarySearch(numbers, 0, numbers.Length, intRnd);

List<int> numbers = new List<int>();

private bool RndDuplicate(int intRnd)
{
    if (numbers.Contains(intRnd))
        return true;
    else
    {
        numbers.Add(intRnd);
        return false;
    }
}

HashSet set=new HashSet();

private bool RndDuplicate(int intRnd) {return !set.Add(intRnd);}

For an example of creating a file and writing text to a file, see How
 to: Write Text to a File. For an example of reading text from a file, see
 How to: Read Text from a File. For an example of reading from and writing
 to a binary file, see How to: Read and Write to a Newly Created Data File.

Use the CanSeek property to determine whether the current instance supports seeking.

If offset is negative, the new position is required to precede the 
position specified by origin by the number of bytes specified by 
offset. If offset is zero (0), the new position is required to be the 
position specified by origin. If offset is positive, the new position 
is required to follow the position specified by origin by the number of 
bytes specified by offset.

Alex Manolescu wrote:

The new data may be bigger (in size) that the replaced data!!

continue

if (br.BaseStream.Position == x) {
    // below is the data that I want to write
    bw.Write(1);
    bw.Write("StringData");
    bw.Write("StringData");
} else {
    bw.Write(b);
}

public enum DeviceType
{
    TypeA,
    TypeB
}

public abstract class DeviceBase
{
    private DeviceType deviceType;

    internal DeviceBase(DeviceType deviceType)
    {
        this.deviceType = deviceType;
    }

    public DeviceType DeviceType
    {
        get { return deviceType; }
    }
}

public class DeviceTypeA : DeviceBase
{
    public DeviceTypeA()
        : base(DeviceType.TypeA)
    { }
}

public class DeviceTypeB : DeviceBase
{
    public DeviceTypeB()
        : base(DeviceType.TypeB)
    { }
}