123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191 |
- // Licensed to the .NET Foundation under one or more agreements.
- // The .NET Foundation licenses this file to you under the Apache 2.0 License.
- // See the LICENSE file in the project root for more information.
- // Copied from https://github.com/dotnet/corefx/blob/5f1dd8298e4355b63bb760d88d437a91b3ca808c/src/System.Linq/src/System/Linq/Partition.cs
- using System.Collections.Generic;
- using System.Diagnostics;
- using System.Threading;
- using System.Threading.Tasks;
- namespace System.Linq
- {
- /// <summary>
- /// An iterator that yields the items of part of an <see cref="IList{TSource}"/>.
- /// </summary>
- /// <typeparam name="TSource">The type of the source list.</typeparam>
- internal sealed class AsyncListPartition<TSource> : AsyncIterator<TSource>, IAsyncPartition<TSource>
- {
- private readonly IList<TSource> _source;
- private readonly int _minIndexInclusive;
- private readonly int _maxIndexInclusive;
- private int _index;
- public AsyncListPartition(IList<TSource> source, int minIndexInclusive, int maxIndexInclusive)
- {
- Debug.Assert(source != null);
- Debug.Assert(minIndexInclusive >= 0);
- Debug.Assert(minIndexInclusive <= maxIndexInclusive);
- _source = source;
- _minIndexInclusive = minIndexInclusive;
- _maxIndexInclusive = maxIndexInclusive;
- _index = 0;
- }
- public override AsyncIteratorBase<TSource> Clone()
- {
- return new AsyncListPartition<TSource>(_source, _minIndexInclusive, _maxIndexInclusive);
- }
- protected override ValueTask<bool> MoveNextCore()
- {
- if ((uint)_index <= (uint)(_maxIndexInclusive - _minIndexInclusive) && _index < _source.Count - _minIndexInclusive)
- {
- _current = _source[_minIndexInclusive + _index];
- ++_index;
- return new ValueTask<bool>(true);
- }
- return Core();
- async ValueTask<bool> Core()
- {
- await DisposeAsync().ConfigureAwait(false);
- return false;
- }
- }
- #if NOT_YET
- public override IEnumerable<TResult> Select<TResult>(Func<TSource, TResult> selector)
- {
- return new SelectListPartitionIterator<TSource, TResult>(_source, selector, _minIndexInclusive, _maxIndexInclusive);
- }
- public override IEnumerable<TResult> Select<TResult>(Func<TSource, ValueTask<TResult>> selector)
- {
- return new SelectListPartitionIterator<TSource, TResult>(_source, selector, _minIndexInclusive, _maxIndexInclusive);
- }
- #endif
- public IAsyncPartition<TSource> Skip(int count)
- {
- var minIndex = _minIndexInclusive + count;
- if ((uint)minIndex > (uint)_maxIndexInclusive)
- {
- return AsyncEnumerable.EmptyAsyncIterator<TSource>.Instance;
- }
- else
- {
- return new AsyncListPartition<TSource>(_source, minIndex, _maxIndexInclusive);
- }
- }
- public IAsyncPartition<TSource> Take(int count)
- {
- var maxIndex = _minIndexInclusive + count - 1;
- if ((uint)maxIndex >= (uint)_maxIndexInclusive)
- {
- return this;
- }
- else
- {
- return new AsyncListPartition<TSource>(_source, _minIndexInclusive, maxIndex);
- }
- }
- public ValueTask<Maybe<TSource>> TryGetElementAtAsync(int index, CancellationToken cancellationToken)
- {
- if ((uint)index <= (uint)(_maxIndexInclusive - _minIndexInclusive) && index < _source.Count - _minIndexInclusive)
- {
- var res = _source[_minIndexInclusive + index];
- return new ValueTask<Maybe<TSource>>(new Maybe<TSource>(res));
- }
- return new ValueTask<Maybe<TSource>>(new Maybe<TSource>());
- }
- public ValueTask<Maybe<TSource>> TryGetFirstAsync(CancellationToken cancellationToken)
- {
- if (_source.Count > _minIndexInclusive)
- {
- var res = _source[_minIndexInclusive];
- return new ValueTask<Maybe<TSource>>(new Maybe<TSource>(res));
- }
- return new ValueTask<Maybe<TSource>>(new Maybe<TSource>());
- }
- public ValueTask<Maybe<TSource>> TryGetLastAsync(CancellationToken cancellationToken)
- {
- var lastIndex = _source.Count - 1;
- if (lastIndex >= _minIndexInclusive)
- {
- var res = _source[Math.Min(lastIndex, _maxIndexInclusive)];
- return new ValueTask<Maybe<TSource>>(new Maybe<TSource>(res));
- }
- return new ValueTask<Maybe<TSource>>(new Maybe<TSource>());
- }
- private int Count
- {
- get
- {
- var count = _source.Count;
- if (count <= _minIndexInclusive)
- {
- return 0;
- }
- return Math.Min(count - 1, _maxIndexInclusive) - _minIndexInclusive + 1;
- }
- }
- public ValueTask<TSource[]> ToArrayAsync(CancellationToken cancellationToken)
- {
- var count = Count;
- if (count == 0)
- {
- return new ValueTask<TSource[]>(
- #if NO_ARRAY_EMPTY
- EmptyArray<TSource>.Value
- #else
- Array.Empty<TSource>()
- #endif
- );
- }
- var array = new TSource[count];
- for (int i = 0, curIdx = _minIndexInclusive; i != array.Length; ++i, ++curIdx)
- {
- array[i] = _source[curIdx];
- }
- return new ValueTask<TSource[]>(array);
- }
- public ValueTask<List<TSource>> ToListAsync(CancellationToken cancellationToken)
- {
- var count = Count;
- if (count == 0)
- {
- return new ValueTask<List<TSource>>(new List<TSource>());
- }
- var list = new List<TSource>(count);
- var end = _minIndexInclusive + count;
- for (var i = _minIndexInclusive; i != end; ++i)
- {
- list.Add(_source[i]);
- }
- return new ValueTask<List<TSource>>(list);
- }
- public ValueTask<int> GetCountAsync(bool onlyIfCheap, CancellationToken cancellationToken)
- {
- return new ValueTask<int>(Count);
- }
- }
- }
|