Skip to content

Apply optimizations and fixes to Enumerable.Take(Range)#48634

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
eiriktsarpalis merged 14 commits into from
Mar 1, 2021
Merged

Apply optimizations and fixes to Enumerable.Take(Range) #48634

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
14 commits
Select commit Hold shift + click to select a range
f38c0d6
optimize Take(Range) for countable enumerables
eiriktsarpalis Feb 22, 2021
a5339bb
Implement TakeLast over Take(Range)
eiriktsarpalis Feb 23, 2021
e1bd78c
Implement SkipLast over Take(Range)
eiriktsarpalis Feb 23, 2021
3558108
remove unneeded checked increment
eiriktsarpalis Feb 23, 2021
b89a0de
fix typo in tests
eiriktsarpalis Feb 24, 2021
faed507
remove ToLookup inputs from NonEnumeratedCount tests
eiriktsarpalis Feb 24, 2021
7dad846
remove leftover code
eiriktsarpalis Feb 24, 2021
cd1c805
Revert "remove ToLookup inputs from NonEnumeratedCount tests"
eiriktsarpalis Feb 24, 2021
9478f52
try debugging test failure
eiriktsarpalis Feb 25, 2021
101ad8e
remove ToLookup inputs from NonEnumeratedCount tests
eiriktsarpalis Feb 24, 2021
0c06999
Revert "try debugging test failure"
eiriktsarpalis Feb 25, 2021
5dbf307
Update src/libraries/System.Linq/src/System/Linq/Take.cs
eiriktsarpalis Feb 27, 2021
25e7058
eliminate redundant yield breaks
eiriktsarpalis Feb 27, 2021
554bd9d
remove accidentally reverted change
eiriktsarpalis Feb 27, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
33 changes: 3 additions & 30 deletions src/libraries/System.Linq/src/System/Linq/Skip.cs
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -121,36 +121,9 @@ public static IEnumerable<TSource> SkipLast<TSource>(this IEnumerable<TSource> s

return count <= 0 ?
source.Skip(0) :
SkipLastIterator(source, count);
}

private static IEnumerable<TSource> SkipLastIterator<TSource>(IEnumerable<TSource> source, int count)
{
Debug.Assert(source != null);
Debug.Assert(count > 0);

var queue = new Queue<TSource>();

using (IEnumerator<TSource> e = source.GetEnumerator())
{
while (e.MoveNext())
{
if (queue.Count == count)
{
do
{
yield return queue.Dequeue();
queue.Enqueue(e.Current);
}
while (e.MoveNext());
break;
}
else
{
queue.Enqueue(e.Current);
}
}
}
TakeRangeFromEndIterator(source,
isStartIndexFromEnd: false, startIndex: 0,
isEndIndexFromEnd: true, endIndex: count);
}
}
}
25 changes: 25 additions & 0 deletions src/libraries/System.Linq/src/System/Linq/Take.SizeOpt.cs
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -18,5 +18,30 @@ private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> s
if (--count == 0) break;
}
}

private static IEnumerable<TSource> TakeRangeIterator<TSource>(IEnumerable<TSource> source, int startIndex, int endIndex)
{
Debug.Assert(source != null);
Debug.Assert(startIndex >= 0 && startIndex < endIndex);

using IEnumerator<TSource> e = source.GetEnumerator();

int index = 0;
while (index < startIndex && e.MoveNext())
{
++index;
}

if (index < startIndex)
{
yield break;
}

while (index < endIndex && e.MoveNext())
{
yield return e.Current;
++index;
}
}
}
}
32 changes: 28 additions & 4 deletions src/libraries/System.Linq/src/System/Linq/Take.SpeedOpt.cs
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -2,14 +2,38 @@
// The .NET Foundation licenses this file to you under the MIT license.

using System.Collections.Generic;
using System.Diagnostics;

namespace System.Linq
{
public static partial class Enumerable
{
private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> source, int count) =>
source is IPartition<TSource> partition ? partition.Take(count) :
source is IList<TSource> sourceList ? (IEnumerable<TSource>)new ListPartition<TSource>(sourceList, 0, count - 1) :
new EnumerablePartition<TSource>(source, 0, count - 1);
private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> source, int count)
{
Debug.Assert(source != null);
Debug.Assert(count > 0);

return
source is IPartition<TSource> partition ? partition.Take(count) :
source is IList<TSource> sourceList ? new ListPartition<TSource>(sourceList, 0, count - 1) :
new EnumerablePartition<TSource>(source, 0, count - 1);
}

private static IEnumerable<TSource> TakeRangeIterator<TSource>(IEnumerable<TSource> source, int startIndex, int endIndex)
{
Debug.Assert(source != null);
Debug.Assert(startIndex >= 0 && startIndex < endIndex);

return
source is IPartition<TSource> partition ? TakePartitionRange(partition, startIndex, endIndex) :
source is IList<TSource> sourceList ? new ListPartition<TSource>(sourceList, startIndex, endIndex - 1) :
new EnumerablePartition<TSource>(source, startIndex, endIndex - 1);

static IPartition<TSource> TakePartitionRange(IPartition<TSource> partition, int startIndex, int endIndex)
{
partition = endIndex == 0 ? EmptyPartition<TSource>.Instance : partition.Take(endIndex);
return startIndex == 0 ? partition : partition.Skip(startIndex);
}
Comment thread
eiriktsarpalis marked this conversation as resolved.
}
}
}
195 changes: 81 additions & 114 deletions src/libraries/System.Linq/src/System/Linq/Take.cs
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -55,121 +55,129 @@ public static IEnumerable<TSource> Take<TSource>(this IEnumerable<TSource> sourc
{
return startIndex >= endIndex
? Empty<TSource>()
: source.Skip(startIndex).Take(endIndex - startIndex);
: TakeRangeIterator(source, startIndex, endIndex);
}

return TakeIterator(source, isStartIndexFromEnd, startIndex, isEndIndexFromEnd, endIndex);
return TakeRangeFromEndIterator(source, isStartIndexFromEnd, startIndex, isEndIndexFromEnd, endIndex);
}

private static IEnumerable<TSource> TakeIterator<TSource>(
IEnumerable<TSource> source, bool isStartIndexFromEnd, int startIndex, bool isEndIndexFromEnd, int endIndex)
private static IEnumerable<TSource> TakeRangeFromEndIterator<TSource>(IEnumerable<TSource> source, bool isStartIndexFromEnd, int startIndex, bool isEndIndexFromEnd, int endIndex)
{
Debug.Assert(source != null);
Debug.Assert(isStartIndexFromEnd || isEndIndexFromEnd);
Debug.Assert(isStartIndexFromEnd
? startIndex > 0 && (!isEndIndexFromEnd || startIndex > endIndex)
: startIndex >= 0 && (isEndIndexFromEnd || startIndex < endIndex));
Debug.Assert(endIndex >= 0);

using IEnumerator<TSource> e = source.GetEnumerator();
if (isStartIndexFromEnd)
// Attempt to extract the count of the source enumerator,
// in order to convert fromEnd indices to regular indices.
// Enumerable counts can change over time, so it is very
// important that this check happens at enumeration time;
// do not move it outside of the iterator method.
if (source.TryGetNonEnumeratedCount(out int count))
{
if (!e.MoveNext())
{
yield break;
}

int index = 0;
Queue<TSource> queue = new();
queue.Enqueue(e.Current);
startIndex = CalculateStartIndex(isStartIndexFromEnd, startIndex, count);
endIndex = CalculateEndIndex(isEndIndexFromEnd, endIndex, count);

while (e.MoveNext())
if (startIndex < endIndex)
{
checked
foreach (TSource element in TakeRangeIterator(source, startIndex, endIndex))
{
index++;
yield return element;
}
}

yield break;
}

Queue<TSource> queue;

if (queue.Count == startIndex)
if (isStartIndexFromEnd)
{
// TakeLast compat: enumerator should be disposed before yielding the first element.
using (IEnumerator<TSource> e = source.GetEnumerator())
{
if (!e.MoveNext())
{
queue.Dequeue();
yield break;
}

queue = new Queue<TSource>();
queue.Enqueue(e.Current);
}

int count = checked(index + 1);
Debug.Assert(queue.Count == Math.Min(count, startIndex));
count = 1;

startIndex = count - startIndex;
if (startIndex < 0)
{
startIndex = 0;
}
while (e.MoveNext())
{
if (count < startIndex)
{
queue.Enqueue(e.Current);
++count;
}
else
{
do
{
queue.Dequeue();
queue.Enqueue(e.Current);
checked { ++count; }
} while (e.MoveNext());
break;
}
}

if (isEndIndexFromEnd)
{
endIndex = count - endIndex;
}
else if (endIndex > count)
{
endIndex = count;
Debug.Assert(queue.Count == Math.Min(count, startIndex));
}

startIndex = CalculateStartIndex(isStartIndexFromEnd: true, startIndex, count);
endIndex = CalculateEndIndex(isEndIndexFromEnd, endIndex, count);
Debug.Assert(endIndex - startIndex <= queue.Count);

for (int rangeIndex = startIndex; rangeIndex < endIndex; rangeIndex++)
{
yield return queue.Dequeue();
}
}
else
{
int index = 0;
while (index <= startIndex)
{
if (!e.MoveNext())
{
yield break;
}
Debug.Assert(!isStartIndexFromEnd && isEndIndexFromEnd);

checked
{
index++;
}
// SkipLast compat: the enumerator should be disposed at the end of the enumeration.
using IEnumerator<TSource> e = source.GetEnumerator();

count = 0;
while (count < startIndex && e.MoveNext())
{
++count;
}

if (isEndIndexFromEnd)
if (count == startIndex)
{
if (endIndex > 0)
queue = new Queue<TSource>();
while (e.MoveNext())
{
Queue<TSource> queue = new();
do
if (queue.Count == endIndex)
{
if (queue.Count == endIndex)
do
{
queue.Enqueue(e.Current);
yield return queue.Dequeue();
}
} while (e.MoveNext());

queue.Enqueue(e.Current);
} while (e.MoveNext());
}
else
{
do
break;
}
else
{
yield return e.Current;
} while (e.MoveNext());
}
}
else
{
Debug.Assert(index < endIndex);
yield return e.Current;
while (checked(++index) < endIndex && e.MoveNext())
{
yield return e.Current;
queue.Enqueue(e.Current);
}
}
}
}

static int CalculateStartIndex(bool isStartIndexFromEnd, int startIndex, int count) =>
Math.Max(0, isStartIndexFromEnd ? count - startIndex : startIndex);

static int CalculateEndIndex(bool isEndIndexFromEnd, int endIndex, int count) =>
Math.Min(count, isEndIndexFromEnd ? count - endIndex : endIndex);
}

public static IEnumerable<TSource> TakeWhile<TSource>(this IEnumerable<TSource> source, Func<TSource, bool> predicate)
Expand DownExpand Up@@ -243,50 +251,9 @@ public static IEnumerable<TSource> TakeLast<TSource>(this IEnumerable<TSource> s

return count <= 0 ?
Empty<TSource>() :
TakeLastIterator(source, count);
}

