blocks|key|1572232|text|使用Skip和Take扩展方法非常简单。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1572233|var+query+=+from+i+in+ideas
++++++++++++select+i;

var+paggedCollection+=+query.Skip(startIndex).Take(count);|code-block|syntax|javascript|1572234|entityMap^0|2|4|7|4|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@$9|N|A|O|B|C]|$9|P|A|Q|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|R|8|@]|D|@]|E|$I|J]]|$1|K|3|-4|5|6|7|S|8|@]|D|@]|E|$]]]|L|$]]

It is very simple with the <code>Skip</code> and <code>Take</code> extension methods.

<pre><code>var query = from i in ideas
 select i;

var paggedCollection = query.Skip(startIndex).Take(count);
</code></pre>

blocks|key|1572327|text|几个月前，我写了一篇关于Fluent+Interfaces和LINQ的博客文章，它使用了IQueryable<T>上的一个扩展方法和另一个类，提供了以下对LINQ集合进行分页的自然方式。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1572328|var+query+=+from+i+in+ideas
++++++++++++select+i;
var+pagedCollection+=+query.InPagesOf(10);
var+pageOfIdeas+=+pagedCollection.Page(2);|code-block|syntax|javascript|1572329|您可以从MSDN+code+Gallery+Page：Pipelines,+Filters,+Fluent+API+and+LINQ+to+SQL获取代码。|1572330|entityMap|0|LINK|mutability|MUTABLE|url|http://code.msdn.microsoft.com/productschallenge^0|18|D|0|0|R|1A|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@$9|V|A|W|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|X|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|6|7|Y|8|@]|D|@$9|Z|A|10|1|11]]|E|$]]|$1|M|3|-4|5|6|7|12|8|@]|D|@]|E|$]]]|N|$O|$5|P|Q|R|E|$S|T]]]]

A few months back I wrote a blog post about Fluent Interfaces and LINQ which used an Extension Method on <code>IQueryable&lt;T&gt;</code> and another class to provide the following natural way of paginating a LINQ collection.

<pre><code>var query = from i in ideas
 select i;
var pagedCollection = query.InPagesOf(10);
var pageOfIdeas = pagedCollection.Page(2);
</code></pre>

You can get the code from the MSDN Code Gallery Page: <a href="http://code.msdn.microsoft.com/productschallenge" rel="noreferrer">Pipelines, Filters, Fluent API and LINQ to SQL</a>.

blocks|key|1787337|text|这个问题有点老了，但我想发布我的分页算法，它显示了整个过程(包括用户交互)。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1787338|const+int+pageSize+=+10;
const+int+count+=+100;
const+int+startIndex+=+20;

int+took+=+0;
bool+getNextPage;
var+page+=+ideas.Skip(startIndex);

do
{
++++Console.WriteLine("Page+{0}:",+(took+/+pageSize)+%2B+1);
++++foreach+(var+idea+in+page.Take(pageSize))
++++{
++++++++Console.WriteLine(idea);
++++}

++++took+%2B=+pageSize;
++++if+(took+<+count)
++++{
++++++++Console.WriteLine("Next+page+(y/n)?");
++++++++char+answer+=+Console.ReadLine().FirstOrDefault();
++++++++getNextPage+=+default(char)+!=+answer+&&+'y'+==+char.ToLowerInvariant(answer);

++++++++if+(getNextPage)
++++++++{
++++++++++++page+=+page.Skip(pageSize);
++++++++}
++++}
}
while+(getNextPage+&&+took+<+count);|code-block|syntax|javascript|1787339|但是，如果您追求的是性能，而在生产代码中，我们都追求的是性能，那么您不应该使用上面所示的LINQ分页，而应该使用底层的IEnumerator来实现分页。事实上，它与上面显示的LINQ算法一样简单，但性能更好：|offset|length|style|CODE|1787340|const+int+pageSize+=+10;
const+int+count+=+100;
const+int+startIndex+=+20;

