5 // Jérémie "Garuma" Laval <jeremie.laval@gmail.com>
7 // Copyright (c) 2010 Jérémie "Garuma" Laval
9 // Permission is hereby granted, free of charge, to any person obtaining a copy
10 // of this software and associated documentation files (the "Software"), to deal
11 // in the Software without restriction, including without limitation the rights
12 // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
13 // copies of the Software, and to permit persons to whom the Software is
14 // furnished to do so, subject to the following conditions:
16 // The above copyright notice and this permission notice shall be included in
17 // all copies or substantial portions of the Software.
19 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
20 // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
21 // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
22 // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
23 // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
24 // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
29 using System.Threading;
30 using System.Collections;
31 using System.Collections.Generic;
33 namespace System.Linq.Parallel.QueryNodes
35 internal class QuerySelectManyNode<TSource, TCollection, TResult> : QueryStreamNode<TResult, TSource>
37 Func<TSource, IEnumerable<TCollection>> collectionSelector;
38 Func<TSource, int, IEnumerable<TCollection>> collectionSelectorIndexed;
39 Func<TSource, TCollection, TResult> resultSelector;
41 internal QuerySelectManyNode (QueryBaseNode<TSource> parent,
42 Func<TSource, int, IEnumerable<TCollection>> collectionSelectorIndexed,
43 Func<TSource, TCollection, TResult> resultSelector)
46 this.collectionSelectorIndexed = collectionSelectorIndexed;
47 this.resultSelector = resultSelector;
50 internal QuerySelectManyNode (QueryBaseNode<TSource> parent,
51 Func<TSource, IEnumerable<TCollection>> collectionSelector,
52 Func<TSource, TCollection, TResult> resultSelector)
53 : base (parent, false)
55 this.collectionSelector = collectionSelector;
56 this.resultSelector = resultSelector;
59 internal override IEnumerable<TResult> GetSequential ()
61 IEnumerable<TSource> source = Parent.GetSequential ();
64 source.SelectMany (collectionSelectorIndexed, resultSelector) :
65 source.SelectMany (collectionSelector, resultSelector);
68 internal override IList<IEnumerable<TResult>> GetEnumerablesIndexed (QueryOptions options)
70 return Parent.GetOrderedEnumerables (options)
71 .Select ((i) => GetEnumerableInternal (i,
72 (kv) => collectionSelectorIndexed (kv.Value, (int)kv.Key),
73 (e, c) => resultSelector (e.Value, c)))
77 internal override IList<IEnumerable<TResult>> GetEnumerablesNonIndexed (QueryOptions options)
79 return Parent.GetEnumerables (options)
80 .Select ((i) => GetEnumerableInternal (i,
82 (e, c) => resultSelector (e, c)))
86 internal override IList<IEnumerable<KeyValuePair<long, TResult>>> GetOrderedEnumerables (QueryOptions options)
88 var source = Parent.GetOrderedEnumerables (options);
89 var sizeRequests = new SizeRequest[source.Count];
92 Barrier barrier = new Barrier (source.Count, delegate (Barrier b) {
93 Array.Sort (sizeRequests, KeyComparator);
94 for (int i = 0; i < b.ParticipantCount; ++i) {
95 if (sizeRequests[i].Key == -1)
97 sizeRequests[i].Key = deviation;
98 deviation += sizeRequests[i].Size;
103 .Select ((i, ind) => GetOrderedEnumerableInternal (i, sizeRequests, ind, barrier))
107 IEnumerable<TResult> GetEnumerableInternal<T> (IEnumerable<T> source,
108 Func<T, IEnumerable<TCollection>> collectionner,
109 Func<T, TCollection, TResult> packer)
111 foreach (T element in source)
112 foreach (TCollection item in collectionner (element))
113 yield return packer (element, item);
116 IEnumerable<KeyValuePair<long, TResult>> GetOrderedEnumerableInternal (IEnumerable<KeyValuePair<long, TSource>> source,
117 SizeRequest[] sizeRequests,
121 IEnumerator<KeyValuePair<long, TSource>> enumerator = source.GetEnumerator ();
122 bool isIndexed = IsIndexed;
126 KeyValuePair<long, TSource> element;
127 IEnumerable<TCollection> collection;
129 if (enumerator.MoveNext ()) {
130 element = enumerator.Current;
131 collection = isIndexed ?
132 collectionSelectorIndexed (element.Value, (int)element.Key) :
133 collectionSelector (element.Value);
135 var count = GetCount (ref collection);
137 sizeRequests[index].Update (element.Key, count, collection, element.Value);
140 barrier.SignalAndWait ();
142 long i = sizeRequests[index].Key;
143 collection = sizeRequests[index].Collection;
144 var elementValue = sizeRequests[index].ElementValue;
146 sizeRequests[index].Clear ();
151 foreach (TCollection item in collection)
152 yield return new KeyValuePair<long, TResult> (i++, resultSelector (elementValue, item));
155 barrier.RemoveParticipant ();
156 enumerator.Dispose ();
160 /* If getting Count is a O(1) operation (i.e. actual is a ICollection) then return it immediatly
161 * if not process the IEnumerable into a List and return the Count from that (i.e. enumerable
162 * processing will only happen once in case of e.g. a Linq query)
164 static int GetCount<T> (ref IEnumerable<T> actual)
166 ICollection coll = actual as ICollection;
170 var foo = actual.ToList ();
176 static int KeyComparator (SizeRequest e1, SizeRequest e2)
178 return e1.Key.CompareTo (e2.Key);
185 public IEnumerable<TCollection> Collection;
186 public TSource ElementValue;
188 public void Update (long k, int s, IEnumerable<TCollection> c, TSource ev)
201 ElementValue = default (TSource);