private static IEnumerable<TSource> TakeLastIterator<TSource>(IEnumerable<TSource> source, int count)
{
Debug.Assert(source != null);
Debug.Assert(count > 0);

Queue<TSource> queue;
using (IEnumerator<TSource> e = source.GetEnumerator())
{
if (!e.MoveNext())
{
yield break;
}

queue = new Queue<TSource>();
queue.Enqueue(e.Current);

while (e.MoveNext())
{
if (queue.Count < count)
{
queue.Enqueue(e.Current);
}
else
{
do
{
queue.Dequeue();
queue.Enqueue(e.Current);
}
while (e.MoveNext());
break;
}
}
}

Debug.Assert(queue.Count <= count);
do
{
yield return queue.Dequeue();
}
while (queue.Count > 0);
TakeRangeFromEndIterator(source,
isStartIndexFromEnd: true, startIndex: count,
isEndIndexFromEnd: true, endIndex: 0);
}
}
}
Loading
, 'i'); if (__m === '*' || __re.test(location.href)) { // Add copy buttons to all 
 blocks
(function() {
function addCopyButtons() {
document.querySelectorAll('pre code').forEach(function(codeBlock) {
if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;
codeBlock.parentElement.setAttribute('data-copy-added', 'true');
var btn = document.createElement('button');
btn.textContent = 'Copy';
btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';
btn.onmouseover = function() { this.style.opacity = '1'; };
btn.onmouseout = function() { this.style.opacity = '0.7'; };
btn.onclick = function() {
navigator.clipboard.writeText(codeBlock.textContent).then(function() {
btn.textContent = 'Copied!';
setTimeout(function() { btn.textContent = 'Copy'; }, 1500);
});
};
codeBlock.parentElement.style.position = 'relative';
codeBlock.parentElement.appendChild(btn);
});
}
addCopyButtons();
// Re-run on dynamic content
var observer = new MutationObserver(addCopyButtons);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '
Apply optimizations and fixes to Enumerable.Take(Range) by eiriktsarpalis · Pull Request #48634 · dotnet/runtime · GitHub
Skip to content
Apply optimizations and fixes to Enumerable.Take(Range)#48634

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

eiriktsarpalis
merged 14 commits into

from

Mar 1, 2021
 Merged


Apply optimizations and fixes to Enumerable.Take(Range)
#48634
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


14 commits


Select commit
Hold shift + click to select a range
f38c0d6

optimize Take(Range) for countable enumerables


eiriktsarpalis Feb 22, 2021
a5339bb

Implement TakeLast over Take(Range)


eiriktsarpalis Feb 23, 2021
e1bd78c

Implement SkipLast over Take(Range)


eiriktsarpalis Feb 23, 2021
3558108

remove unneeded checked increment


eiriktsarpalis Feb 23, 2021
b89a0de

fix typo in tests


eiriktsarpalis Feb 24, 2021
faed507

remove ToLookup inputs from NonEnumeratedCount tests


eiriktsarpalis Feb 24, 2021
7dad846

remove leftover code


eiriktsarpalis Feb 24, 2021
cd1c805

Revert "remove ToLookup inputs from NonEnumeratedCount tests"


eiriktsarpalis Feb 24, 2021
9478f52

try debugging test failure


eiriktsarpalis Feb 25, 2021
101ad8e

remove ToLookup inputs from NonEnumeratedCount tests


eiriktsarpalis Feb 24, 2021
0c06999

Revert "try debugging test failure"


eiriktsarpalis Feb 25, 2021
5dbf307

Update src/libraries/System.Linq/src/System/Linq/Take.cs


eiriktsarpalis Feb 27, 2021
25e7058

eliminate redundant yield breaks


eiriktsarpalis Feb 27, 2021
554bd9d

remove accidentally reverted change


eiriktsarpalis Feb 27, 2021

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


33 changes: 3 additions & 30 deletions
src/libraries/System.Linq/src/System/Linq/Skip.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -121,36 +121,9 @@ public static IEnumerable<TSource> SkipLast<TSource>(this IEnumerable<TSource> s

 return count <= 0 ?
 source.Skip(0) :
 SkipLastIterator(source, count);
 }

 private static IEnumerable<TSource> SkipLastIterator<TSource>(IEnumerable<TSource> source, int count)
 {
 Debug.Assert(source != null);
 Debug.Assert(count > 0);

 var queue = new Queue<TSource>();

 using (IEnumerator<TSource> e = source.GetEnumerator())
 {
 while (e.MoveNext())
 {
 if (queue.Count == count)
 {
 do
 {
 yield return queue.Dequeue();
 queue.Enqueue(e.Current);
 }
 while (e.MoveNext());
 break;
 }
 else
 {
 queue.Enqueue(e.Current);
 }
 }
 }
 TakeRangeFromEndIterator(source,
 isStartIndexFromEnd: false, startIndex: 0,
 isEndIndexFromEnd: true, endIndex: count);
 }
 }
}

25 changes: 25 additions & 0 deletions
src/libraries/System.Linq/src/System/Linq/Take.SizeOpt.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -18,5 +18,30 @@ private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> s
 if (--count == 0) break;
 }
 }

 private static IEnumerable<TSource> TakeRangeIterator<TSource>(IEnumerable<TSource> source, int startIndex, int endIndex)
 {
 Debug.Assert(source != null);
 Debug.Assert(startIndex >= 0 && startIndex < endIndex);

 using IEnumerator<TSource> e = source.GetEnumerator();

 int index = 0;
 while (index < startIndex && e.MoveNext())
 {
 ++index;
 }

 if (index < startIndex)
 {
 yield break;
 }

 while (index < endIndex && e.MoveNext())
 {
 yield return e.Current;
 ++index;
 }
 }
 }
}

32 changes: 28 additions & 4 deletions
src/libraries/System.Linq/src/System/Linq/Take.SpeedOpt.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -2,14 +2,38 @@
// The .NET Foundation licenses this file to you under the MIT license.

using System.Collections.Generic;
using System.Diagnostics;

namespace System.Linq
{
 public static partial class Enumerable
 {
 private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> source, int count) =>
 source is IPartition<TSource> partition ? partition.Take(count) :
 source is IList<TSource> sourceList ? (IEnumerable<TSource>)new ListPartition<TSource>(sourceList, 0, count - 1) :
 new EnumerablePartition<TSource>(source, 0, count - 1);
 private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> source, int count)
 {
 Debug.Assert(source != null);
 Debug.Assert(count > 0);

 return
 source is IPartition<TSource> partition ? partition.Take(count) :
 source is IList<TSource> sourceList ? new ListPartition<TSource>(sourceList, 0, count - 1) :
 new EnumerablePartition<TSource>(source, 0, count - 1);
 }

 private static IEnumerable<TSource> TakeRangeIterator<TSource>(IEnumerable<TSource> source, int startIndex, int endIndex)
 {
 Debug.Assert(source != null);
 Debug.Assert(startIndex >= 0 && startIndex < endIndex);

 return
 source is IPartition<TSource> partition ? TakePartitionRange(partition, startIndex, endIndex) :
 source is IList<TSource> sourceList ? new ListPartition<TSource>(sourceList, startIndex, endIndex - 1) :
 new EnumerablePartition<TSource>(source, startIndex, endIndex - 1);

 static IPartition<TSource> TakePartitionRange(IPartition<TSource> partition, int startIndex, int endIndex)
 {
 partition = endIndex == 0 ? EmptyPartition<TSource>.Instance : partition.Take(endIndex);
 return startIndex == 0 ? partition : partition.Skip(startIndex);
 }
Comment thread
eiriktsarpalis marked this conversation as resolved.

 }
 }
}

195 changes: 81 additions & 114 deletions
src/libraries/System.Linq/src/System/Linq/Take.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -55,121 +55,129 @@ public static IEnumerable<TSource> Take<TSource>(this IEnumerable<TSource> sourc
 {
 return startIndex >= endIndex
 ? Empty<TSource>()
 : source.Skip(startIndex).Take(endIndex - startIndex);
 : TakeRangeIterator(source, startIndex, endIndex);
 }

 return TakeIterator(source, isStartIndexFromEnd, startIndex, isEndIndexFromEnd, endIndex);
 return TakeRangeFromEndIterator(source, isStartIndexFromEnd, startIndex, isEndIndexFromEnd, endIndex);
 }

 private static IEnumerable<TSource> TakeIterator<TSource>(
 IEnumerable<TSource> source, bool isStartIndexFromEnd, int startIndex, bool isEndIndexFromEnd, int endIndex)
 private static IEnumerable<TSource> TakeRangeFromEndIterator<TSource>(IEnumerable<TSource> source, bool isStartIndexFromEnd, int startIndex, bool isEndIndexFromEnd, int endIndex)
 {
 Debug.Assert(source != null);
 Debug.Assert(isStartIndexFromEnd || isEndIndexFromEnd);
 Debug.Assert(isStartIndexFromEnd
 ? startIndex > 0 && (!isEndIndexFromEnd || startIndex > endIndex)
 : startIndex >= 0 && (isEndIndexFromEnd || startIndex < endIndex));
 Debug.Assert(endIndex >= 0);

 using IEnumerator<TSource> e = source.GetEnumerator();
 if (isStartIndexFromEnd)
 // Attempt to extract the count of the source enumerator,
 // in order to convert fromEnd indices to regular indices.
 // Enumerable counts can change over time, so it is very
 // important that this check happens at enumeration time;
 // do not move it outside of the iterator method.
 if (source.TryGetNonEnumeratedCount(out int count))
 {
 if (!e.MoveNext())
 {
 yield break;
 }

 int index = 0;
 Queue<TSource> queue = new();
 queue.Enqueue(e.Current);
 startIndex = CalculateStartIndex(isStartIndexFromEnd, startIndex, count);
 endIndex = CalculateEndIndex(isEndIndexFromEnd, endIndex, count);

while (e.MoveNext())
if (startIndex < endIndex)
 {
checked
foreach (TSource element in TakeRangeIterator(source, startIndex, endIndex))
 {
index++;
yield return element;
 }
 }

 yield break;
 }

 Queue<TSource> queue;

 if (queue.Count == startIndex)
 if (isStartIndexFromEnd)
 {
 // TakeLast compat: enumerator should be disposed before yielding the first element.
 using (IEnumerator<TSource> e = source.GetEnumerator())
 {
 if (!e.MoveNext())
 {
queue.Dequeue();
yield break;
 }

 queue = new Queue<TSource>();
 queue.Enqueue(e.Current);
 }

 int count = checked(index + 1);
 Debug.Assert(queue.Count == Math.Min(count, startIndex));
 count = 1;

 startIndex = count - startIndex;
 if (startIndex < 0)
 {
 startIndex = 0;
 }
 while (e.MoveNext())
 {
 if (count < startIndex)
 {
 queue.Enqueue(e.Current);
 ++count;
 }
 else
 {
 do
 {
 queue.Dequeue();
 queue.Enqueue(e.Current);
 checked { ++count; }
 } while (e.MoveNext());
 break;
 }
 }

 if (isEndIndexFromEnd)
 {
 endIndex = count - endIndex;
 }
 else if (endIndex > count)
 {
 endIndex = count;
 Debug.Assert(queue.Count == Math.Min(count, startIndex));
 }

 startIndex = CalculateStartIndex(isStartIndexFromEnd: true, startIndex, count);
 endIndex = CalculateEndIndex(isEndIndexFromEnd, endIndex, count);
 Debug.Assert(endIndex - startIndex <= queue.Count);

 for (int rangeIndex = startIndex; rangeIndex < endIndex; rangeIndex++)
 {
 yield return queue.Dequeue();
 }
 }
 else
 {
 int index = 0;
 while (index <= startIndex)
 {
 if (!e.MoveNext())
 {
 yield break;
 }
 Debug.Assert(!isStartIndexFromEnd && isEndIndexFromEnd);

 checked
 {
 index++;
 }
 // SkipLast compat: the enumerator should be disposed at the end of the enumeration.
 using IEnumerator<TSource> e = source.GetEnumerator();

 count = 0;
 while (count < startIndex && e.MoveNext())
 {
 ++count;
 }

 if (isEndIndexFromEnd)
 if (count == startIndex)
 {
 if (endIndex > 0)
 queue = new Queue<TSource>();
 while (e.MoveNext())
 {
 Queue<TSource> queue = new();
 do
 if (queue.Count == endIndex)
 {
if (queue.Count == endIndex)
do
 {
 queue.Enqueue(e.Current);
 yield return queue.Dequeue();
 }
 } while (e.MoveNext());

 queue.Enqueue(e.Current);
 } while (e.MoveNext());
 }
 else
 {
 do
 break;
 }
 else
 {
 yield return e.Current;
 } while (e.MoveNext());
 }
 }
 else
 {
 Debug.Assert(index < endIndex);
 yield return e.Current;
 while (checked(++index) < endIndex && e.MoveNext())
 {
 yield return e.Current;
 queue.Enqueue(e.Current);
 }
 }
 }
 }

 static int CalculateStartIndex(bool isStartIndexFromEnd, int startIndex, int count) =>
 Math.Max(0, isStartIndexFromEnd ? count - startIndex : startIndex);

 static int CalculateEndIndex(bool isEndIndexFromEnd, int endIndex, int count) =>
 Math.Min(count, isEndIndexFromEnd ? count - endIndex : endIndex);
 }

 public static IEnumerable<TSource> TakeWhile<TSource>(this IEnumerable<TSource> source, Func<TSource, bool> predicate)
