-
Notifications
You must be signed in to change notification settings - Fork 396
Expand file tree
/
Copy pathClassUtil.cs
More file actions
43 lines (38 loc) · 1.34 KB
/
ClassUtil.cs
File metadata and controls
43 lines (38 loc) · 1.34 KB
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
using System.Collections.Generic;
using System.Diagnostics.Contracts;
using System.Linq;
using ReClassNET.Util;
namespace ReClassNET.Nodes
{
public class ClassUtil
{
/// <summary>
/// Tests if the class to check can be inserted into the parent class without creating a cycle.
/// </summary>
/// <param name="parent">The class into which </param>
/// <param name="classToCheck">The class which should get inserted.</param>
/// <param name="classes">An enumeration of all available classes.</param>
/// <returns>True if a cycle is detected, false otherwise.</returns>
public static bool IsCyclicIfClassIsAccessibleFromParent(ClassNode parent, ClassNode classToCheck, IEnumerable<ClassNode> classes)
{
Contract.Requires(parent != null);
Contract.Requires(classToCheck != null);
Contract.Requires(classes != null);
Contract.Requires(Contract.ForAll(classes, c => c != null));
var graph = new DirectedGraph<ClassNode>();
graph.AddVertices(classes);
graph.AddEdge(parent, classToCheck);
foreach (var c in graph.Vertices)
{
foreach (var wrapperNode in c.Nodes.OfType<BaseWrapperNode>())
{
if (wrapperNode.ShouldPerformCycleCheckForInnerNode() && wrapperNode.ResolveMostInnerNode() is ClassNode classNode)
{
graph.AddEdge(c, classNode);
}
}
}
return graph.ContainsCycle();
}
}
}