1324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver/* 2324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * [The "BSD licence"] 3324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Copyright (c) 2005-2008 Terence Parr 4324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * All rights reserved. 5324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 6324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Conversion to C#: 7324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Copyright (c) 2008-2009 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 using System.Collections.Generic; 35324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver using IList = System.Collections.IList; 36324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 37324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 38324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * A generic list of elements tracked in an alternative to be used in 39324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * a -> rewrite rule. We need to subclass to fill in the next() method, 40324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * which returns either an AST node wrapped around a token payload or 41324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * an existing subtree. 42324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 43324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 44324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * <remarks> 45324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Once you start next()ing, do not try to add more elements. It will 46324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * break the cursor tracking I believe. 47324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 48324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * TODO: add mechanism to detect/puke on modification after reading from stream 49324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </remarks> 50324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 51324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * <see cref="RewriteRuleSubtreeStream"/> 52324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * <see cref="RewriteRuleTokenStream"/> 53324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 54324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver [System.Serializable] 55324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public abstract class RewriteRuleElementStream { 56324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 57324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Cursor 0..n-1. If singleElement!=null, cursor is 0 until you next(), 58324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * which bumps it to 1 meaning no more elements. 59324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 60324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 61324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected int cursor = 0; 62324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 63324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>Track single elements w/o creating a list. Upon 2nd add, alloc list */ 64324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected object singleElement; 65324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 66324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>The list of tokens or subtrees we are tracking */ 67324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected IList elements; 68324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 69324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>Once a node / subtree has been used in a stream, it must be dup'd 70324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * from then on. Streams are reset after subrules so that the streams 71324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * can be reused in future subrules. So, reset must set a dirty bit. 72324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * If dirty, then next() always returns a dup. 73324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * 74324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * I wanted to use "naughty bit" here, but couldn't think of a way 75324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * to use "naughty". 76324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 77324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected bool dirty = false; 78324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 79324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>The element or stream description; usually has name of the token or 80324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * rule reference that this list tracks. Can include rulename too, but 81324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * the exception would track that info. 82324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 83324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected string elementDescription; 84324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected ITreeAdaptor adaptor; 85324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 86324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public RewriteRuleElementStream(ITreeAdaptor adaptor, string elementDescription) { 87324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver this.elementDescription = elementDescription; 88324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver this.adaptor = adaptor; 89324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 90324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 91324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>Create a stream with one element</summary> */ 92324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public RewriteRuleElementStream(ITreeAdaptor adaptor, string elementDescription, object oneElement) 93324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver : this(adaptor, elementDescription) { 94324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver Add(oneElement); 95324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 96324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 97324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary>Create a stream, but feed off an existing list</summary> */ 98324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public RewriteRuleElementStream(ITreeAdaptor adaptor, string elementDescription, IList elements) 99324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver : this(adaptor, elementDescription) { 100324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver this.singleElement = null; 101324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver this.elements = elements; 102324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 103324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 104324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 105324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Reset the condition of this stream so that it appears we have 106324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * not consumed any of its elements. Elements themselves are untouched. 107324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Once we reset the stream, any future use will need duplicates. Set 108324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * the dirty bit. 109324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 110324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 111324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual void Reset() { 112324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver cursor = 0; 113324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver dirty = true; 114324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 115324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 116324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual void Add(object el) { 117324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver //System.out.println("add '"+elementDescription+"' is "+el); 118324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (el == null) { 119324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return; 120324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 121324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (elements != null) { // if in list, just add 122324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver elements.Add(el); 123324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return; 124324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 125324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (singleElement == null) { // no elements yet, track w/o list 126324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver singleElement = el; 127324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return; 128324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 129324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // adding 2nd element, move to list 130324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver elements = new List<object>(5); 131324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver elements.Add(singleElement); 132324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver singleElement = null; 133324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver elements.Add(el); 134324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 135324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 136324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 137324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Return the next element in the stream. If out of elements, throw 138324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * an exception unless size()==1. If size is 1, then return elements[0]. 139324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Return a duplicate node/subtree if stream is out of elements and 140324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * size==1. If we've already used the element, dup (dirty bit set). 141324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 142324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 143324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual object NextTree() { 144324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int n = Count; 145324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (dirty || (cursor >= n && n == 1)) { 146324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // if out of elements and size is 1, dup 147324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver object el = NextCore(); 148324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return Dup(el); 149324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 150324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // test size above then fetch 151324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver object el2 = NextCore(); 152324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return el2; 153324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 154324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 155324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 156324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Do the work of getting the next element, making sure that it's 157324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * a tree node or subtree. Deal with the optimization of single- 158324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * element list versus list of size > 1. Throw an exception 159324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * if the stream is empty or we're out of elements and size>1. 160324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * protected so you can override in a subclass if necessary. 161324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 162324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 163324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected virtual object NextCore() { 164324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int n = Count; 165324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (n == 0) { 166324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new RewriteEmptyStreamException(elementDescription); 167324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 168324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (cursor >= n) { // out of elements? 169324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (n == 1) { // if size is 1, it's ok; return and we'll dup 170324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return ToTree(singleElement); 171324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 172324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // out of elements and size was not 1, so we can't dup 173324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver throw new RewriteCardinalityException(elementDescription); 174324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 175324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // we have elements 176324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (singleElement != null) { 177324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver cursor++; // move cursor even for single element list 178324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return ToTree(singleElement); 179324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 180324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver // must have more than one in list, pull from elements 181324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver object o = ToTree(elements[cursor]); 182324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver cursor++; 183324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return o; 184324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 185324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 186324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 187324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * When constructing trees, sometimes we need to dup a token or AST 188324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * subtree. Dup'ing a token means just creating another AST node 189324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * around it. For trees, you must call the adaptor.dupTree() unless 190324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * the element is for a tree root; then it must be a node dup. 191324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 192324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 193324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected abstract object Dup(object el); 194324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 195324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver /** <summary> 196324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * Ensure stream emits trees; tokens must be converted to AST nodes. 197324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * AST nodes can be passed through unmolested. 198324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver * </summary> 199324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver */ 200324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver protected virtual object ToTree(object el) { 201324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return el; 202324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 203324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 204324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual bool HasNext { 205324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver get { 206324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return (singleElement != null && cursor < 1) || 207324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver (elements != null && cursor < elements.Count); 208324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 209324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 210324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 211324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual int Count { 212324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver get { 213324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver int n = 0; 214324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (singleElement != null) { 215324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver n = 1; 216324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 217324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver if (elements != null) { 218324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return elements.Count; 219324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 220324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return n; 221324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 222324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 223324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver 224324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver public virtual string Description { 225324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver get { 226324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver return elementDescription; 227324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 228324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 229324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver } 230324c4644fee44b9898524c09511bd33c3f12e2dfBen Gruver} 231