Expand DownExpand Up@@ -243,50 +251,9 @@ public static IEnumerable<TSource> TakeLast<TSource>(this IEnumerable<TSource> s

 return count <= 0 ?
 Empty<TSource>() :
 TakeLastIterator(source, count);
 }

 private static IEnumerable<TSource> TakeLastIterator<TSource>(IEnumerable<TSource> source, int count)
 {
 Debug.Assert(source != null);
 Debug.Assert(count > 0);

 Queue<TSource> queue;
 using (IEnumerator<TSource> e = source.GetEnumerator())
 {
 if (!e.MoveNext())
 {
 yield break;
 }

 queue = new Queue<TSource>();
 queue.Enqueue(e.Current);

 while (e.MoveNext())
 {
 if (queue.Count < count)
 {
 queue.Enqueue(e.Current);
 }
 else
 {
 do
 {
 queue.Dequeue();
 queue.Enqueue(e.Current);
 }
 while (e.MoveNext());
 break;
 }
 }
 }

 Debug.Assert(queue.Count <= count);
 do
 {
 yield return queue.Dequeue();
 }
 while (queue.Count > 0);
 TakeRangeFromEndIterator(source,
 isStartIndexFromEnd: true, startIndex: count,
 isEndIndexFromEnd: true, endIndex: 0);
 }
 }
}
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Force GitHub README to respect dark mode
(function() {
var style = document.createElement('style');
style.textContent = '
.markdown-body {
color-scheme: dark light;
}
.markdown-body pre { background: #161b22 !important; }
.markdown-body code { background: rgba(110, 118, 129, 0.4) !important; }
.markdown-body table th, .markdown-body table td { border-color: #30363d !important; }
.markdown-body img { background: #0d1117; }
.markdown-body blockquote { border-left-color: #8b949e; }
.markdown-body hr { border-color: #30363d; }
';
document.head.appendChild(style);
})();
}
} catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Apply optimizations and fixes to Enumerable.Take(Range) by eiriktsarpalis · Pull Request #48634 · dotnet/runtime · GitHub
Skip to content
Apply optimizations and fixes to Enumerable.Take(Range)#48634

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

eiriktsarpalis
merged 14 commits into

from

Mar 1, 2021
 Merged


Apply optimizations and fixes to Enumerable.Take(Range)
#48634
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


14 commits


Select commit
Hold shift + click to select a range
f38c0d6

optimize Take(Range) for countable enumerables


eiriktsarpalis Feb 22, 2021
a5339bb

Implement TakeLast over Take(Range)


eiriktsarpalis Feb 23, 2021
e1bd78c

Implement SkipLast over Take(Range)


eiriktsarpalis Feb 23, 2021
3558108

remove unneeded checked increment


eiriktsarpalis Feb 23, 2021
b89a0de

fix typo in tests


eiriktsarpalis Feb 24, 2021
faed507

remove ToLookup inputs from NonEnumeratedCount tests


eiriktsarpalis Feb 24, 2021
7dad846

remove leftover code


eiriktsarpalis Feb 24, 2021
cd1c805

Revert "remove ToLookup inputs from NonEnumeratedCount tests"


eiriktsarpalis Feb 24, 2021
9478f52

try debugging test failure


eiriktsarpalis Feb 25, 2021
101ad8e

remove ToLookup inputs from NonEnumeratedCount tests


eiriktsarpalis Feb 24, 2021
0c06999

Revert "try debugging test failure"


eiriktsarpalis Feb 25, 2021
5dbf307

Update src/libraries/System.Linq/src/System/Linq/Take.cs


eiriktsarpalis Feb 27, 2021
25e7058

eliminate redundant yield breaks


eiriktsarpalis Feb 27, 2021
554bd9d

remove accidentally reverted change


eiriktsarpalis Feb 27, 2021

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


33 changes: 3 additions & 30 deletions
src/libraries/System.Linq/src/System/Linq/Skip.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -121,36 +121,9 @@ public static IEnumerable<TSource> SkipLast<TSource>(this IEnumerable<TSource> s

 return count <= 0 ?
 source.Skip(0) :
 SkipLastIterator(source, count);
 }

 private static IEnumerable<TSource> SkipLastIterator<TSource>(IEnumerable<TSource> source, int count)
 {
 Debug.Assert(source != null);
 Debug.Assert(count > 0);

 var queue = new Queue<TSource>();

 using (IEnumerator<TSource> e = source.GetEnumerator())
 {
 while (e.MoveNext())
 {
 if (queue.Count == count)
 {
 do
 {
 yield return queue.Dequeue();
 queue.Enqueue(e.Current);
 }
 while (e.MoveNext());
 break;
 }
 else
 {
 queue.Enqueue(e.Current);
 }
 }
 }
 TakeRangeFromEndIterator(source,
 isStartIndexFromEnd: false, startIndex: 0,
 isEndIndexFromEnd: true, endIndex: count);
 }
 }
}

25 changes: 25 additions & 0 deletions
src/libraries/System.Linq/src/System/Linq/Take.SizeOpt.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -18,5 +18,30 @@ private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> s
 if (--count == 0) break;
 }
 }

 private static IEnumerable<TSource> TakeRangeIterator<TSource>(IEnumerable<TSource> source, int startIndex, int endIndex)
 {
 Debug.Assert(source != null);
 Debug.Assert(startIndex >= 0 && startIndex < endIndex);

 using IEnumerator<TSource> e = source.GetEnumerator();

 int index = 0;
 while (index < startIndex && e.MoveNext())
 {
 ++index;
 }

 if (index < startIndex)
 {
 yield break;
 }

 while (index < endIndex && e.MoveNext())
 {
 yield return e.Current;
 ++index;
 }
 }
 }
}

32 changes: 28 additions & 4 deletions
src/libraries/System.Linq/src/System/Linq/Take.SpeedOpt.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -2,14 +2,38 @@
// The .NET Foundation licenses this file to you under the MIT license.

using System.Collections.Generic;
using System.Diagnostics;

namespace System.Linq
{
 public static partial class Enumerable
 {
 private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> source, int count) =>
 source is IPartition<TSource> partition ? partition.Take(count) :
 source is IList<TSource> sourceList ? (IEnumerable<TSource>)new ListPartition<TSource>(sourceList, 0, count - 1) :
 new EnumerablePartition<TSource>(source, 0, count - 1);
 private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> source, int count)
 {
 Debug.Assert(source != null);
 Debug.Assert(count > 0);

 return
 source is IPartition<TSource> partition ? partition.Take(count) :
 source is IList<TSource> sourceList ? new ListPartition<TSource>(sourceList, 0, count - 1) :
 new EnumerablePartition<TSource>(source, 0, count - 1);
 }

 private static IEnumerable<TSource> TakeRangeIterator<TSource>(IEnumerable<TSource> source, int startIndex, int endIndex)
 {
 Debug.Assert(source != null);
 Debug.Assert(startIndex >= 0 && startIndex < endIndex);

 return
 source is IPartition<TSource> partition ? TakePartitionRange(partition, startIndex, endIndex) :
 source is IList<TSource> sourceList ? new ListPartition<TSource>(sourceList, startIndex, endIndex - 1) :
 new EnumerablePartition<TSource>(source, startIndex, endIndex - 1);

 static IPartition<TSource> TakePartitionRange(IPartition<TSource> partition, int startIndex, int endIndex)
 {
 partition = endIndex == 0 ? EmptyPartition<TSource>.Instance : partition.Take(endIndex);
 return startIndex == 0 ? partition : partition.Skip(startIndex);
 }
Comment thread
eiriktsarpalis marked this conversation as resolved.

 }
 }
}

195 changes: 81 additions & 114 deletions
src/libraries/System.Linq/src/System/Linq/Take.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -55,121 +55,129 @@ public static IEnumerable<TSource> Take<TSource>(this IEnumerable<TSource> sourc
 {
 return startIndex >= endIndex
 ? Empty<TSource>()
 : source.Skip(startIndex).Take(endIndex - startIndex);
 : TakeRangeIterator(source, startIndex, endIndex);
 }

 return TakeIterator(source, isStartIndexFromEnd, startIndex, isEndIndexFromEnd, endIndex);
 return TakeRangeFromEndIterator(source, isStartIndexFromEnd, startIndex, isEndIndexFromEnd, endIndex);
 }

 private static IEnumerable<TSource> TakeIterator<TSource>(
 IEnumerable<TSource> source, bool isStartIndexFromEnd, int startIndex, bool isEndIndexFromEnd, int endIndex)
 private static IEnumerable<TSource> TakeRangeFromEndIterator<TSource>(IEnumerable<TSource> source, bool isStartIndexFromEnd, int startIndex, bool isEndIndexFromEnd, int endIndex)
 {
 Debug.Assert(source != null);
 Debug.Assert(isStartIndexFromEnd || isEndIndexFromEnd);
 Debug.Assert(isStartIndexFromEnd
 ? startIndex > 0 && (!isEndIndexFromEnd || startIndex > endIndex)
 : startIndex >= 0 && (isEndIndexFromEnd || startIndex < endIndex));
 Debug.Assert(endIndex >= 0);

 using IEnumerator<TSource> e = source.GetEnumerator();
 if (isStartIndexFromEnd)
 // Attempt to extract the count of the source enumerator,
 // in order to convert fromEnd indices to regular indices.
 // Enumerable counts can change over time, so it is very
 // important that this check happens at enumeration time;
 // do not move it outside of the iterator method.
 if (source.TryGetNonEnumeratedCount(out int count))
 {
 if (!e.MoveNext())
 {
 yield break;
 }

 int index = 0;
 Queue<TSource> queue = new();
 queue.Enqueue(e.Current);
 startIndex = CalculateStartIndex(isStartIndexFromEnd, startIndex, count);
 endIndex = CalculateEndIndex(isEndIndexFromEnd, endIndex, count);

while (e.MoveNext())
if (startIndex < endIndex)
 {
checked
foreach (TSource element in TakeRangeIterator(source, startIndex, endIndex))
 {
index++;
yield return element;
 }
 }

 yield break;
 }

 Queue<TSource> queue;

 if (queue.Count == startIndex)
 if (isStartIndexFromEnd)
 {
 // TakeLast compat: enumerator should be disposed before yielding the first element.
 using (IEnumerator<TSource> e = source.GetEnumerator())
 {
 if (!e.MoveNext())
 {
queue.Dequeue();
yield break;
 }

 queue = new Queue<TSource>();
 queue.Enqueue(e.Current);
 }

 int count = checked(index + 1);
 Debug.Assert(queue.Count == Math.Min(count, startIndex));
 count = 1;

 startIndex = count - startIndex;
 if (startIndex < 0)
 {
 startIndex = 0;
 }
 while (e.MoveNext())
 {
 if (count < startIndex)
 {
 queue.Enqueue(e.Current);
 ++count;
 }
 else
 {
 do
 {
 queue.Dequeue();
 queue.Enqueue(e.Current);
 checked { ++count; }
 } while (e.MoveNext());
 break;
 }
 }

 if (isEndIndexFromEnd)
 {
 endIndex = count - endIndex;
 }
 else if (endIndex > count)
 {
 endIndex = count;
 Debug.Assert(queue.Count == Math.Min(count, startIndex));
 }

 startIndex = CalculateStartIndex(isStartIndexFromEnd: true, startIndex, count);
 endIndex = CalculateEndIndex(isEndIndexFromEnd, endIndex, count);
 Debug.Assert(endIndex - startIndex <= queue.Count);

 for (int rangeIndex = startIndex; rangeIndex < endIndex; rangeIndex++)
 {
 yield return queue.Dequeue();
 }
 }
 else
 {
 int index = 0;
 while (index <= startIndex)
 {
 if (!e.MoveNext())
 {
 yield break;
 }
 Debug.Assert(!isStartIndexFromEnd && isEndIndexFromEnd);

 checked
 {
 index++;
 }
 // SkipLast compat: the enumerator should be disposed at the end of the enumeration.
 using IEnumerator<TSource> e = source.GetEnumerator();

 count = 0;
 while (count < startIndex && e.MoveNext())
 {
 ++count;
 }

 if (isEndIndexFromEnd)
 if (count == startIndex)
 {
 if (endIndex > 0)
 queue = new Queue<TSource>();
 while (e.MoveNext())
 {
 Queue<TSource> queue = new();
 do
 if (queue.Count == endIndex)
 {
if (queue.Count == endIndex)
do
 {
 queue.Enqueue(e.Current);
 yield return queue.Dequeue();
 }
 } while (e.MoveNext());

 queue.Enqueue(e.Current);
 } while (e.MoveNext());
 }
 else
 {
 do
 break;
 }
 else
 {
 yield return e.Current;
 } while (e.MoveNext());
 }
 }
 else
 {
 Debug.Assert(index < endIndex);
 yield return e.Current;
 while (checked(++index) < endIndex && e.MoveNext())
 {
 yield return e.Current;
 queue.Enqueue(e.Current);
 }
 }
 }
 }

 static int CalculateStartIndex(bool isStartIndexFromEnd, int startIndex, int count) =>
 Math.Max(0, isStartIndexFromEnd ? count - startIndex : startIndex);

 static int CalculateEndIndex(bool isEndIndexFromEnd, int endIndex, int count) =>
 Math.Min(count, isEndIndexFromEnd ? count - endIndex : endIndex);
 }

 public static IEnumerable<TSource> TakeWhile<TSource>(this IEnumerable<TSource> source, Func<TSource, bool> predicate)
