/
AlgebraExtensions.cs
192 lines (181 loc) · 6.81 KB
/
AlgebraExtensions.cs
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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
/*
// <copyright>
// dotNetRDF is free and open source software licensed under the MIT License
// -------------------------------------------------------------------------
//
// Copyright (c) 2009-2023 dotNetRDF Project (http://dotnetrdf.org/)
//
// 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.
// </copyright>
*/
using System;
using System.Collections.Generic;
using System.Linq;
using System.Threading.Tasks;
using VDS.RDF.Query.Patterns;
namespace VDS.RDF.Query.Algebra
{
/// <summary>
/// Static Helper class containing extensions used in the Algebra evaluation process.
/// </summary>
public static class AlgebraExtensions
{
/// <summary>
/// Calculates the product of two multi-sets asynchronously with a timeout to restrict long running computations.
/// </summary>
/// <param name="multiset">Multiset.</param>
/// <param name="other">Other Multiset.</param>
/// <param name="timeout">Timeout, if <=0 no timeout is used and product will be computed synchronously.</param>
/// <returns></returns>
public static BaseMultiset ProductWithTimeout(this BaseMultiset multiset, BaseMultiset other, long timeout)
{
if (other is IdentityMultiset) return multiset;
if (other is NullMultiset) return other;
if (other.IsEmpty) return new NullMultiset();
// If no timeout use default implementation
if (timeout <= 0)
{
return multiset.Product(other);
}
// Otherwise Invoke using an Async call
BaseMultiset productSet;
if (multiset.UsePLinqEvaluation)
{
if (multiset.Count >= other.Count)
{
productSet = new PartitionedMultiset(multiset.Count, other.Count);
}
else
{
productSet = new PartitionedMultiset(other.Count, multiset.Count);
}
}
else
{
productSet = new Multiset();
}
var stop = new StopToken();
var t = (int)Math.Min(timeout, int.MaxValue);
Task productTask = Task.Factory.StartNew(() => GenerateProduct(multiset, other, productSet, stop));
if (!productTask.Wait(t))
{
stop.ShouldStop = true;
productTask.Wait();
}
return productSet;
}
/// <summary>
/// Method for generating product of two multisets asynchronously.
/// </summary>
/// <param name="multiset">Multiset.</param>
/// <param name="other">Other Multiset.</param>
/// <param name="target">Multiset to generate the product in.</param>
/// <param name="stop">Stop Token.</param>
private static void GenerateProduct(BaseMultiset multiset, BaseMultiset other, BaseMultiset target, StopToken stop)
{
if (multiset.UsePLinqEvaluation)
{
// Determine partition sizes so we can do a parallel product
// Want to parallelize over whichever side is larger
if (multiset.Count >= other.Count)
{
multiset.Sets.AsParallel().ForAll(x => EvalProduct(x, other, target as PartitionedMultiset, stop));
}
else
{
other.Sets.AsParallel().ForAll(y => EvalProduct(y, multiset, target as PartitionedMultiset, stop));
}
}
else
{
foreach (ISet x in multiset.Sets)
{
foreach (ISet y in other.Sets)
{
target.Add(x.Join(y));
// if (stop.ShouldStop) break;
}
if (stop.ShouldStop) break;
}
}
}
private static void EvalProduct(ISet x, BaseMultiset other, PartitionedMultiset productSet, StopToken stop)
{
if (stop.ShouldStop) return;
var id = productSet.GetNextBaseID();
foreach (ISet y in other.Sets)
{
id++;
ISet z = x.Join(y);
z.ID = id;
productSet.Add(z);
if (stop.ShouldStop) return;
}
}
/// <summary>
/// Converts a Bindings Clause to a Multiset.
/// </summary>
/// <returns></returns>
public static BaseMultiset ToMultiset(this BindingsPattern pattern)
{
if (pattern.Variables.Any())
{
var m = new Multiset();
foreach (var var in pattern.Variables)
{
m.AddVariable(var);
}
foreach (BindingTuple tuple in pattern.Tuples)
{
var set = new Set();
foreach (KeyValuePair<string, PatternItem> binding in tuple.Values)
{
set.Add(binding.Key, tuple[binding.Key]);
}
m.Add(set);
}
return m;
}
else
{
return new IdentityMultiset();
}
}
}
/// <summary>
/// Token passed to asynchronous code to allow stop signalling.
/// </summary>
internal class StopToken
{
private bool _stop;
/// <summary>
/// Gets/Sets whether the code should stop.
/// </summary>
/// <remarks>
/// Once set to true cannot be reset.
/// </remarks>
public bool ShouldStop
{
get => _stop;
set
{
if (!_stop) _stop = value;
}
}
}
}