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
|
/* ****************************************************************************
*
* Copyright (c) Microsoft Corporation.
*
* This source code is subject to terms and conditions of the Apache License, Version 2.0. A
* copy of the license can be found in the License.html file at the root of this distribution. If
* you cannot locate the Apache License, Version 2.0, please send an email to
* dlr@microsoft.com. By using this source code in any fashion, you are agreeing to be bound
* by the terms of the Apache License, Version 2.0.
*
* You must not remove this notice, or any other, from this software.
*
*
* ***************************************************************************/
#if !FEATURE_CORE_DLR
using Microsoft.Scripting.Ast;
using Microsoft.Scripting.Utils;
#else
using System.Linq.Expressions;
#endif
using System.Collections.Generic;
namespace System.Dynamic.Utils {
// Miscellaneous helpers that don't belong anywhere else
internal static class Helpers {
internal static T CommonNode<T>(T first, T second, Func<T, T> parent) where T : class {
var cmp = EqualityComparer<T>.Default;
if (cmp.Equals(first, second)) {
return first;
}
var set = new Set<T>(cmp);
for (T t = first; t != null; t = parent(t)) {
set.Add(t);
}
for (T t = second; t != null; t = parent(t)) {
if (set.Contains(t)) {
return t;
}
}
return null;
}
internal static void IncrementCount<T>(T key, Dictionary<T, int> dict) {
int count;
dict.TryGetValue(key, out count);
dict[key] = count + 1;
}
}
}
|