Expand DownExpand Up@@ -243,50 +251,9 @@ public static IEnumerable<TSource> TakeLast<TSource>(this IEnumerable<TSource> s

 return count <= 0 ?
 Empty<TSource>() :
 TakeLastIterator(source, count);
 }

 private static IEnumerable<TSource> TakeLastIterator<TSource>(IEnumerable<TSource> source, int count)
 {
 Debug.Assert(source != null);
 Debug.Assert(count > 0);

 Queue<TSource> queue;
 using (IEnumerator<TSource> e = source.GetEnumerator())
 {
 if (!e.MoveNext())
 {
 yield break;
 }

 queue = new Queue<TSource>();
 queue.Enqueue(e.Current);

 while (e.MoveNext())
 {
 if (queue.Count < count)
 {
 queue.Enqueue(e.Current);
 }
 else
 {
 do
 {
 queue.Dequeue();
 queue.Enqueue(e.Current);
 }
 while (e.MoveNext());
 break;
 }
 }
 }

 Debug.Assert(queue.Count <= count);
 do
 {
 yield return queue.Dequeue();
 }
 while (queue.Count > 0);
 TakeRangeFromEndIterator(source,
 isStartIndexFromEnd: true, startIndex: count,
 isEndIndexFromEnd: true, endIndex: 0);
 }
 }
}
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Highlight search terms from Google/DuckDuckGo/Bing referrer
(function() {
var ref = document.referrer;
var terms = [];
if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) {
var url = new URL(ref);
var q = url.searchParams.get('q') || url.searchParams.get('p');
if (q) {
terms = q.split(/\s+/).filter(function(t) { return t.length > 2; });
}
}
if (terms.length === 0) return;
var style = document.createElement('style');
style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }';
document.head.appendChild(style);
function highlight(node) {
if (node.nodeType === 3) { // text node
var text = node.textContent;
var found = false;
terms.forEach(function(term) {
var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\]\\]/g, '\\') + ')', 'gi');
if (regex.test(text)) {
found = true;
var frag = document.createDocumentFragment();
var parts = text.split(regex);
parts.forEach(function(part, i) {
if (i % 2 === 0) {
frag.appendChild(document.createTextNode(part));
} else {
var span = document.createElement('span');
span.className = 'userscript-highlight';
span.textContent = part;
frag.appendChild(span);
}
});
node.parentNode.replaceChild(frag, node);
}
});
} else if (node.nodeType === 1 && node.childNodes) { // element
var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT'];
if (!skipTags.includes(node.tagName)) {
Array.from(node.childNodes).forEach(highlight);
}
}
}
highlight(document.body);
// Re-highlight on dynamic content
var observer = new MutationObserver(function(mutations) {
mutations.forEach(function(m) {
m.addedNodes.forEach(function(node) {
if (node.nodeType === 1 || node.nodeType === 3) highlight(node);
});
});
});
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Apply optimizations and fixes to Enumerable.Take(Range) by eiriktsarpalis · Pull Request #48634 · dotnet/runtime · GitHub
Skip to content
Apply optimizations and fixes to Enumerable.Take(Range)#48634

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

eiriktsarpalis
merged 14 commits into

from

Mar 1, 2021
 Merged


Apply optimizations and fixes to Enumerable.Take(Range)
#48634
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


14 commits


Select commit
Hold shift + click to select a range
f38c0d6

optimize Take(Range) for countable enumerables


eiriktsarpalis Feb 22, 2021
a5339bb

Implement TakeLast over Take(Range)


eiriktsarpalis Feb 23, 2021
e1bd78c

Implement SkipLast over Take(Range)


eiriktsarpalis Feb 23, 2021
3558108

remove unneeded checked increment


eiriktsarpalis Feb 23, 2021
b89a0de

fix typo in tests


eiriktsarpalis Feb 24, 2021
faed507

remove ToLookup inputs from NonEnumeratedCount tests


eiriktsarpalis Feb 24, 2021
7dad846

remove leftover code


eiriktsarpalis Feb 24, 2021
cd1c805

Revert "remove ToLookup inputs from NonEnumeratedCount tests"


eiriktsarpalis Feb 24, 2021
9478f52

try debugging test failure


eiriktsarpalis Feb 25, 2021
101ad8e

remove ToLookup inputs from NonEnumeratedCount tests


eiriktsarpalis Feb 24, 2021
0c06999

Revert "try debugging test failure"


eiriktsarpalis Feb 25, 2021
5dbf307

Update src/libraries/System.Linq/src/System/Linq/Take.cs


eiriktsarpalis Feb 27, 2021
25e7058

eliminate redundant yield breaks


eiriktsarpalis Feb 27, 2021
554bd9d

remove accidentally reverted change


eiriktsarpalis Feb 27, 2021

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


33 changes: 3 additions & 30 deletions
src/libraries/System.Linq/src/System/Linq/Skip.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -121,36 +121,9 @@ public static IEnumerable<TSource> SkipLast<TSource>(this IEnumerable<TSource> s

 return count <= 0 ?
 source.Skip(0) :
 SkipLastIterator(source, count);
 }

 private static IEnumerable<TSource> SkipLastIterator<TSource>(IEnumerable<TSource> source, int count)
 {
 Debug.Assert(source != null);
 Debug.Assert(count > 0);

 var queue = new Queue<TSource>();

 using (IEnumerator<TSource> e = source.GetEnumerator())
 {
 while (e.MoveNext())
 {
 if (queue.Count == count)
 {
 do
 {
 yield return queue.Dequeue();
 queue.Enqueue(e.Current);
 }
 while (e.MoveNext());
 break;
 }
 else
 {
 queue.Enqueue(e.Current);
 }
 }
 }
 TakeRangeFromEndIterator(source,
 isStartIndexFromEnd: false, startIndex: 0,
 isEndIndexFromEnd: true, endIndex: count);
 }
 }
}

25 changes: 25 additions & 0 deletions
src/libraries/System.Linq/src/System/Linq/Take.SizeOpt.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -18,5 +18,30 @@ private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> s
 if (--count == 0) break;
 }
 }

 private static IEnumerable<TSource> TakeRangeIterator<TSource>(IEnumerable<TSource> source, int startIndex, int endIndex)
 {
 Debug.Assert(source != null);
 Debug.Assert(startIndex >= 0 && startIndex < endIndex);

 using IEnumerator<TSource> e = source.GetEnumerator();

 int index = 0;
 while (index < startIndex && e.MoveNext())
 {
 ++index;
 }

 if (index < startIndex)
 {
 yield break;
 }

 while (index < endIndex && e.MoveNext())
 {
 yield return e.Current;
 ++index;
 }
 }
 }
}

32 changes: 28 additions & 4 deletions
src/libraries/System.Linq/src/System/Linq/Take.SpeedOpt.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -2,14 +2,38 @@
// The .NET Foundation licenses this file to you under the MIT license.

using System.Collections.Generic;
using System.Diagnostics;

namespace System.Linq
{
 public static partial class Enumerable
 {
 private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> source, int count) =>
 source is IPartition<TSource> partition ? partition.Take(count) :
 source is IList<TSource> sourceList ? (IEnumerable<TSource>)new ListPartition<TSource>(sourceList, 0, count - 1) :
 new EnumerablePartition<TSource>(source, 0, count - 1);
 private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> source, int count)
 {
 Debug.Assert(source != null);
 Debug.Assert(count > 0);

 return
 source is IPartition<TSource> partition ? partition.Take(count) :
 source is IList<TSource> sourceList ? new ListPartition<TSource>(sourceList, 0, count - 1) :
 new EnumerablePartition<TSource>(source, 0, count - 1);
 }

 private static IEnumerable<TSource> TakeRangeIterator<TSource>(IEnumerable<TSource> source, int startIndex, int endIndex)
 {
 Debug.Assert(source != null);
 Debug.Assert(startIndex >= 0 && startIndex < endIndex);

 return
 source is IPartition<TSource> partition ? TakePartitionRange(partition, startIndex, endIndex) :
 source is IList<TSource> sourceList ? new ListPartition<TSource>(sourceList, startIndex, endIndex - 1) :
 new EnumerablePartition<TSource>(source, startIndex, endIndex - 1);

 static IPartition<TSource> TakePartitionRange(IPartition<TSource> partition, int startIndex, int endIndex)
 {
 partition = endIndex == 0 ? EmptyPartition<TSource>.Instance : partition.Take(endIndex);
 return startIndex == 0 ? partition : partition.Skip(startIndex);
 }
Comment thread
eiriktsarpalis marked this conversation as resolved.

 }
 }
}

