C#

aspdotnetdev wrote:

Also, if you are going to create a very large list (as you indicated in one of your replies), then I recommend creating lists of lists, rather than a single list. The reason is that memory fragmentation and other limits may prevent you from creating a single contiguous chunk of memory above a certain size (say, 256MB, a limit I've run into before due to fragmentation). That also helps to remedy the array copy problem. The sublists can always be created with a known capacity(e.g., 10,000,000 elements). Then it would only be the "major" list that would grow, and it would not grow very often. You would then only require two index operations to access a BigInteger within your list of lists and you wouldn't hit the memory issues.

aspdotnetdev wrote:

The reason is that memory fragmentation and other limits may prevent you from creating a single contiguous chunk of memory above a certain size (say, 256MB, a limit I've run into before due to fragmentation).

aspdotnetdev wrote:

The sublists can always be created with a known capacity(e.g., 10,000,000 elements). Then it would only be the "major" list that would grow, and it would not grow very often.

Bassam Abdul-Baki wrote:

What would happen if you don't have a chunk large enough? Does it fail or wait?

Bassam Abdul-Baki wrote:

I need something much, much larger than this size

List<List<BigInteger>> ints = new List<List<BigInteger>>();
for(int i = 0; i < 10000000; i++)
{
    List<BigInteger> minorInts = new List<BigInteger>(10000000);
    ints.Add(minorInts);
}

[DllImport("kernel32.dll")]
static extern uint GetSystemDefaultLCID();

uint a = GetSystemDefaultLCID();

faraz34 wrote:

when we create a block inside text editor, by pressing any key, that block disappears,while existing block, if suddenly u press DEL key, content of that block get detroyed.i dont want this

I are Troll

Yanshof wrote:

will create fester code ?