1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
|
//
// QueryMuxNode.cs
//
// Author:
// Jérémie "Garuma" Laval <jeremie.laval@gmail.com>
//
// 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.Linq;
using System.Collections.Generic;
using System.Collections.Concurrent;
namespace System.Linq.Parallel.QueryNodes
{
internal class QuerySetNode<TSource> : QueryMuxNode<TSource, TSource, TSource>
{
readonly SetInclusion setInclusion;
readonly IEqualityComparer<TSource> comparer;
internal QuerySetNode (SetInclusion setInclusion, IEqualityComparer<TSource> comparer,
QueryBaseNode<TSource> first, QueryBaseNode<TSource> second)
: base (first, second)
{
this.setInclusion = setInclusion;
this.comparer = comparer;
}
internal override IEnumerable<TSource> GetSequential ()
{
var first = Parent.GetSequential ();
var second = Second == null ? null : Second.GetSequential ();
// We try to do some guessing based on the default
switch (setInclusion) {
case SetInclusionDefaults.Union:
return first.Union (second, comparer);
case SetInclusionDefaults.Intersect:
return first.Intersect (second, comparer);
case SetInclusionDefaults.Except:
return first.Except (second, comparer);
case SetInclusionDefaults.Distinct:
return first.Distinct (comparer);
}
// Default is we return the bare source enumerable
return first;
}
internal override IList<IEnumerable<TSource>> GetEnumerables (QueryOptions options)
{
var first = Parent.GetEnumerables (options);
var second = Second.GetEnumerables (options);
var checker = new ConcurrentDictionary<TSource, object> (comparer);
InitConcurrentDictionary (checker, second, (e) => e);
return first
.Select ((f, i) => GetEnumerable<TSource> (f, second[i], checker, (e) => e))
.ToList ();
}
internal override IList<IEnumerable<KeyValuePair<long, TSource>>> GetOrderedEnumerables (QueryOptions options)
{
var first = Parent.GetOrderedEnumerables (options);
var second = Second.GetOrderedEnumerables (options);
var checker = new ConcurrentDictionary<TSource, object> (comparer);
InitConcurrentDictionary (checker, second, (e) => e.Value);
return first
.Select ((f, i) => GetEnumerable<KeyValuePair<long, TSource>> (f, second[i], checker, (e) => e.Value))
.ToList ();
}
void InitConcurrentDictionary<TExtract> (ConcurrentDictionary<TSource, object> checker,
IList<IEnumerable<TExtract>> feeds,
Func<TExtract, TSource> extractor)
{
if ((setInclusion & SetInclusion.Preload) == 0)
return;
foreach (IEnumerable<TExtract> feed in feeds)
foreach (TExtract item in feed)
checker.TryAdd (extractor (item), null);
}
IEnumerable<TExtract> GetEnumerable<TExtract> (IEnumerable<TExtract> first,
IEnumerable<TExtract> second,
ConcurrentDictionary<TSource, object> checker,
Func<TExtract, TSource> extractor)
{
IEnumerator<TExtract> eFirst = first.GetEnumerator ();
IEnumerator<TExtract> eSecond = second == null ? null : second.GetEnumerator ();
IEnumerator<TExtract> current = eFirst;
bool outInclusion = (setInclusion & SetInclusion.Out) > 0;
bool preload = (setInclusion & SetInclusion.Preload) > 0;
bool relaxed = (setInclusion & SetInclusion.Relaxed) > 0;
try {
while (current != null) {
while (current.MoveNext ()) {
bool result = relaxed ?
checker.ContainsKey (extractor (current.Current)) : checker.TryAdd (extractor (current.Current), null);
if ((result && outInclusion)
|| (!result && !outInclusion))
yield return current.Current;
}
if (current == eFirst && !preload)
current = eSecond;
else
break;
}
} finally {
eFirst.Dispose ();
eSecond.Dispose ();
}
}
}
}
#endif
|