195 changes: 81 additions & 114 deletions
src/libraries/System.Linq/src/System/Linq/Take.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -55,121 +55,129 @@ public static IEnumerable<TSource> Take<TSource>(this IEnumerable<TSource> sourc
 {
 return startIndex >= endIndex
 ? Empty<TSource>()
 : source.Skip(startIndex).Take(endIndex - startIndex);
 : TakeRangeIterator(source, startIndex, endIndex);
 }

 return TakeIterator(source, isStartIndexFromEnd, startIndex, isEndIndexFromEnd, endIndex);
 return TakeRangeFromEndIterator(source, isStartIndexFromEnd, startIndex, isEndIndexFromEnd, endIndex);
 }

 private static IEnumerable<TSource> TakeIterator<TSource>(
 IEnumerable<TSource> source, bool isStartIndexFromEnd, int startIndex, bool isEndIndexFromEnd, int endIndex)
 private static IEnumerable<TSource> TakeRangeFromEndIterator<TSource>(IEnumerable<TSource> source, bool isStartIndexFromEnd, int startIndex, bool isEndIndexFromEnd, int endIndex)
 {
 Debug.Assert(source != null);
 Debug.Assert(isStartIndexFromEnd || isEndIndexFromEnd);
 Debug.Assert(isStartIndexFromEnd
 ? startIndex > 0 && (!isEndIndexFromEnd || startIndex > endIndex)
 : startIndex >= 0 && (isEndIndexFromEnd || startIndex < endIndex));
 Debug.Assert(endIndex >= 0);

 using IEnumerator<TSource> e = source.GetEnumerator();
 if (isStartIndexFromEnd)
 // Attempt to extract the count of the source enumerator,
 // in order to convert fromEnd indices to regular indices.
 // Enumerable counts can change over time, so it is very
 // important that this check happens at enumeration time;
 // do not move it outside of the iterator method.
 if (source.TryGetNonEnumeratedCount(out int count))
 {
 if (!e.MoveNext())
 {
 yield break;
 }

 int index = 0;
 Queue<TSource> queue = new();
 queue.Enqueue(e.Current);
 startIndex = CalculateStartIndex(isStartIndexFromEnd, startIndex, count);
 endIndex = CalculateEndIndex(isEndIndexFromEnd, endIndex, count);

while (e.MoveNext())
if (startIndex < endIndex)
 {
checked
foreach (TSource element in TakeRangeIterator(source, startIndex, endIndex))
 {
index++;
yield return element;
 }
 }

 yield break;
 }

 Queue<TSource> queue;

 if (queue.Count == startIndex)
 if (isStartIndexFromEnd)
 {
 // TakeLast compat: enumerator should be disposed before yielding the first element.
 using (IEnumerator<TSource> e = source.GetEnumerator())
 {
 if (!e.MoveNext())
 {
queue.Dequeue();
yield break;
 }

 queue = new Queue<TSource>();
 queue.Enqueue(e.Current);
 }

 int count = checked(index + 1);
 Debug.Assert(queue.Count == Math.Min(count, startIndex));
 count = 1;

 startIndex = count - startIndex;
 if (startIndex < 0)
 {
 startIndex = 0;
 }
 while (e.MoveNext())
 {
 if (count < startIndex)
 {
 queue.Enqueue(e.Current);
 ++count;
 }
 else
 {
 do
 {
 queue.Dequeue();
 queue.Enqueue(e.Current);
 checked { ++count; }
 } while (e.MoveNext());
 break;
 }
 }

 if (isEndIndexFromEnd)
 {
 endIndex = count - endIndex;
 }
 else if (endIndex > count)
 {
 endIndex = count;
 Debug.Assert(queue.Count == Math.Min(count, startIndex));
 }

 startIndex = CalculateStartIndex(isStartIndexFromEnd: true, startIndex, count);
 endIndex = CalculateEndIndex(isEndIndexFromEnd, endIndex, count);
 Debug.Assert(endIndex - startIndex <= queue.Count);

 for (int rangeIndex = startIndex; rangeIndex < endIndex; rangeIndex++)
 {
 yield return queue.Dequeue();
 }
 }
 else
 {
 int index = 0;
 while (index <= startIndex)
 {
 if (!e.MoveNext())
 {
 yield break;
 }
 Debug.Assert(!isStartIndexFromEnd && isEndIndexFromEnd);

 checked
 {
 index++;
 }
 // SkipLast compat: the enumerator should be disposed at the end of the enumeration.
 using IEnumerator<TSource> e = source.GetEnumerator();

 count = 0;
 while (count < startIndex && e.MoveNext())
 {
 ++count;
 }

 if (isEndIndexFromEnd)
 if (count == startIndex)
 {
 if (endIndex > 0)
 queue = new Queue<TSource>();
 while (e.MoveNext())
 {
 Queue<TSource> queue = new();
 do
 if (queue.Count == endIndex)
 {
if (queue.Count == endIndex)
do
 {
 queue.Enqueue(e.Current);
 yield return queue.Dequeue();
 }
 } while (e.MoveNext());

 queue.Enqueue(e.Current);
 } while (e.MoveNext());
 }
 else
 {
 do
 break;
 }
 else
 {
 yield return e.Current;
 } while (e.MoveNext());
 }
 }
 else
 {
 Debug.Assert(index < endIndex);
 yield return e.Current;
 while (checked(++index) < endIndex && e.MoveNext())
 {
 yield return e.Current;
 queue.Enqueue(e.Current);
 }
 }
 }
 }

 static int CalculateStartIndex(bool isStartIndexFromEnd, int startIndex, int count) =>
 Math.Max(0, isStartIndexFromEnd ? count - startIndex : startIndex);

 static int CalculateEndIndex(bool isEndIndexFromEnd, int endIndex, int count) =>
 Math.Min(count, isEndIndexFromEnd ? count - endIndex : endIndex);
 }

 public static IEnumerable<TSource> TakeWhile<TSource>(this IEnumerable<TSource> source, Func<TSource, bool> predicate)
Expand DownExpand Up@@ -243,50 +251,9 @@ public static IEnumerable<TSource> TakeLast<TSource>(this IEnumerable<TSource> s

 return count <= 0 ?
 Empty<TSource>() :
 TakeLastIterator(source, count);
 }

 private static IEnumerable<TSource> TakeLastIterator<TSource>(IEnumerable<TSource> source, int count)
 {
 Debug.Assert(source != null);
 Debug.Assert(count > 0);

 Queue<TSource> queue;
 using (IEnumerator<TSource> e = source.GetEnumerator())
 {
 if (!e.MoveNext())
 {
 yield break;
 }

 queue = new Queue<TSource>();
 queue.Enqueue(e.Current);

 while (e.MoveNext())
 {
 if (queue.Count < count)
 {
 queue.Enqueue(e.Current);
 }
 else
 {
 do
 {
 queue.Dequeue();
 queue.Enqueue(e.Current);
 }
 while (e.MoveNext());
 break;
 }
 }
 }

 Debug.Assert(queue.Count <= count);
 do
 {
 yield return queue.Dequeue();
 }
 while (queue.Count > 0);
 TakeRangeFromEndIterator(source,
 isStartIndexFromEnd: true, startIndex: count,
 isEndIndexFromEnd: true, endIndex: 0);
 }
 }
}
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Strip utm_, fbclid, gclid, etc. from all links on page
(function() {
var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content',
'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid',
'ref', 'ref_src', 'source', 'medium', 'campaign'];
function cleanUrl(url) {
try {
var u = new URL(url, window.location.origin);
var changed = false;
trackingParams.forEach(function(p) {
if (u.searchParams.has(p)) {
u.searchParams.delete(p);
changed = true;
}
});
return changed ? u.toString() : url;
} catch (e) {
return url;
}
}
function cleanLinks() {
document.querySelectorAll('a[href]').forEach(function(a) {
var clean = cleanUrl(a.href);
if (clean !== a.href) a.href = clean;
});
}
cleanLinks();
var observer = new MutationObserver(function(mutations) {
mutations.forEach(function(m) {
m.addedNodes.forEach(function(node) {
if (node.nodeType === 1) {
if (node.tagName === 'A') cleanLinks();
node.querySelectorAll('a[href]').forEach(function(a) {
var clean = cleanUrl(a.href);
if (clean !== a.href) a.href = clean;
});
}
});
});
});
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); }
})();
(function(){
try {
var __m = "youtube.com";
var __re = new RegExp('^' + "youtube\\.com" + '
Apply optimizations and fixes to Enumerable.Take(Range) by eiriktsarpalis · Pull Request #48634 · dotnet/runtime · GitHub
Skip to content
Apply optimizations and fixes to Enumerable.Take(Range)#48634

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

eiriktsarpalis
merged 14 commits into

from

Mar 1, 2021
 Merged


Apply optimizations and fixes to Enumerable.Take(Range)
#48634
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


14 commits


Select commit
Hold shift + click to select a range
f38c0d6

optimize Take(Range) for countable enumerables


eiriktsarpalis Feb 22, 2021
a5339bb

Implement TakeLast over Take(Range)


eiriktsarpalis Feb 23, 2021
e1bd78c

Implement SkipLast over Take(Range)


eiriktsarpalis Feb 23, 2021
3558108

remove unneeded checked increment


eiriktsarpalis Feb 23, 2021
b89a0de

fix typo in tests


eiriktsarpalis Feb 24, 2021
faed507

remove ToLookup inputs from NonEnumeratedCount tests


eiriktsarpalis Feb 24, 2021
7dad846

remove leftover code


eiriktsarpalis Feb 24, 2021
cd1c805

Revert "remove ToLookup inputs from NonEnumeratedCount tests"


eiriktsarpalis Feb 24, 2021
9478f52

try debugging test failure


eiriktsarpalis Feb 25, 2021
101ad8e

remove ToLookup inputs from NonEnumeratedCount tests


eiriktsarpalis Feb 24, 2021
0c06999

Revert "try debugging test failure"


eiriktsarpalis Feb 25, 2021
5dbf307

Update src/libraries/System.Linq/src/System/Linq/Take.cs


eiriktsarpalis Feb 27, 2021
25e7058

eliminate redundant yield breaks


eiriktsarpalis Feb 27, 2021
554bd9d

remove accidentally reverted change


eiriktsarpalis Feb 27, 2021

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


33 changes: 3 additions & 30 deletions
src/libraries/System.Linq/src/System/Linq/Skip.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -121,36 +121,9 @@ public static IEnumerable<TSource> SkipLast<TSource>(this IEnumerable<TSource> s

 return count <= 0 ?
 source.Skip(0) :
 SkipLastIterator(source, count);
 }

 private static IEnumerable<TSource> SkipLastIterator<TSource>(IEnumerable<TSource> source, int count)
 {
 Debug.Assert(source != null);
 Debug.Assert(count > 0);

 var queue = new Queue<TSource>();

 using (IEnumerator<TSource> e = source.GetEnumerator())
 {
 while (e.MoveNext())
 {
 if (queue.Count == count)
 {
 do
 {
 yield return queue.Dequeue();
 queue.Enqueue(e.Current);
 }
 while (e.MoveNext());
 break;
 }
 else
 {
 queue.Enqueue(e.Current);
 }
 }
 }
 TakeRangeFromEndIterator(source,
 isStartIndexFromEnd: false, startIndex: 0,
 isEndIndexFromEnd: true, endIndex: count);
 }
 }
}

25 changes: 25 additions & 0 deletions
src/libraries/System.Linq/src/System/Linq/Take.SizeOpt.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -18,5 +18,30 @@ private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> s
 if (--count == 0) break;
 }
 }

 private static IEnumerable<TSource> TakeRangeIterator<TSource>(IEnumerable<TSource> source, int startIndex, int endIndex)
 {
 Debug.Assert(source != null);
 Debug.Assert(startIndex >= 0 && startIndex < endIndex);

 using IEnumerator<TSource> e = source.GetEnumerator();

 int index = 0;
 while (index < startIndex && e.MoveNext())
 {
 ++index;
 }

 if (index < startIndex)
 {
 yield break;
 }

 while (index < endIndex && e.MoveNext())
 {
 yield return e.Current;
 ++index;
 }
 }
 }
}

32 changes: 28 additions & 4 deletions
src/libraries/System.Linq/src/System/Linq/Take.SpeedOpt.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -2,14 +2,38 @@
// The .NET Foundation licenses this file to you under the MIT license.

using System.Collections.Generic;
using System.Diagnostics;

