1324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/* 2324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * [The "BSD licence"] 3324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Copyright (c) 2011 Terence Parr 4324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * All rights reserved. 5324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 6324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Conversion to C#: 7324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Copyright (c) 2011 Sam Harwell, Pixel Mine, Inc. 8324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * All rights reserved. 9324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 10324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Redistribution and use in source and binary forms, with or without 11324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * modification, are permitted provided that the following conditions 12324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * are met: 13324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 1. Redistributions of source code must retain the above copyright 14324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * notice, this list of conditions and the following disclaimer. 15324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 2. Redistributions in binary form must reproduce the above copyright 16324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * notice, this list of conditions and the following disclaimer in the 17324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * documentation and/or other materials provided with the distribution. 18324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 3. The name of the author may not be used to endorse or promote products 19324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * derived from this software without specific prior written permission. 20324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 21324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 22324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 23324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 24324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 25324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 26324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 27324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 28324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 29324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 30324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 31324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 32324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 33324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruvernamespace Antlr.Runtime.Tree 34324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver{ 35324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver using System; 36324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver using System.Collections.Generic; 37324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 38324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver using StringBuilder = System.Text.StringBuilder; 39324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 40324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 41324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * A generic tree implementation with no payload. You must subclass to 42324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * actually have any user data. ANTLR v3 uses a list of children approach 43324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * instead of the child-sibling approach in v2. A flat tree (a list) is 44324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * an empty node whose children represent the list. An empty, but 45324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * non-null node is called "nil". 46324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 47324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 48324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver [System.Serializable] 49324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver [System.Diagnostics.DebuggerTypeProxy(typeof(AntlrRuntime_BaseTreeDebugView))] 50324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract class BaseTree : ITree 51324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 52324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver private IList<ITree> _children; 53324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 54324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public BaseTree() 55324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 56324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 57324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 58324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 59324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Create a new node from an existing node does nothing for BaseTree 60324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * as there are no fields other than the children list, which cannot 61324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * be copied as the children are not considered part of this node. 62324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 63324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 64324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public BaseTree( ITree node ) 65324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 66324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 67324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 68324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 69324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Get the children internal List; note that if you directly mess with 70324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * the list, do so at your own risk. 71324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 72324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 73324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual IList<ITree> Children 74324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 75324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver get 76324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 77324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return _children; 78324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 79324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 80324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver private set 81324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 82324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver _children = value; 83324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 84324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 85324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 86324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver #region ITree Members 87324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 88324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual int ChildCount 89324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 90324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver get 91324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 92324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( Children == null ) 93324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return 0; 94324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 95324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return Children.Count; 96324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 97324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 98324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 99324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>BaseTree doesn't track parent pointers.</summary> */ 100324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual ITree Parent 101324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 102324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver get 103324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 104324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return null; 105324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 106324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver set 107324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 108324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 109324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 110324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 111324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>BaseTree doesn't track child indexes.</summary> */ 112324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual int ChildIndex 113324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 114324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver get 115324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 116324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return 0; 117324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 118324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver set 119324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 120324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 121324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 122324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 123324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual bool IsNil 124324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 125324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver get 126324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 127324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return false; 128324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 129324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 130324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 131324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract int TokenStartIndex 132324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 133324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver get; 134324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver set; 135324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 136324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 137324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract int TokenStopIndex 138324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 139324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver get; 140324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver set; 141324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 142324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 143324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract int Type 144324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 145324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver get; 146324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver set; 147324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 148324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 149324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract string Text 150324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 151324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver get; 152324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver set; 153324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 154324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 155324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual int Line 156324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 157324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver get; 158324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver set; 159324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 160324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 161324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual int CharPositionInLine 162324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 163324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver get; 164324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver set; 165324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 166324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 167324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver #endregion 168324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 169324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual ITree GetChild( int i ) 170324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 171324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (i < 0) 172324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new ArgumentOutOfRangeException(); 173324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 174324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( Children == null || i >= Children.Count ) 175324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return null; 176324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 177324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return Children[i]; 178324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 179324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 180324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual ITree GetFirstChildWithType( int type ) 181324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 182324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver foreach ( ITree child in Children ) 183324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 184324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( child.Type == type ) 185324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return child; 186324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 187324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 188324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return null; 189324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 190324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 191324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>Add t as child of this node.</summary> 192324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 193324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * <remarks> 194324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Warning: if t has no children, but child does 195324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * and child isNil then this routine moves children to t via 196324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * t.children = child.children; i.e., without copying the array. 197324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </remarks> 198324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 199324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual void AddChild( ITree t ) 200324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 201324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver //System.out.println("add child "+t.toStringTree()+" "+this.toStringTree()); 202324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver //System.out.println("existing children: "+children); 203324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( t == null ) 204324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 205324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return; // do nothing upon addChild(null) 206324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 207324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( t.IsNil ) 208324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 209324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // t is an empty node possibly with children 210324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver BaseTree childTree = t as BaseTree; 211324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( childTree != null && this.Children != null && this.Children == childTree.Children ) 212324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 213324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new Exception( "attempt to add child list to itself" ); 214324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 215324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // just add all of childTree's children to this 216324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( t.ChildCount > 0 ) 217324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 218324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( this.Children != null || childTree == null ) 219324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 220324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( this.Children == null ) 221324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver this.Children = CreateChildrenList(); 222324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 223324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // must copy, this has children already 224324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int n = t.ChildCount; 225324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for ( int i = 0; i < n; i++ ) 226324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 227324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver ITree c = t.GetChild( i ); 228324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver this.Children.Add( c ); 229324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // handle double-link stuff for each child of nil root 230324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver c.Parent = this; 231324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver c.ChildIndex = Children.Count - 1; 232324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 233324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 234324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver else 235324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 236324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // no children for this but t is a BaseTree with children; 237324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // just set pointer call general freshener routine 238324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver this.Children = childTree.Children; 239324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver this.FreshenParentAndChildIndexes(); 240324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 241324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 242324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 243324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver else 244324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 245324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // child is not nil (don't care about children) 246324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( Children == null ) 247324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 248324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Children = CreateChildrenList(); // create children list on demand 249324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 250324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Children.Add( t ); 251324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver t.Parent = this; 252324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver t.ChildIndex = Children.Count - 1; 253324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 254324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // System.out.println("now children are: "+children); 255324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 256324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 257324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>Add all elements of kids list as children of this node</summary> */ 258324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual void AddChildren( IEnumerable<ITree> kids ) 259324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 260324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (kids == null) 261324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new ArgumentNullException("kids"); 262324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 263324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver foreach ( ITree t in kids ) 264324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver AddChild( t ); 265324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 266324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 267324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual void SetChild( int i, ITree t ) 268324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 269324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (i < 0) 270324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new ArgumentOutOfRangeException("i"); 271324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 272324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( t == null ) 273324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 274324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return; 275324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 276324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( t.IsNil ) 277324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 278324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new ArgumentException( "Can't set single child to a list" ); 279324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 280324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( Children == null ) 281324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 282324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Children = CreateChildrenList(); 283324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 284324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Children[i] = t; 285324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver t.Parent = this; 286324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver t.ChildIndex = i; 287324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 288324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 289324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual object DeleteChild( int i ) 290324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 291324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (i < 0) 292324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new ArgumentOutOfRangeException("i"); 293324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (i >= ChildCount) 294324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new ArgumentException(); 295324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 296324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( Children == null ) 297324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return null; 298324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 299324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver ITree killed = Children[i]; 300324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Children.RemoveAt( i ); 301324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // walk rest and decrement their child indexes 302324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver this.FreshenParentAndChildIndexes( i ); 303324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return killed; 304324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 305324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 306324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 307324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Delete children from start to stop and replace with t even if t is 308324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * a list (nil-root tree). num of children can increase or decrease. 309324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * For huge child lists, inserting children can force walking rest of 310324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * children to set their childindex; could be slow. 311324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 312324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 313324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual void ReplaceChildren( int startChildIndex, int stopChildIndex, object t ) 314324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 315324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (startChildIndex < 0) 316324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new ArgumentOutOfRangeException(); 317324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (stopChildIndex < 0) 318324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new ArgumentOutOfRangeException(); 319324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (t == null) 320324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new ArgumentNullException("t"); 321324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (stopChildIndex < startChildIndex) 322324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new ArgumentException(); 323324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 324324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /* 325324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver System.out.println("replaceChildren "+startChildIndex+", "+stopChildIndex+ 326324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver " with "+((BaseTree)t).toStringTree()); 327324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver System.out.println("in="+toStringTree()); 328324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 329324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( Children == null ) 330324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 331324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new ArgumentException( "indexes invalid; no children in list" ); 332324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 333324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int replacingHowMany = stopChildIndex - startChildIndex + 1; 334324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int replacingWithHowMany; 335324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver ITree newTree = (ITree)t; 336324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver IList<ITree> newChildren = null; 337324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // normalize to a list of children to add: newChildren 338324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( newTree.IsNil ) 339324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 340324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver BaseTree baseTree = newTree as BaseTree; 341324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( baseTree != null && baseTree.Children != null ) 342324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 343324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver newChildren = baseTree.Children; 344324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 345324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver else 346324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 347324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver newChildren = CreateChildrenList(); 348324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int n = newTree.ChildCount; 349324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for ( int i = 0; i < n; i++ ) 350324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver newChildren.Add( newTree.GetChild( i ) ); 351324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 352324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 353324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver else 354324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 355324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver newChildren = new List<ITree>( 1 ); 356324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver newChildren.Add( newTree ); 357324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 358324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver replacingWithHowMany = newChildren.Count; 359324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int numNewChildren = newChildren.Count; 360324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int delta = replacingHowMany - replacingWithHowMany; 361324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // if same number of nodes, do direct replace 362324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( delta == 0 ) 363324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 364324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int j = 0; // index into new children 365324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for ( int i = startChildIndex; i <= stopChildIndex; i++ ) 366324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 367324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver ITree child = newChildren[j]; 368324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Children[i] = child; 369324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver child.Parent = this; 370324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver child.ChildIndex = i; 371324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver j++; 372324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 373324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 374324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver else if ( delta > 0 ) 375324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 376324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // fewer new nodes than there were 377324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // set children and then delete extra 378324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for ( int j = 0; j < numNewChildren; j++ ) 379324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 380324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Children[startChildIndex + j] = newChildren[j]; 381324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 382324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int indexToDelete = startChildIndex + numNewChildren; 383324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for ( int c = indexToDelete; c <= stopChildIndex; c++ ) 384324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 385324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // delete same index, shifting everybody down each time 386324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Children.RemoveAt( indexToDelete ); 387324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 388324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver FreshenParentAndChildIndexes( startChildIndex ); 389324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 390324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver else 391324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 392324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // more new nodes than were there before 393324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // fill in as many children as we can (replacingHowMany) w/o moving data 394324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for ( int j = 0; j < replacingHowMany; j++ ) 395324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 396324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Children[startChildIndex + j] = newChildren[j]; 397324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 398324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int numToInsert = replacingWithHowMany - replacingHowMany; 399324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for ( int j = replacingHowMany; j < replacingWithHowMany; j++ ) 400324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 401324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Children.Insert( startChildIndex + j, newChildren[j] ); 402324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 403324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver FreshenParentAndChildIndexes( startChildIndex ); 404324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 405324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver //System.out.println("out="+toStringTree()); 406324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 407324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 408324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>Override in a subclass to change the impl of children list</summary> */ 409324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected virtual IList<ITree> CreateChildrenList() 410324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 411324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return new List<ITree>(); 412324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 413324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 414324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>Set the parent and child index values for all child of t</summary> */ 415324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual void FreshenParentAndChildIndexes() 416324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 417324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver FreshenParentAndChildIndexes( 0 ); 418324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 419324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 420324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual void FreshenParentAndChildIndexes( int offset ) 421324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 422324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int n = ChildCount; 423324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for ( int c = offset; c < n; c++ ) 424324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 425324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver ITree child = GetChild( c ); 426324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver child.ChildIndex = c; 427324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver child.Parent = this; 428324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 429324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 430324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 431324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual void SanityCheckParentAndChildIndexes() 432324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 433324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver SanityCheckParentAndChildIndexes( null, -1 ); 434324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 435324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 436324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual void SanityCheckParentAndChildIndexes( ITree parent, int i ) 437324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 438324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( parent != this.Parent ) 439324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 440324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new InvalidOperationException( "parents don't match; expected " + parent + " found " + this.Parent ); 441324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 442324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( i != this.ChildIndex ) 443324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 444324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new InvalidOperationException( "child indexes don't match; expected " + i + " found " + this.ChildIndex ); 445324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 446324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int n = this.ChildCount; 447324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for ( int c = 0; c < n; c++ ) 448324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 449324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver BaseTree child = (BaseTree)this.GetChild( c ); 450324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver child.SanityCheckParentAndChildIndexes( this, c ); 451324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 452324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 453324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 454324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>Walk upwards looking for ancestor with this token type.</summary> */ 455324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual bool HasAncestor( int ttype ) 456324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 457324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return GetAncestor( ttype ) != null; 458324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 459324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 460324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>Walk upwards and get first ancestor with this token type.</summary> */ 461324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual ITree GetAncestor( int ttype ) 462324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 463324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver ITree t = this; 464324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver t = t.Parent; 465324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver while ( t != null ) 466324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 467324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( t.Type == ttype ) 468324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return t; 469324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver t = t.Parent; 470324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 471324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return null; 472324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 473324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 474324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 475324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Return a list of all ancestors of this node. The first node of 476324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * list is the root and the last is the parent of this node. 477324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 478324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 479324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual IList<ITree> GetAncestors() 480324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 481324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( Parent == null ) 482324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return null; 483324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 484324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver List<ITree> ancestors = new List<ITree>(); 485324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver ITree t = this; 486324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver t = t.Parent; 487324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver while ( t != null ) 488324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 489324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver ancestors.Insert( 0, t ); // insert at start 490324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver t = t.Parent; 491324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 492324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return ancestors; 493324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 494324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 495324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>Print out a whole tree not just a node</summary> */ 496324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual string ToStringTree() 497324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 498324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( Children == null || Children.Count == 0 ) 499324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 500324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return this.ToString(); 501324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 502324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver StringBuilder buf = new StringBuilder(); 503324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( !IsNil ) 504324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 505324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver buf.Append( "(" ); 506324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver buf.Append( this.ToString() ); 507324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver buf.Append( ' ' ); 508324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 509324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver for ( int i = 0; Children != null && i < Children.Count; i++ ) 510324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 511324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver ITree t = Children[i]; 512324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( i > 0 ) 513324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 514324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver buf.Append( ' ' ); 515324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 516324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver buf.Append( t.ToStringTree() ); 517324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 518324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if ( !IsNil ) 519324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver { 520324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver buf.Append( ")" ); 521324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 522324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return buf.ToString(); 523324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 524324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 525324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>Override to say how a node (not a tree) should look as text</summary> */ 526324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public override abstract string ToString(); 527324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 528324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver #region Tree Members 529324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract ITree DupNode(); 530324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver #endregion 531324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 532324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver} 533