Files
mono/mcs/class/System.Core/System.Linq.Parallel.QueryNodes/QuerySelectManyNode.cs
T

164 lines
6.3 KiB
C#

//
// QueryConcatNode.cs
//
// Author:
// Jérémie "Garuma" Laval <[email protected]>
//
// Copyright (c) 2010 Jérémie "Garuma" Laval
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
#if NET_4_0
using System;
using System.Threading;
using System.Collections;
using System.Collections.Generic;
namespace System.Linq.Parallel.QueryNodes
{
internal class QuerySelectManyNode<TSource, TCollection, TResult> : QueryStreamNode<TResult, TSource>
{
Func<TSource, IEnumerable<TCollection>> collectionSelector;
Func<TSource, int, IEnumerable<TCollection>> collectionSelectorIndexed;
Func<TSource, TCollection, TResult> resultSelector;
internal QuerySelectManyNode (QueryBaseNode<TSource> parent,
Func<TSource, int, IEnumerable<TCollection>> collectionSelectorIndexed,
Func<TSource, TCollection, TResult> resultSelector)
: base (parent, true)
{
this.collectionSelectorIndexed = collectionSelectorIndexed;
this.resultSelector = resultSelector;
}
internal QuerySelectManyNode (QueryBaseNode<TSource> parent,
Func<TSource, IEnumerable<TCollection>> collectionSelector,
Func<TSource, TCollection, TResult> resultSelector)
: base (parent, false)
{
this.collectionSelector = collectionSelector;
this.resultSelector = resultSelector;
}
internal override IEnumerable<TResult> GetSequential ()
{
IEnumerable<TSource> source = Parent.GetSequential ();
return IsIndexed ?
source.SelectMany (collectionSelectorIndexed, resultSelector) :
source.SelectMany (collectionSelector, resultSelector);
}
internal override IList<IEnumerable<TResult>> GetEnumerablesIndexed (QueryOptions options)
{
return Parent.GetOrderedEnumerables (options)
.Select ((i) => GetEnumerableInternal (i,
(kv) => collectionSelectorIndexed (kv.Value, (int)kv.Key),
(e, c) => resultSelector (e.Value, c)))
.ToList ();
}
internal override IList<IEnumerable<TResult>> GetEnumerablesNonIndexed (QueryOptions options)
{
return Parent.GetEnumerables (options)
.Select ((i) => GetEnumerableInternal (i,
collectionSelector,
(e, c) => resultSelector (e, c)))
.ToList ();
}
internal override IList<IEnumerable<KeyValuePair<long, TResult>>> GetOrderedEnumerables (QueryOptions options)
{
var source = Parent.GetOrderedEnumerables (options);
var sizeRequests = new Tuple<long, int, IEnumerable<TCollection>> [options.PartitionCount];
if (collectionSelectorIndexed == null)
collectionSelectorIndexed = (e, i) => collectionSelector (e);
long deviation = 0;
Barrier barrier = new Barrier (options.PartitionCount, delegate {
Array.Sort (sizeRequests, (e1, e2) => e1.Item1.CompareTo (e2.Item1));
long newDeviation = deviation;
for (int i = sizeRequests.Length - 1; i >= 0; i--) {
var reqi = sizeRequests[i];
long newIndex = reqi.Item1 + deviation;
newDeviation += reqi.Item2 - 1;
for (int j = i - 1; j >= 0; j--)
newIndex += sizeRequests[j].Item2 - 1;
sizeRequests[i] = Tuple.Create (newIndex, reqi.Item2, reqi.Item3);
}
deviation = newDeviation;
});
return source
.Select ((i, ind) => GetOrderedEnumerableInternal (i, sizeRequests, ind, barrier))
.ToList ();
}
IEnumerable<TResult> GetEnumerableInternal<T> (IEnumerable<T> source,
Func<T, IEnumerable<TCollection>> collectionner,
Func<T, TCollection, TResult> packer)
{
foreach (T element in source)
foreach (TCollection item in collectionner (element))
yield return packer (element, item);
}
IEnumerable<KeyValuePair<long, TResult>> GetOrderedEnumerableInternal (IEnumerable<KeyValuePair<long, TSource>> source,
Tuple<long, int, IEnumerable<TCollection>>[] sizeRequests,
int index,
Barrier barrier)
{
try {
foreach (KeyValuePair<long, TSource> element in source) {
IEnumerable<TCollection> collection = collectionSelectorIndexed (element.Value, (int)element.Key);
sizeRequests[index] = Tuple.Create (element.Key, GetCount (ref collection), collection);
barrier.SignalAndWait ();
long i = sizeRequests[index].Item1;
collection = sizeRequests[index].Item3;
foreach (TCollection item in collection)
yield return new KeyValuePair<long, TResult> (i++, resultSelector (element.Value, item));
}
} finally {
barrier.RemoveParticipant ();
}
}
/* If getting Count is a O(1) operation (i.e. actual is a ICollection) then return it immediatly
* if not process the IEnumerable into a List and return the Count from that (i.e. enumerable
* processing will only happen once in case of e.g. a Linq query)
*/
static int GetCount<T> (ref IEnumerable<T> actual)
{
ICollection coll = actual as ICollection;
if (coll != null)
return coll.Count;
var foo = actual.ToList ();
actual = foo;
return foo.Count;
}
}
}
#endif