Re: Creating a byte[] of long size

From:

=?ISO-8859-1?Q?Arne_Vajh=F8j?= <arne@vajhoej.dk>

Newsgroups:

comp.lang.java.programmer

Date:

Fri, 09 Jul 2010 20:23:28 -0400

Message-ID:

<4c37bd71$0$282$14726298@news.sunsite.dk>

On 08-07-2010 22:40, Wayne wrote:

On 7/8/2010 5:35 PM, Boris Punk wrote:

Integer.MAX_VALUE = 2147483647

I might need more items than that. I probably won't, but it's nice to have
extensibility.

To me, it is unlikely your system will run well if this one data structure
consumes 2G of memory. (You didn't really state the application or system;
certainly there are exceptions to the rule.) I would suggest you use a
more flexible system, where you keep the data on storage (disk) and use
memory as a cache. Perhaps an ArrayList of soft references would work well.
It might even be possible in your particular case to run a daemon thread
that pre-fetches items into the cache.

You mean reinvent what the virtual memory system is already
providing for free?

Keep in mind a modern general-purpose computer will use virtual memory,
typically with 4kiB pages. Any data structure larger than that will
likely end up swapped to disk anyway.

Absolutely not.

Lots of systems does not page much even with huge data.

Arne