You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
85 lines
2.7 KiB
85 lines
2.7 KiB
/*
|
|
* [The "BSD licence"]
|
|
* Copyright (c) 2005-2008 Terence Parr
|
|
* All rights reserved.
|
|
*
|
|
* Conversion to C#:
|
|
* Copyright (c) 2008 Sam Harwell, Pixel Mine, Inc.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. The name of the author may not be used to endorse or promote products
|
|
* derived from this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
|
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
|
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
|
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
using System;
|
|
using System.Collections.Generic;
|
|
#if DEBUG
|
|
using System.Linq;
|
|
#endif
|
|
|
|
namespace Antlr.Runtime.JavaExtensions
|
|
{
|
|
public static class StackExtensions
|
|
{
|
|
#if DEBUG
|
|
[Obsolete]
|
|
public static T elementAt<T>( this Stack<T> stack, int index )
|
|
{
|
|
return stack.ElementAt( index );
|
|
}
|
|
|
|
[Obsolete]
|
|
public static T peek<T>( this Stack<T> stack )
|
|
{
|
|
return stack.Peek();
|
|
}
|
|
|
|
[Obsolete]
|
|
public static T pop<T>( this Stack<T> stack )
|
|
{
|
|
return stack.Pop();
|
|
}
|
|
|
|
[Obsolete]
|
|
public static void push<T>( this Stack<T> stack, T obj )
|
|
{
|
|
stack.Push( obj );
|
|
}
|
|
|
|
[Obsolete]
|
|
public static int size<T>( this Stack<T> stack )
|
|
{
|
|
return stack.Count;
|
|
}
|
|
#endif
|
|
|
|
public static void setSize<T>( this Stack<T> stack, int size )
|
|
{
|
|
if ( size > stack.Count )
|
|
throw new ArgumentException();
|
|
|
|
while ( stack.Count > size )
|
|
stack.Pop();
|
|
}
|
|
}
|
|
}
|