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
|
// Copyright (c) 2010-2013 AlphaSierraPapa for the SharpDevelop Team
//
// 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.
using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Linq;
using ICSharpCode.NRefactory.CSharp;
namespace ICSharpCode.NRefactory.ConsistencyCheck
{
/// <summary>
/// Determines the fastest way to retrieve a List{IdentifierExpression} of all identifiers
/// in a syntax tree.
/// </summary>
public class VisitorBenchmark
{
public static void Run(IEnumerable<SyntaxTree> files)
{
files = files.ToList();
RunTest("recursive method using for", files, (syntaxTree, list) => WalkTreeFor(syntaxTree, list));
RunTest("recursive method using foreach", files, (syntaxTree, list) => WalkTreeForEach(syntaxTree, list));
RunTest("non-recursive loop", files, (syntaxTree, list) => WalkTreeNonRecursive(syntaxTree, list));
RunTest("foreach over Descendants.OfType()", files, (syntaxTree, list) => {
foreach (var node in syntaxTree.Descendants.OfType<IdentifierExpression>()) {
list.Add(node);
}
});
RunTest("DepthFirstAstVisitor", files, (syntaxTree, list) => syntaxTree.AcceptVisitor(new DepthFirst(list)));
RunTest("DepthFirstAstVisitor<object>", files, (syntaxTree, list) => syntaxTree.AcceptVisitor(new DepthFirst<object>(list)));
RunTest("DepthFirstAstVisitor<object, object>", files, (syntaxTree, list) => syntaxTree.AcceptVisitor(new DepthFirst<object, object>(list), null));
RunTest("ObservableAstVisitor", files, (syntaxTree, list) => {
var visitor = new ObservableAstVisitor();
visitor.EnterIdentifierExpression += list.Add;
syntaxTree.AcceptVisitor(visitor);
});
}
static void WalkTreeForEach(AstNode node, List<IdentifierExpression> list)
{
foreach (AstNode child in node.Children) {
IdentifierExpression id = child as IdentifierExpression;
if (id != null) {
list.Add(id);
}
WalkTreeForEach(child, list);
}
}
static void WalkTreeFor(AstNode node, List<IdentifierExpression> list)
{
for (AstNode child = node.FirstChild; child != null; child = child.NextSibling) {
IdentifierExpression id = child as IdentifierExpression;
if (id != null) {
list.Add(id);
}
WalkTreeFor(child, list);
}
}
static void WalkTreeNonRecursive(AstNode root, List<IdentifierExpression> list)
{
AstNode pos = root;
while (pos != null) {
{
IdentifierExpression id = pos as IdentifierExpression;
if (id != null) {
list.Add(id);
}
}
if (pos.FirstChild != null) {
pos = pos.FirstChild;
} else {
pos = pos.GetNextNode();
}
}
}
class DepthFirst : DepthFirstAstVisitor {
readonly List<IdentifierExpression> list;
public DepthFirst(List<IdentifierExpression> list) { this.list = list; }
public override void VisitIdentifierExpression(IdentifierExpression identifierExpression)
{
list.Add(identifierExpression);
base.VisitIdentifierExpression(identifierExpression);
}
}
class DepthFirst<T> : DepthFirstAstVisitor<T> {
readonly List<IdentifierExpression> list;
public DepthFirst(List<IdentifierExpression> list) { this.list = list; }
public override T VisitIdentifierExpression(IdentifierExpression identifierExpression)
{
list.Add(identifierExpression);
return base.VisitIdentifierExpression(identifierExpression);
}
}
class DepthFirst<T, S> : DepthFirstAstVisitor<T, S> {
readonly List<IdentifierExpression> list;
public DepthFirst(List<IdentifierExpression> list) { this.list = list; }
public override S VisitIdentifierExpression(IdentifierExpression identifierExpression, T data)
{
list.Add(identifierExpression);
return base.VisitIdentifierExpression(identifierExpression, data);
}
}
static void RunTest(string text, IEnumerable<SyntaxTree> files, Action<SyntaxTree, List<IdentifierExpression>> action)
{
// validation:
var list = new List<IdentifierExpression>();
foreach (var file in files) {
list.Clear();
action(file, list);
if (!list.SequenceEqual(file.Descendants.OfType<IdentifierExpression>()))
throw new InvalidOperationException();
}
Stopwatch w = Stopwatch.StartNew();
foreach (var file in files) {
for (int i = 0; i < 20; i++) {
list.Clear();
action(file, list);
}
}
w.Stop();
Console.WriteLine(text.PadRight(40) + ": " + w.Elapsed);
}
}
}
|
