blocks|key|3074035|text|然后，您需要以其他方式封装它--创建您自己的集合，它可以处理足够多的数据，并且可能会通过内部委托给较小的集合来使用long而不是int来实现索引值等等。我想这不会很有趣，但我看不出你还有很多其他的选择。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|3074036|从根本上说，任何由单个数组支持的东西都会遇到问题。|3074037|entityMap^0|1L|4|1S|3|0|0^^$0|@$1|2|3|4|5|6|7|J|8|@$9|K|A|L|B|C]|$9|M|A|N|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|O|8|@]|D|@]|E|$]]|$1|H|3|-4|5|6|7|P|8|@]|D|@]|E|$]]]|I|$]]

Then you'll need to encapsulate that in some other way - create your own collection which can handle enough data, and will probably use <code>long</code> instead of <code>int</code> for the index values, etc, by delegating to smaller collections internally. I suspect it won't be a lot of fun, but I can't see you've got many other options.

Fundamentally, anything that's backed by a single array is going to run into problems.

blocks|key|3074096|text|改为锯齿状；例如Complex[][]。它可以是宽矩形锯齿，如果你需要，只要总是使用相同的大小为内部数组。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|3074097|另一种选择；使用大型列表的链接列表；这具有易于扩展的优点。|3074098|entityMap^0|8|B|0|0^^$0|@$1|2|3|4|5|6|7|J|8|@$9|K|A|L|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|M|8|@]|D|@]|E|$]]|$1|H|3|-4|5|6|7|N|8|@]|D|@]|E|$]]]|I|$]]

Make it jagged instead; a <code>Complex[][]</code> for example. It can be broadly-rectangular jagged, if you need, simply by always using the same size for the inner arrays.

Another option; use a linked-list of large-lists; this has the advantage of being easier to extend.

blocks|key|3074201|text|我会在内部实现一个使用多个数组的包装类。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3074202|类似于以下内容：|3074203|void+Main()
{
++++long+count=3*1024*1024;
++++var+arr=new+LargeArray<Complex>(count,12);
++++for(long+i=0;i<count;i%2B%2B)
++++{
++++++arr[i]=new+Complex(i,-i);
++++}
++++for(long+i=0;i<count;i%2B%2B)
++++{
++++++if(arr[i].R!=i)
++++++++throw+new+Exception("Fail"%2Bi%2B"+"%2Barr[i].R);
++++}
}

struct+Complex
{
++public+double+R,I;

++public+Complex(double+r,double+i)
++++{
++++++R=r;
++++++I=i;
++++}
}


class+LargeArray<T>
{
++private+readonly+int+partBits;++
++private+readonly+long+size;

++private+T[][]+data;

++public+T+this[long+index]
++{
++++get
++++{
++++++if((ulong)index>=(ulong)size)
++++++++throw+new+IndexOutOfRangeException();
++++++int+part=(int)(index>>partBits);
++++++int+subIndex=(int)(index&((1<<partBits)-1));
++++++return+data[part][subIndex];
++++}
++++set
++++{
++++++if((ulong)index>=(ulong)size)
++++++++throw+new+ArgumentOutOfRangeException();
++++++int+part=(int)(index>>partBits);
++++++int+subIndex=((int)index&((1<<partBits)-1));
++++++data[part][subIndex]=value;
++++}
++}

++public+LargeArray(long+size,int+partBits)
++{
++++this.size=size;
++++this.partBits=partBits;
++++int+partSize=1<<partBits;
++++int+partCount=(int)(((size-1)>>partBits)%2B1);
++++data=new+T[partCount][];
++++for(int+i=0;i<partCount;i%2B%2B)
++++++data[i]=new+T[partSize];
++}
}|code-block|syntax|javascript|3074204|如果您使用64位进程，则此操作超过2GB。我试了5GB，除了把我的康普换到停顿之外，它还起作用了。|3074205|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|N|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|O|8|@]|9|@]|A|$G|H]]|$1|I|3|J|5|6|7|P|8|@]|9|@]|A|$]]|$1|K|3|-4|5|6|7|Q|8|@]|9|@]|A|$]]]|L|$]]

I'd implement a wrapper class that uses multiple arrays internally.