namespace System.Linq
{
 public static partial class Enumerable
 {
 private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> source, int count) =>
 source is IPartition<TSource> partition ? partition.Take(count) :
 source is IList<TSource> sourceList ? (IEnumerable<TSource>)new ListPartition<TSource>(sourceList, 0, count - 1) :
 new EnumerablePartition<TSource>(source, 0, count - 1);
 private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> source, int count)
 {
 Debug.Assert(source != null);
 Debug.Assert(count > 0);

 return
 source is IPartition<TSource> partition ? partition.Take(count) :
 source is IList<TSource> sourceList ? new ListPartition<TSource>(sourceList, 0, count - 1) :
 new EnumerablePartition<TSource>(source, 0, count - 1);
 }

 private static IEnumerable<TSource> TakeRangeIterator<TSource>(IEnumerable<TSource> source, int startIndex, int endIndex)
 {
 Debug.Assert(source != null);
 Debug.Assert(startIndex >= 0 && startIndex < endIndex);

 return
 source is IPartition<TSource> partition ? TakePartitionRange(partition, startIndex, endIndex) :
 source is IList<TSource> sourceList ? new ListPartition<TSource>(sourceList, startIndex, endIndex - 1) :
 new EnumerablePartition<TSource>(source, startIndex, endIndex - 1);

 static IPartition<TSource> TakePartitionRange(IPartition<TSource> partition, int startIndex, int endIndex)
 {
 partition = endIndex == 0 ? EmptyPartition<TSource>.Instance : partition.Take(endIndex);
 return startIndex == 0 ? partition : partition.Skip(startIndex);
 }
Comment thread
eiriktsarpalis marked this conversation as resolved.

 }
 }
}

195 changes: 81 additions & 114 deletions
src/libraries/System.Linq/src/System/Linq/Take.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -55,121 +55,129 @@ public static IEnumerable<TSource> Take<TSource>(this IEnumerable<TSource> sourc
 {
 return startIndex >= endIndex
 ? Empty<TSource>()
 : source.Skip(startIndex).Take(endIndex - startIndex);
 : TakeRangeIterator(source, startIndex, endIndex);
 }

 return TakeIterator(source, isStartIndexFromEnd, startIndex, isEndIndexFromEnd, endIndex);
 return TakeRangeFromEndIterator(source, isStartIndexFromEnd, startIndex, isEndIndexFromEnd, endIndex);
 }

 private static IEnumerable<TSource> TakeIterator<TSource>(
 IEnumerable<TSource> source, bool isStartIndexFromEnd, int startIndex, bool isEndIndexFromEnd, int endIndex)
 private static IEnumerable<TSource> TakeRangeFromEndIterator<TSource>(IEnumerable<TSource> source, bool isStartIndexFromEnd, int startIndex, bool isEndIndexFromEnd, int endIndex)
 {
 Debug.Assert(source != null);
 Debug.Assert(isStartIndexFromEnd || isEndIndexFromEnd);
 Debug.Assert(isStartIndexFromEnd
 ? startIndex > 0 && (!isEndIndexFromEnd || startIndex > endIndex)
 : startIndex >= 0 && (isEndIndexFromEnd || startIndex < endIndex));
 Debug.Assert(endIndex >= 0);

 using IEnumerator<TSource> e = source.GetEnumerator();
 if (isStartIndexFromEnd)
 // Attempt to extract the count of the source enumerator,
 // in order to convert fromEnd indices to regular indices.
 // Enumerable counts can change over time, so it is very
 // important that this check happens at enumeration time;
 // do not move it outside of the iterator method.
 if (source.TryGetNonEnumeratedCount(out int count))
 {
 if (!e.MoveNext())
 {
 yield break;
 }

 int index = 0;
 Queue<TSource> queue = new();
 queue.Enqueue(e.Current);
 startIndex = CalculateStartIndex(isStartIndexFromEnd, startIndex, count);
 endIndex = CalculateEndIndex(isEndIndexFromEnd, endIndex, count);

while (e.MoveNext())
if (startIndex < endIndex)
 {
checked
foreach (TSource element in TakeRangeIterator(source, startIndex, endIndex))
 {
index++;
yield return element;
 }
 }

 yield break;
 }

 Queue<TSource> queue;

 if (queue.Count == startIndex)
 if (isStartIndexFromEnd)
 {
 // TakeLast compat: enumerator should be disposed before yielding the first element.
 using (IEnumerator<TSource> e = source.GetEnumerator())
 {
 if (!e.MoveNext())
 {
queue.Dequeue();
yield break;
 }

 queue = new Queue<TSource>();
 queue.Enqueue(e.Current);
 }

 int count = checked(index + 1);
 Debug.Assert(queue.Count == Math.Min(count, startIndex));
 count = 1;

 startIndex = count - startIndex;
 if (startIndex < 0)
 {
 startIndex = 0;
 }
 while (e.MoveNext())
 {
 if (count < startIndex)
 {
 queue.Enqueue(e.Current);
 ++count;
 }
 else
 {
 do
 {
 queue.Dequeue();
 queue.Enqueue(e.Current);
 checked { ++count; }
 } while (e.MoveNext());
 break;
 }
 }

 if (isEndIndexFromEnd)
 {
 endIndex = count - endIndex;
 }
 else if (endIndex > count)
 {
 endIndex = count;
 Debug.Assert(queue.Count == Math.Min(count, startIndex));
 }

 startIndex = CalculateStartIndex(isStartIndexFromEnd: true, startIndex, count);
 endIndex = CalculateEndIndex(isEndIndexFromEnd, endIndex, count);
 Debug.Assert(endIndex - startIndex <= queue.Count);

 for (int rangeIndex = startIndex; rangeIndex < endIndex; rangeIndex++)
 {
 yield return queue.Dequeue();
 }
 }
 else
 {
 int index = 0;
 while (index <= startIndex)
 {
 if (!e.MoveNext())
 {
 yield break;
 }
 Debug.Assert(!isStartIndexFromEnd && isEndIndexFromEnd);

 checked
 {
 index++;
 }
 // SkipLast compat: the enumerator should be disposed at the end of the enumeration.
 using IEnumerator<TSource> e = source.GetEnumerator();

 count = 0;
 while (count < startIndex && e.MoveNext())
 {
 ++count;
 }

 if (isEndIndexFromEnd)
 if (count == startIndex)
 {
 if (endIndex > 0)
 queue = new Queue<TSource>();
 while (e.MoveNext())
 {
 Queue<TSource> queue = new();
 do
 if (queue.Count == endIndex)
 {
if (queue.Count == endIndex)
do
 {
 queue.Enqueue(e.Current);
 yield return queue.Dequeue();
 }
 } while (e.MoveNext());

 queue.Enqueue(e.Current);
 } while (e.MoveNext());
 }
 else
 {
 do
 break;
 }
 else
 {
 yield return e.Current;
 } while (e.MoveNext());
 }
 }
 else
 {
 Debug.Assert(index < endIndex);
 yield return e.Current;
 while (checked(++index) < endIndex && e.MoveNext())
 {
 yield return e.Current;
 queue.Enqueue(e.Current);
 }
 }
 }
 }

 static int CalculateStartIndex(bool isStartIndexFromEnd, int startIndex, int count) =>
 Math.Max(0, isStartIndexFromEnd ? count - startIndex : startIndex);

 static int CalculateEndIndex(bool isEndIndexFromEnd, int endIndex, int count) =>
 Math.Min(count, isEndIndexFromEnd ? count - endIndex : endIndex);
 }

 public static IEnumerable<TSource> TakeWhile<TSource>(this IEnumerable<TSource> source, Func<TSource, bool> predicate)
Expand DownExpand Up@@ -243,50 +251,9 @@ public static IEnumerable<TSource> TakeLast<TSource>(this IEnumerable<TSource> s

 return count <= 0 ?
 Empty<TSource>() :
 TakeLastIterator(source, count);
 }

 private static IEnumerable<TSource> TakeLastIterator<TSource>(IEnumerable<TSource> source, int count)
 {
 Debug.Assert(source != null);
 Debug.Assert(count > 0);

 Queue<TSource> queue;
 using (IEnumerator<TSource> e = source.GetEnumerator())
 {
 if (!e.MoveNext())
 {
 yield break;
 }

 queue = new Queue<TSource>();
 queue.Enqueue(e.Current);

 while (e.MoveNext())
 {
 if (queue.Count < count)
 {
 queue.Enqueue(e.Current);
 }
 else
 {
 do
 {
 queue.Dequeue();
 queue.Enqueue(e.Current);
 }
 while (e.MoveNext());
 break;
 }
 }
 }

 Debug.Assert(queue.Count <= count);
 do
 {
 yield return queue.Dequeue();
 }
 while (queue.Count > 0);
 TakeRangeFromEndIterator(source,
 isStartIndexFromEnd: true, startIndex: count,
 isEndIndexFromEnd: true, endIndex: 0);
 }
 }
}
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Auto-enable theater mode on YouTube
(function() {
function tryTheater() {
var btn = document.querySelector('button[aria-label="Theater mode"], ytd-player #player button[title="Theater mode"]');
if (btn && !btn.classList.contains('activated')) {
btn.click();
}
}
// Try immediately
tryTheater();
// Try after navigation (SPA)
var lastUrl = location.href;
setInterval(function() {
if (location.href !== lastUrl) {
lastUrl = location.href;
setTimeout(tryTheater, 500);
}
}, 1000);
// Also try on player load
var observer = new MutationObserver(tryTheater);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Apply optimizations and fixes to Enumerable.Take(Range) by eiriktsarpalis · Pull Request #48634 · dotnet/runtime · GitHub
Skip to content
Apply optimizations and fixes to Enumerable.Take(Range)#48634

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

eiriktsarpalis
merged 14 commits into

from

Mar 1, 2021
 Merged


Apply optimizations and fixes to Enumerable.Take(Range)
#48634
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


14 commits


Select commit
Hold shift + click to select a range
f38c0d6

optimize Take(Range) for countable enumerables


eiriktsarpalis Feb 22, 2021
a5339bb

Implement TakeLast over Take(Range)


eiriktsarpalis Feb 23, 2021
e1bd78c

Implement SkipLast over Take(Range)


eiriktsarpalis Feb 23, 2021
3558108

remove unneeded checked increment


eiriktsarpalis Feb 23, 2021
b89a0de

fix typo in tests


eiriktsarpalis Feb 24, 2021
faed507

remove ToLookup inputs from NonEnumeratedCount tests


eiriktsarpalis Feb 24, 2021
7dad846

remove leftover code


eiriktsarpalis Feb 24, 2021
cd1c805

Revert "remove ToLookup inputs from NonEnumeratedCount tests"


eiriktsarpalis Feb 24, 2021
9478f52

try debugging test failure


eiriktsarpalis Feb 25, 2021
101ad8e

remove ToLookup inputs from NonEnumeratedCount tests


eiriktsarpalis Feb 24, 2021
0c06999

Revert "try debugging test failure"


eiriktsarpalis Feb 25, 2021
5dbf307

Update src/libraries/System.Linq/src/System/Linq/Take.cs


eiriktsarpalis Feb 27, 2021
25e7058

eliminate redundant yield breaks


eiriktsarpalis Feb 27, 2021
554bd9d

remove accidentally reverted change


eiriktsarpalis Feb 27, 2021

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


33 changes: 3 additions & 30 deletions
src/libraries/System.Linq/src/System/Linq/Skip.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -121,36 +121,9 @@ public static IEnumerable<TSource> SkipLast<TSource>(this IEnumerable<TSource> s

 return count <= 0 ?
 source.Skip(0) :
 SkipLastIterator(source, count);
 }

 private static IEnumerable<TSource> SkipLastIterator<TSource>(IEnumerable<TSource> source, int count)
 {
 Debug.Assert(source != null);
 Debug.Assert(count > 0);

 var queue = new Queue<TSource>();

 using (IEnumerator<TSource> e = source.GetEnumerator())
 {
 while (e.MoveNext())
 {
 if (queue.Count == count)
 {
 do
 {
 yield return queue.Dequeue();
 queue.Enqueue(e.Current);
 }
 while (e.MoveNext());
 break;
 }
 else
 {
 queue.Enqueue(e.Current);
 }
 }
 }
 TakeRangeFromEndIterator(source,
 isStartIndexFromEnd: false, startIndex: 0,
 isEndIndexFromEnd: true, endIndex: count);
 }
 }
}

