1 /* 2 * [The "BSD licence"] 3 * Copyright (c) 2005-2008 Terence Parr 4 * All rights reserved. 5 * 6 * Conversion to C#: 7 * Copyright (c) 2008 Sam Harwell, Pixel Mine, Inc. 8 * All rights reserved. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. The name of the author may not be used to endorse or promote products 19 * derived from this software without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 22 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 23 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 24 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 25 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 26 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 27 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 30 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 31 */ 32 33 using System; 34 using System.Collections.Generic; 35 #if DEBUG 36 using System.Linq; 37 #endif 38 39 namespace Antlr.Runtime.JavaExtensions 40 { 41 public static class StackExtensions 42 { 43 #if DEBUG 44 [Obsolete] elementAt( this Stack<T> stack, int index )45 public static T elementAt<T>( this Stack<T> stack, int index ) 46 { 47 return stack.ElementAt( index ); 48 } 49 50 [Obsolete] peek( this Stack<T> stack )51 public static T peek<T>( this Stack<T> stack ) 52 { 53 return stack.Peek(); 54 } 55 56 [Obsolete] pop( this Stack<T> stack )57 public static T pop<T>( this Stack<T> stack ) 58 { 59 return stack.Pop(); 60 } 61 62 [Obsolete] push( this Stack<T> stack, T obj )63 public static void push<T>( this Stack<T> stack, T obj ) 64 { 65 stack.Push( obj ); 66 } 67 68 [Obsolete] size( this Stack<T> stack )69 public static int size<T>( this Stack<T> stack ) 70 { 71 return stack.Count; 72 } 73 #endif 74 setSize( this Stack<T> stack, int size )75 public static void setSize<T>( this Stack<T> stack, int size ) 76 { 77 if ( size > stack.Count ) 78 throw new ArgumentException(); 79 80 while ( stack.Count > size ) 81 stack.Pop(); 82 } 83 } 84 } 85