int+took+=+0;
bool+getNextPage+=+true;
using+(var+page+=+ideas.Skip(startIndex).GetEnumerator())
{
++++do+
++++{
++++++++Console.WriteLine("Page+{0}:",+(took+/+pageSize)+%2B+1);

++++++++int+currentPageItemNo+=+0;
++++++++while+(currentPageItemNo%2B%2B+<+pageSize+&&+page.MoveNext())
++++++++{
++++++++++++var+idea+=+page.Current;
++++++++++++Console.WriteLine(idea);
++++++++}

++++++++took+%2B=+pageSize;
++++++++if+(took+<+count)
++++++++{
++++++++++++Console.WriteLine("Next+page+(y/n)?");
++++++++++++char+answer+=+Console.ReadLine().FirstOrDefault();
++++++++++++getNextPage+=+default(char)+!=+answer+&&+'y'+==+char.ToLowerInvariant(answer);
++++++++}
++++}
++++while+(getNextPage+&&+took+<+count);
}|1787341|说明:以“级联方式”多次使用Skip()的缺点是，它不会真正存储迭代的“指针”，它最后一次被跳过的地方。-相反，原始序列将通过跳过调用进行前端加载，这将导致一次又一次地“消费”已经“消费”的页面。%2B您可以自己证明这一点，当您创建序列ideas以使其产生副作用时。->即使您跳过了10-20和20-30并希望处理40%2B，在开始迭代40%2B之前，您也会看到再次执行10-30的所有副作用。直接使用IEnumerable接口的变体将会记住最后一个逻辑页的末尾位置，因此不需要显式跳过，副作用也不会重复。|1787342|entityMap^0|0|0|1N|B|0|0|E|6|38|5|5F|B|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|U|8|@$I|V|J|W|K|L]]|9|@]|A|$]]|$1|M|3|N|5|D|7|X|8|@]|9|@]|A|$E|F]]|$1|O|3|P|5|6|7|Y|8|@$I|Z|J|10|K|L]|$I|11|J|12|K|L]|$I|13|J|14|K|L]]|9|@]|A|$]]|$1|Q|3|-4|5|6|7|15|8|@]|9|@]|A|$]]]|R|$]]

This question is somewhat old, but I wanted to post my paging algorithm that shows the whole procedure (including user interaction).

<pre><code>const int pageSize = 10;
const int count = 100;
const int startIndex = 20;

int took = 0;
bool getNextPage;
var page = ideas.Skip(startIndex);

do
{
 Console.WriteLine("Page {0}:", (took / pageSize) + 1);
 foreach (var idea in page.Take(pageSize))
 {
 Console.WriteLine(idea);
 }

 took += pageSize;
 if (took &lt; count)
 {
 Console.WriteLine("Next page (y/n)?");
 char answer = Console.ReadLine().FirstOrDefault();
 getNextPage = default(char) != answer &amp;&amp; 'y' == char.ToLowerInvariant(answer);

 if (getNextPage)
 {
 page = page.Skip(pageSize);
 }
 }
}
while (getNextPage &amp;&amp; took &lt; count);
</code></pre>

However, if you are after performance, and in production code, we're all after performance, you shouldn't use LINQ's paging as shown above, but rather the underlying <code>IEnumerator</code> to implement paging yourself. As a matter of fact, it is as simple as the LINQ-algorithm shown above, but more performant:

<pre><code>const int pageSize = 10;
const int count = 100;
const int startIndex = 20;

int took = 0;
bool getNextPage = true;
using (var page = ideas.Skip(startIndex).GetEnumerator())
{
 do 
 {
 Console.WriteLine("Page {0}:", (took / pageSize) + 1);

 int currentPageItemNo = 0;
 while (currentPageItemNo++ &lt; pageSize &amp;&amp; page.MoveNext())
 {
 var idea = page.Current;
 Console.WriteLine(idea);
 }

 took += pageSize;
 if (took &lt; count)
 {
 Console.WriteLine("Next page (y/n)?");
 char answer = Console.ReadLine().FirstOrDefault();
 getNextPage = default(char) != answer &amp;&amp; 'y' == char.ToLowerInvariant(answer);
 }
 }
 while (getNextPage &amp;&amp; took &lt; count);
}
</code></pre>

Explanation: The downside of using <code>Skip()</code> for multiple times in a "cascading manner" is, that it will not really store the "pointer" of the iteration, where it was last skipped. - Instead the original sequence will be front-loaded with skip calls, which will lead to "consuming" the already "consumed" pages over and over again. - You can prove that yourself, when you create the sequence <code>ideas</code> so that it yields side effects. -> Even if you have skipped 10-20 and 20-30 and want to process 40+, you'll see all side effects of 10-30 being executed again, before you start iterating 40+.
The variant using <code>IEnumerable</code>'s interface directly, will instead remember the position of the end of the last logical page, so no explicit skipping is needed and side effects won't be repeated.

How do you page through a collection in LINQ given that you have a <code>startIndex</code> and a <code>count</code>?

Paging a collection with LINQ

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

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

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

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

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

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

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

在给定startIndex和count的情况下，如何在LINQ中对集合进行分页

问使用LINQ分页集合
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问使用LINQ分页集合EN