25 changes: 25 additions & 0 deletions
src/libraries/System.Linq/src/System/Linq/Take.SizeOpt.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -18,5 +18,30 @@ private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> s
 if (--count == 0) break;
 }
 }

 private static IEnumerable<TSource> TakeRangeIterator<TSource>(IEnumerable<TSource> source, int startIndex, int endIndex)
 {
 Debug.Assert(source != null);
 Debug.Assert(startIndex >= 0 && startIndex < endIndex);

 using IEnumerator<TSource> e = source.GetEnumerator();

 int index = 0;
 while (index < startIndex && e.MoveNext())
 {
 ++index;
 }

 if (index < startIndex)
 {
 yield break;
 }

 while (index < endIndex && e.MoveNext())
 {
 yield return e.Current;
 ++index;
 }
 }
 }
}

32 changes: 28 additions & 4 deletions
src/libraries/System.Linq/src/System/Linq/Take.SpeedOpt.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -2,14 +2,38 @@
// The .NET Foundation licenses this file to you under the MIT license.

using System.Collections.Generic;
using System.Diagnostics;

namespace System.Linq
{
 public static partial class Enumerable
 {
 private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> source, int count) =>
 source is IPartition<TSource> partition ? partition.Take(count) :
 source is IList<TSource> sourceList ? (IEnumerable<TSource>)new ListPartition<TSource>(sourceList, 0, count - 1) :
 new EnumerablePartition<TSource>(source, 0, count - 1);
 private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> source, int count)
 {
 Debug.Assert(source != null);
 Debug.Assert(count > 0);

 return
 source is IPartition<TSource> partition ? partition.Take(count) :
 source is IList<TSource> sourceList ? new ListPartition<TSource>(sourceList, 0, count - 1) :
 new EnumerablePartition<TSource>(source, 0, count - 1);
 }

 private static IEnumerable<TSource> TakeRangeIterator<TSource>(IEnumerable<TSource> source, int startIndex, int endIndex)
 {
 Debug.Assert(source != null);
 Debug.Assert(startIndex >= 0 && startIndex < endIndex);

 return
 source is IPartition<TSource> partition ? TakePartitionRange(partition, startIndex, endIndex) :
 source is IList<TSource> sourceList ? new ListPartition<TSource>(sourceList, startIndex, endIndex - 1) :
 new EnumerablePartition<TSource>(source, startIndex, endIndex - 1);

 static IPartition<TSource> TakePartitionRange(IPartition<TSource> partition, int startIndex, int endIndex)
 {
 partition = endIndex == 0 ? EmptyPartition<TSource>.Instance : partition.Take(endIndex);
 return startIndex == 0 ? partition : partition.Skip(startIndex);
 }
Comment thread
eiriktsarpalis marked this conversation as resolved.

 }
 }
}

195 changes: 81 additions & 114 deletions
src/libraries/System.Linq/src/System/Linq/Take.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -55,121 +55,129 @@ public static IEnumerable<TSource> Take<TSource>(this IEnumerable<TSource> sourc
 {
 return startIndex >= endIndex
 ? Empty<TSource>()
 : source.Skip(startIndex).Take(endIndex - startIndex);
 : TakeRangeIterator(source, startIndex, endIndex);
 }

 return TakeIterator(source, isStartIndexFromEnd, startIndex, isEndIndexFromEnd, endIndex);
 return TakeRangeFromEndIterator(source, isStartIndexFromEnd, startIndex, isEndIndexFromEnd, endIndex);
 }

 private static IEnumerable<TSource> TakeIterator<TSource>(
 IEnumerable<TSource> source, bool isStartIndexFromEnd, int startIndex, bool isEndIndexFromEnd, int endIndex)
 private static IEnumerable<TSource> TakeRangeFromEndIterator<TSource>(IEnumerable<TSource> source, bool isStartIndexFromEnd, int startIndex, bool isEndIndexFromEnd, int endIndex)
 {
 Debug.Assert(source != null);
 Debug.Assert(isStartIndexFromEnd || isEndIndexFromEnd);
 Debug.Assert(isStartIndexFromEnd
 ? startIndex > 0 && (!isEndIndexFromEnd || startIndex > endIndex)
 : startIndex >= 0 && (isEndIndexFromEnd || startIndex < endIndex));
 Debug.Assert(endIndex >= 0);

 using IEnumerator<TSource> e = source.GetEnumerator();
 if (isStartIndexFromEnd)
 // Attempt to extract the count of the source enumerator,
 // in order to convert fromEnd indices to regular indices.
 // Enumerable counts can change over time, so it is very
 // important that this check happens at enumeration time;
 // do not move it outside of the iterator method.
 if (source.TryGetNonEnumeratedCount(out int count))
 {
 if (!e.MoveNext())
 {
 yield break;
 }

 int index = 0;
 Queue<TSource> queue = new();
 queue.Enqueue(e.Current);
 startIndex = CalculateStartIndex(isStartIndexFromEnd, startIndex, count);
 endIndex = CalculateEndIndex(isEndIndexFromEnd, endIndex, count);

while (e.MoveNext())
if (startIndex < endIndex)
 {
checked
foreach (TSource element in TakeRangeIterator(source, startIndex, endIndex))
 {
index++;
yield return element;
 }
 }

 yield break;
 }

 Queue<TSource> queue;

 if (queue.Count == startIndex)
 if (isStartIndexFromEnd)
 {
 // TakeLast compat: enumerator should be disposed before yielding the first element.
 using (IEnumerator<TSource> e = source.GetEnumerator())
 {
 if (!e.MoveNext())
 {
queue.Dequeue();
yield break;
 }

 queue = new Queue<TSource>();
 queue.Enqueue(e.Current);
 }

 int count = checked(index + 1);
 Debug.Assert(queue.Count == Math.Min(count, startIndex));
 count = 1;

 startIndex = count - startIndex;
 if (startIndex < 0)
 {
 startIndex = 0;
 }
 while (e.MoveNext())
 {
 if (count < startIndex)
 {
 queue.Enqueue(e.Current);
 ++count;
 }
 else
 {
 do
 {
 queue.Dequeue();
 queue.Enqueue(e.Current);
 checked { ++count; }
 } while (e.MoveNext());
 break;
 }
 }

 if (isEndIndexFromEnd)
 {
 endIndex = count - endIndex;
 }
 else if (endIndex > count)
 {
 endIndex = count;
 Debug.Assert(queue.Count == Math.Min(count, startIndex));
 }

 startIndex = CalculateStartIndex(isStartIndexFromEnd: true, startIndex, count);
 endIndex = CalculateEndIndex(isEndIndexFromEnd, endIndex, count);
 Debug.Assert(endIndex - startIndex <= queue.Count);

 for (int rangeIndex = startIndex; rangeIndex < endIndex; rangeIndex++)
 {
 yield return queue.Dequeue();
 }
 }
 else
 {
 int index = 0;
 while (index <= startIndex)
 {
 if (!e.MoveNext())
 {
 yield break;
 }
 Debug.Assert(!isStartIndexFromEnd && isEndIndexFromEnd);

 checked
 {
 index++;
 }
 // SkipLast compat: the enumerator should be disposed at the end of the enumeration.
 using IEnumerator<TSource> e = source.GetEnumerator();

 count = 0;
 while (count < startIndex && e.MoveNext())
 {
 ++count;
 }

 if (isEndIndexFromEnd)
 if (count == startIndex)
 {
 if (endIndex > 0)
 queue = new Queue<TSource>();
 while (e.MoveNext())
 {
 Queue<TSource> queue = new();
 do
 if (queue.Count == endIndex)
 {
if (queue.Count == endIndex)
do
 {
 queue.Enqueue(e.Current);
 yield return queue.Dequeue();
 }
 } while (e.MoveNext());

 queue.Enqueue(e.Current);
 } while (e.MoveNext());
 }
 else
 {
 do
 break;
 }
 else
 {
 yield return e.Current;
 } while (e.MoveNext());
 }
 }
 else
 {
 Debug.Assert(index < endIndex);
 yield return e.Current;
 while (checked(++index) < endIndex && e.MoveNext())
 {
 yield return e.Current;
 queue.Enqueue(e.Current);
 }
 }
 }
 }

 static int CalculateStartIndex(bool isStartIndexFromEnd, int startIndex, int count) =>
 Math.Max(0, isStartIndexFromEnd ? count - startIndex : startIndex);

 static int CalculateEndIndex(bool isEndIndexFromEnd, int endIndex, int count) =>
 Math.Min(count, isEndIndexFromEnd ? count - endIndex : endIndex);
 }

 public static IEnumerable<TSource> TakeWhile<TSource>(this IEnumerable<TSource> source, Func<TSource, bool> predicate)
Expand DownExpand Up@@ -243,50 +251,9 @@ public static IEnumerable<TSource> TakeLast<TSource>(this IEnumerable<TSource> s

 return count <= 0 ?
 Empty<TSource>() :
 TakeLastIterator(source, count);
 }

 private static IEnumerable<TSource> TakeLastIterator<TSource>(IEnumerable<TSource> source, int count)
 {
 Debug.Assert(source != null);
 Debug.Assert(count > 0);

 Queue<TSource> queue;
 using (IEnumerator<TSource> e = source.GetEnumerator())
 {
 if (!e.MoveNext())
 {
 yield break;
 }

 queue = new Queue<TSource>();
 queue.Enqueue(e.Current);

 while (e.MoveNext())
 {
 if (queue.Count < count)
 {
 queue.Enqueue(e.Current);
 }
 else
 {
 do
 {
 queue.Dequeue();
 queue.Enqueue(e.Current);
 }
 while (e.MoveNext());
 break;
 }
 }
 }

 Debug.Assert(queue.Count <= count);
 do
 {
 yield return queue.Dequeue();
 }
 while (queue.Count > 0);
 TakeRangeFromEndIterator(source,
 isStartIndexFromEnd: true, startIndex: count,
 isEndIndexFromEnd: true, endIndex: 0);
 }
 }
}
Loading

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Remove or un-stick sticky/fixed headers that block content
(function() {
function unstick() {
document.querySelectorAll('header, nav, [role="banner"], .header, .navbar, .sticky, .fixed-top, [style*="position: fixed"], [style*="position:sticky"]').forEach(function(el) {
if (el.style.position === 'fixed' || el.style.position === 'sticky' || getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') {
el.style.position = 'static';
el.style.top = 'auto';
el.style.zIndex = 'auto';
}
});
}
unstick();
var observer = new MutationObserver(unstick);
observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] });
})();
}
} catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); }
})();
})();
Apply optimizations and fixes to Enumerable.Take(Range) by eiriktsarpalis · Pull Request #48634 · dotnet/runtime · GitHub
Skip to content
Apply optimizations and fixes to Enumerable.Take(Range)#48634

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

 Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and
privacy statement. We’ll occasionally send you account related emails.

Already on GitHub?
Sign in
to your account

 Merged

eiriktsarpalis
merged 14 commits into

from

Mar 1, 2021
 Merged


Apply optimizations and fixes to Enumerable.Take(Range)
#48634
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


14 commits


Select commit
Hold shift + click to select a range
f38c0d6

optimize Take(Range) for countable enumerables


eiriktsarpalis Feb 22, 2021
a5339bb

Implement TakeLast over Take(Range)


eiriktsarpalis Feb 23, 2021
e1bd78c

Implement SkipLast over Take(Range)


eiriktsarpalis Feb 23, 2021
3558108

remove unneeded checked increment


eiriktsarpalis Feb 23, 2021
b89a0de

fix typo in tests


eiriktsarpalis Feb 24, 2021
faed507

remove ToLookup inputs from NonEnumeratedCount tests


eiriktsarpalis Feb 24, 2021
7dad846

remove leftover code


eiriktsarpalis Feb 24, 2021
cd1c805

Revert "remove ToLookup inputs from NonEnumeratedCount tests"


eiriktsarpalis Feb 24, 2021
9478f52

