5
// Mike Krüger <mkrueger@novell.com>
7
// Copyright (c) 2010 Novell, Inc (http://www.novell.com)
9
// Permission is hereby granted, free of charge, to any person obtaining a copy
10
// of this software and associated documentation files (the "Software"), to deal
11
// in the Software without restriction, including without limitation the rights
12
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
13
// copies of the Software, and to permit persons to whom the Software is
14
// furnished to do so, subject to the following conditions:
16
// The above copyright notice and this permission notice shall be included in
17
// all copies or substantial portions of the Software.
19
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
20
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
21
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
22
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
23
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
24
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
27
using MonoDevelop.Projects.Dom;
28
using System.Collections.Generic;
30
namespace MonoDevelop.CSharp.Ast
32
public class CompilationUnit : AstNode
34
public static readonly Role<AstNode> MemberRole = new Role<AstNode>("Member", AstNode.Null);
36
public override NodeType NodeType {
38
return NodeType.Unknown;
42
public CompilationUnit ()
46
public AstNode GetNodeAt (int line, int column)
48
return GetNodeAt (new AstLocation (line, column));
51
public AstNode GetNodeAt (AstLocation location)
54
while (node.FirstChild != null) {
55
var child = node.FirstChild;
56
while (child != null) {
57
if (child.StartLocation <= location && location < child.EndLocation) {
61
child = child.NextSibling;
63
// found no better child node - therefore the parent is the right one.
70
public IEnumerable<AstNode> GetNodesBetween (int startLine, int startColumn, int endLine, int endColumn)
72
return GetNodesBetween (new AstLocation (startLine, startColumn), new AstLocation (endLine, endColumn));
75
public IEnumerable<AstNode> GetNodesBetween (AstLocation start, AstLocation end)
78
while (node != null) {
80
if (start <= node.StartLocation && node.EndLocation <= end) {
81
// Remember next before yielding node.
82
// This allows iteration to continue when the caller removes/replaces the node.
83
next = node.NextSibling;
86
if (node.EndLocation < start) {
87
next = node.NextSibling;
89
next = node.FirstChild;
93
if (next != null && next.StartLocation > end)
99
public override S AcceptVisitor<T, S> (IAstVisitor<T, S> visitor, T data)
101
return visitor.VisitCompilationUnit (this, data);