Similar to the following:

<pre><code>void Main()
{
 long count=3*1024*1024;
 var arr=new LargeArray&lt;Complex&gt;(count,12);
 for(long i=0;i&lt;count;i++)
 {
 arr[i]=new Complex(i,-i);
 }
 for(long i=0;i&lt;count;i++)
 {
 if(arr[i].R!=i)
 throw new Exception("Fail"+i+" "+arr[i].R);
 }
}

struct Complex
{
 public double R,I;

 public Complex(double r,double i)
 {
 R=r;
 I=i;
 }
}


class LargeArray&lt;T&gt;
{
 private readonly int partBits; 
 private readonly long size;

 private T[][] data;

 public T this[long index]
 {
 get
 {
 if((ulong)index&gt;=(ulong)size)
 throw new IndexOutOfRangeException();
 int part=(int)(index&gt;&gt;partBits);
 int subIndex=(int)(index&amp;((1&lt;&lt;partBits)-1));
 return data[part][subIndex];
 }
 set
 {
 if((ulong)index&gt;=(ulong)size)
 throw new ArgumentOutOfRangeException();
 int part=(int)(index&gt;&gt;partBits);
 int subIndex=((int)index&amp;((1&lt;&lt;partBits)-1));
 data[part][subIndex]=value;
 }
 }

 public LargeArray(long size,int partBits)
 {
 this.size=size;
 this.partBits=partBits;
 int partSize=1&lt;&lt;partBits;
 int partCount=(int)(((size-1)&gt;&gt;partBits)+1);
 data=new T[partCount][];
 for(int i=0;i&lt;partCount;i++)
 data[i]=new T[partSize];
 }
}
</code></pre>

If you use a 64 bit process this works beyond 2GB. I tried it with 5GB and apart from swapping my comp to a halt it worked.

blocks|key|3074232|text|在.NET+4.5中，数组实际上可以更大，2GB。严格限制元素的数量，而不是限制大小。http://msdn.microsoft.com/en-us/library/hh285054(v=vs.110).aspx|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|3074233|讨论新标志和数组的新限制。|3074234|entityMap|0|LINK|mutability|MUTABLE|url|http://msdn.microsoft.com/en-us/library/hh285054(v=vs.110).aspx^0|17|1R|0|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@]|9|@$A|O|B|P|1|Q]]|C|$]]|$1|D|3|E|5|6|7|R|8|@]|9|@]|C|$]]|$1|F|3|-4|5|6|7|S|8|@]|9|@]|C|$]]]|G|$H|$5|I|J|K|C|$L|M]]]]

In .NET 4.5 it appears that arrays can actually be larger 2 GB. With a hard limit on the number of elements, rather than in size. 
<a href="http://msdn.microsoft.com/en-us/library/hh285054(v=vs.110).aspx" rel="nofollow">http://msdn.microsoft.com/en-us/library/hh285054(v=vs.110).aspx</a>

Talks about the new flag and the new limitations on arrays.

In .Net framework 2 GiB is the highest memory that you can allocate for an object. This fact is independent from platform (x64 or x86 or ...).
I need to have a huge list with more than 2^30 Complex Numbers (each one is 16 bytes).

Note:

<blockquote>
 As with 32-bit Windows operating systems, there is a 2GB limit on the
 size of an object you can create while running a 64-bit managed
 application on a 64-bit Windows operating system.
</blockquote>

from <a href="http://msdn.microsoft.com/en-us/library/ms241064%28VS.80%29.aspx" rel="nofollow">http://msdn.microsoft.com/en-us/library/ms241064%28VS.80%29.aspx</a>

How to have a huge list? Greather than 2 GiB?

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

在.Net框架中，2 GiB是可以为对象分配的最高内存。这个事实是独立于平台的(、x64、或x86或.)。我需要一个包含超过2^30个复数的大列表(每个复数是16个字节)。注意：和32位Windows操作系统一样，在64位Windows操作系统上运行64位托管应用程序时，可以创建的对象的大小限制为2GB。来自

问如何有一个庞大的清单？青色超过2 GiB？
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问如何有一个庞大的清单？青色超过2 GiB？EN