try debugging test failure


eiriktsarpalis Feb 25, 2021
101ad8e

remove ToLookup inputs from NonEnumeratedCount tests


eiriktsarpalis Feb 24, 2021
0c06999

Revert "try debugging test failure"


eiriktsarpalis Feb 25, 2021
5dbf307

Update src/libraries/System.Linq/src/System/Linq/Take.cs


eiriktsarpalis Feb 27, 2021
25e7058

eliminate redundant yield breaks


eiriktsarpalis Feb 27, 2021
554bd9d

remove accidentally reverted change


eiriktsarpalis Feb 27, 2021

File filter

Filter by extension
Filter by extension
Conversations

Failed to load comments. 
Loading
Jump to

Jump to file


Failed to load files. 
Loading
 Diff view

 Diff view


33 changes: 3 additions & 30 deletions
src/libraries/System.Linq/src/System/Linq/Skip.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -121,36 +121,9 @@ public static IEnumerable<TSource> SkipLast<TSource>(this IEnumerable<TSource> s

 return count <= 0 ?
 source.Skip(0) :
 SkipLastIterator(source, count);
 }

 private static IEnumerable<TSource> SkipLastIterator<TSource>(IEnumerable<TSource> source, int count)
 {
 Debug.Assert(source != null);
 Debug.Assert(count > 0);

 var queue = new Queue<TSource>();

 using (IEnumerator<TSource> e = source.GetEnumerator())
 {
 while (e.MoveNext())
 {
 if (queue.Count == count)
 {
 do
 {
 yield return queue.Dequeue();
 queue.Enqueue(e.Current);
 }
 while (e.MoveNext());
 break;
 }
 else
 {
 queue.Enqueue(e.Current);
 }
 }
 }
 TakeRangeFromEndIterator(source,
 isStartIndexFromEnd: false, startIndex: 0,
 isEndIndexFromEnd: true, endIndex: count);
 }
 }
}

25 changes: 25 additions & 0 deletions
src/libraries/System.Linq/src/System/Linq/Take.SizeOpt.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -18,5 +18,30 @@ private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> s
 if (--count == 0) break;
 }
 }

 private static IEnumerable<TSource> TakeRangeIterator<TSource>(IEnumerable<TSource> source, int startIndex, int endIndex)
 {
 Debug.Assert(source != null);
 Debug.Assert(startIndex >= 0 && startIndex < endIndex);

 using IEnumerator<TSource> e = source.GetEnumerator();

 int index = 0;
 while (index < startIndex && e.MoveNext())
 {
 ++index;
 }

 if (index < startIndex)
 {
 yield break;
 }

 while (index < endIndex && e.MoveNext())
 {
 yield return e.Current;
 ++index;
 }
 }
 }
}

32 changes: 28 additions & 4 deletions
src/libraries/System.Linq/src/System/Linq/Take.SpeedOpt.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -2,14 +2,38 @@
// The .NET Foundation licenses this file to you under the MIT license.

using System.Collections.Generic;
using System.Diagnostics;

namespace System.Linq
{
 public static partial class Enumerable
 {
 private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> source, int count) =>
 source is IPartition<TSource> partition ? partition.Take(count) :
 source is IList<TSource> sourceList ? (IEnumerable<TSource>)new ListPartition<TSource>(sourceList, 0, count - 1) :
 new EnumerablePartition<TSource>(source, 0, count - 1);
 private static IEnumerable<TSource> TakeIterator<TSource>(IEnumerable<TSource> source, int count)
 {
 Debug.Assert(source != null);
 Debug.Assert(count > 0);

 return
 source is IPartition<TSource> partition ? partition.Take(count) :
 source is IList<TSource> sourceList ? new ListPartition<TSource>(sourceList, 0, count - 1) :
 new EnumerablePartition<TSource>(source, 0, count - 1);
 }

 private static IEnumerable<TSource> TakeRangeIterator<TSource>(IEnumerable<TSource> source, int startIndex, int endIndex)
 {
 Debug.Assert(source != null);
 Debug.Assert(startIndex >= 0 && startIndex < endIndex);

 return
 source is IPartition<TSource> partition ? TakePartitionRange(partition, startIndex, endIndex) :
 source is IList<TSource> sourceList ? new ListPartition<TSource>(sourceList, startIndex, endIndex - 1) :
 new EnumerablePartition<TSource>(source, startIndex, endIndex - 1);

 static IPartition<TSource> TakePartitionRange(IPartition<TSource> partition, int startIndex, int endIndex)
 {
 partition = endIndex == 0 ? EmptyPartition<TSource>.Instance : partition.Take(endIndex);
 return startIndex == 0 ? partition : partition.Skip(startIndex);
 }
Comment thread
eiriktsarpalis marked this conversation as resolved.

 }
 }
}

195 changes: 81 additions & 114 deletions
src/libraries/System.Linq/src/System/Linq/Take.cs

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -55,121 +55,129 @@ public static IEnumerable<TSource> Take<TSource>(this IEnumerable<TSource> sourc
 {
 return startIndex >= endIndex
 ? Empty<TSource>()
 : source.Skip(startIndex).Take(endIndex - startIndex);
 : TakeRangeIterator(source, startIndex, endIndex);
 }

 return TakeIterator(source, isStartIndexFromEnd, startIndex, isEndIndexFromEnd, endIndex);
 return TakeRangeFromEndIterator(source, isStartIndexFromEnd, startIndex, isEndIndexFromEnd, endIndex);
 }

 private static IEnumerable<TSource> TakeIterator<TSource>(
 IEnumerable<TSource> source, bool isStartIndexFromEnd, int startIndex, bool isEndIndexFromEnd, int endIndex)
 private static IEnumerable<TSource> TakeRangeFromEndIterator<TSource>(IEnumerable<TSource> source, bool isStartIndexFromEnd, int startIndex, bool isEndIndexFromEnd, int endIndex)
 {
 Debug.Assert(source != null);
 Debug.Assert(isStartIndexFromEnd || isEndIndexFromEnd);
 Debug.Assert(isStartIndexFromEnd
 ? startIndex > 0 && (!isEndIndexFromEnd || startIndex > endIndex)
 : startIndex >= 0 && (isEndIndexFromEnd || startIndex < endIndex));
 Debug.Assert(endIndex >= 0);

 using IEnumerator<TSource> e = source.GetEnumerator();
 if (isStartIndexFromEnd)
 // Attempt to extract the count of the source enumerator,
 // in order to convert fromEnd indices to regular indices.
 // Enumerable counts can change over time, so it is very
 // important that this check happens at enumeration time;
 // do not move it outside of the iterator method.
 if (source.TryGetNonEnumeratedCount(out int count))
 {
 if (!e.MoveNext())
 {
 yield break;
 }

 int index = 0;
 Queue<TSource> queue = new();
 queue.Enqueue(e.Current);
 startIndex = CalculateStartIndex(isStartIndexFromEnd, startIndex, count);
 endIndex = CalculateEndIndex(isEndIndexFromEnd, endIndex, count);

while (e.MoveNext())
if (startIndex < endIndex)
 {
checked
foreach (TSource element in TakeRangeIterator(source, startIndex, endIndex))
 {
index++;
yield return element;
 }
 }

 yield break;
 }

 Queue<TSource> queue;

 if (queue.Count == startIndex)
 if (isStartIndexFromEnd)
 {
 // TakeLast compat: enumerator should be disposed before yielding the first element.
 using (IEnumerator<TSource> e = source.GetEnumerator())
 {
 if (!e.MoveNext())
 {
queue.Dequeue();
yield break;
 }

 queue = new Queue<TSource>();
 queue.Enqueue(e.Current);
 }

 int count = checked(index + 1);
 Debug.Assert(queue.Count == Math.Min(count, startIndex));
 count = 1;

 startIndex = count - startIndex;
 if (startIndex < 0)
 {
 startIndex = 0;
 }
 while (e.MoveNext())
 {
 if (count < startIndex)
 {
 queue.Enqueue(e.Current);
 ++count;
 }
 else
 {
 do
 {
 queue.Dequeue();
 queue.Enqueue(e.Current);
 checked { ++count; }
 } while (e.MoveNext());
 break;
 }
 }

 if (isEndIndexFromEnd)
 {
 endIndex = count - endIndex;
 }
 else if (endIndex > count)
 {
 endIndex = count;
 Debug.Assert(queue.Count == Math.Min(count, startIndex));
 }

 startIndex = CalculateStartIndex(isStartIndexFromEnd: true, startIndex, count);
 endIndex = CalculateEndIndex(isEndIndexFromEnd, endIndex, count);
 Debug.Assert(endIndex - startIndex <= queue.Count);

 for (int rangeIndex = startIndex; rangeIndex < endIndex; rangeIndex++)
 {
 yield return queue.Dequeue();
 }
 }
 else
 {
 int index = 0;
 while (index <= startIndex)
 {
 if (!e.MoveNext())
 {
 yield break;
 }
 Debug.Assert(!isStartIndexFromEnd && isEndIndexFromEnd);

 checked
 {
 index++;
 }
 // SkipLast compat: the enumerator should be disposed at the end of the enumeration.
 using IEnumerator<TSource> e = source.GetEnumerator();

 count = 0;
 while (count < startIndex && e.MoveNext())
 {
 ++count;
 }

 if (isEndIndexFromEnd)
 if (count == startIndex)
 {
 if (endIndex > 0)
 queue = new Queue<TSource>();
 while (e.MoveNext())
 {
 Queue<TSource> queue = new();
 do
 if (queue.Count == endIndex)
 {
if (queue.Count == endIndex)
do
 {
 queue.Enqueue(e.Current);
 yield return queue.Dequeue();
 }
 } while (e.MoveNext());

 queue.Enqueue(e.Current);
 } while (e.MoveNext());
 }
 else
 {
 do
 break;
 }
 else
 {
 yield return e.Current;
 } while (e.MoveNext());
 }
 }
 else
 {
 Debug.Assert(index < endIndex);
 yield return e.Current;
 while (checked(++index) < endIndex && e.MoveNext())
 {
 yield return e.Current;
 queue.Enqueue(e.Current);
 }
 }
 }
 }

 static int CalculateStartIndex(bool isStartIndexFromEnd, int startIndex, int count) =>
 Math.Max(0, isStartIndexFromEnd ? count - startIndex : startIndex);

 static int CalculateEndIndex(bool isEndIndexFromEnd, int endIndex, int count) =>
 Math.Min(count, isEndIndexFromEnd ? count - endIndex : endIndex);
 }

 public static IEnumerable<TSource> TakeWhile<TSource>(this IEnumerable<TSource> source, Func<TSource, bool> predicate)
Expand DownExpand Up@@ -243,50 +251,9 @@ public static IEnumerable<TSource> TakeLast<TSource>(this IEnumerable<TSource> s

 return count <= 0 ?
 Empty<TSource>() :
 TakeLastIterator(source, count);
 }

 private static IEnumerable<TSource> TakeLastIterator<TSource>(IEnumerable<TSource> source, int count)
 {
 Debug.Assert(source != null);
 Debug.Assert(count > 0);

 Queue<TSource> queue;
 using (IEnumerator<TSource> e = source.GetEnumerator())
 {
 if (!e.MoveNext())
 {
 yield break;
 }

 queue = new Queue<TSource>();
 queue.Enqueue(e.Current);

 while (e.MoveNext())
 {
 if (queue.Count < count)
 {
 queue.Enqueue(e.Current);
 }
 else
 {
 do
 {
 queue.Dequeue();
 queue.Enqueue(e.Current);
 }
 while (e.MoveNext());
 break;
 }
 }
 }

 Debug.Assert(queue.Count <= count);
 do
 {
 yield return queue.Dequeue();
 }
 while (queue.Count > 0);
 TakeRangeFromEndIterator(source,
 isStartIndexFromEnd: true, startIndex: count,
 isEndIndexFromEnd: true, endIndex: 0);
 }
 }
}
Loading