ID:151813
Feb 19 2009, 3:22 pm
|
|
How long can a list be before it's too large?
|
Feb 19 2009, 3:24 pm
|
|
At compile-time, I think it's 65535. Runtime, 16.7 million.
|
In response to Kaiochao
|
|
You can't tell how long a list can be based on how many you can have. It's possible that that's the limit, though I would guess that you could go higher, depending on how the developers programmed lists in.
|
In response to Jeff8500
|
|
Lummox stated somewhere before (it may've been on whatever chat program was popular at the time) that lists were capable of storing arbitrary amounts of numbers, into the billions of elements, and the only problems were a) that it would devastate RAM and b) it couldn't do it with other types of data (strings, objects, etc.) due to their 65,535 limit. Presumably, the new size is now 16,777,215 thanks to the increase.
|
In response to Popisfizzy
|
|
Oh...obviously I needn't worry about that then o.o.
|
In response to Choka
|
|
Not during runtime, just during compile time
George Gough |
In response to Popisfizzy
|
|
Ah, thanks, I assumed the limit on the amounts of elements you could have in a list was nearly unlimited (double float?), and was going to actually say it was pretty much limited by your RAM, but I thought I was assuming too much and made a different post.
|
In response to Choka
|
|
Choka wrote:
Oh...obviously I needn't worry about that then o.o. If you've got in excess of 65000 elements in a list, then you have a design flaw to be worried about (most likely). |
In response to Kaiochao
|
|
Kaiochao wrote:
At compile-time, I think it's 65535. Runtime, 16.7 million. That's the limit on the number of lists, not the size of lists. Internally a list can handle at least 2 billion entries before it has any problems, probably 4 billion. However long before that point your system would run out of memory. Lummox JR |
In response to Lummox JR
|
|
Holy crap... o.o;
|