Stack Class
Represents a simple last-in-first-out (LIFO) non-generic collection of objects.
Assembly: mscorlib (in mscorlib.dll)
The Stack type exposes the following members.
| Name | Description | |
|---|---|---|
![]() ![]() | Stack() | Initializes a new instance of the Stack class that is empty and has the default initial capacity. |
![]() ![]() | Stack(ICollection) | Initializes a new instance of the Stack class that contains elements copied from the specified collection and has the same initial capacity as the number of elements copied. |
![]() ![]() | Stack(Int32) | Initializes a new instance of the Stack class that is empty and has the specified initial capacity or the default initial capacity, whichever is greater. |
| Name | Description | |
|---|---|---|
![]() ![]() | Count | Gets the number of elements contained in the Stack. |
![]() ![]() | IsSynchronized | Gets a value indicating whether access to the Stack is synchronized (thread safe). |
![]() ![]() | SyncRoot | Gets an object that can be used to synchronize access to the Stack. |
| Name | Description | |
|---|---|---|
![]() ![]() | Clear | Removes all objects from the Stack. |
![]() ![]() | Clone | Creates a shallow copy of the Stack. |
![]() ![]() | Contains | Determines whether an element is in the Stack. |
![]() ![]() | CopyTo | Copies the Stack to an existing one-dimensional Array, starting at the specified array index. |
![]() ![]() | Equals(Object) | Determines whether the specified Object is equal to the current Object. (Inherited from Object.) |
![]() ![]() | Finalize | Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object.) |
![]() ![]() | GetEnumerator | Returns an IEnumerator for the Stack. |
![]() ![]() | GetHashCode | Serves as a hash function for a particular type. (Inherited from Object.) |
![]() ![]() | GetType | Gets the Type of the current instance. (Inherited from Object.) |
![]() ![]() | MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object.) |
![]() ![]() | Peek | Returns the object at the top of the Stack without removing it. |
![]() ![]() | Pop | Removes and returns the object at the top of the Stack. |
![]() ![]() | Push | Inserts an object at the top of the Stack. |
![]() ![]() ![]() | Synchronized | Returns a synchronized (thread safe) wrapper for the Stack. |
![]() ![]() | ToArray | Copies the Stack to a new array. |
![]() ![]() | ToString | Returns a string that represents the current object. (Inherited from Object.) |
| Name | Description | |
|---|---|---|
![]() | AsParallel | Enables parallelization of a query. (Defined by ParallelEnumerable.) |
![]() | AsQueryable | Converts an IEnumerable to an IQueryable. (Defined by Queryable.) |
![]() ![]() | Cast<TResult> | Casts the elements of an IEnumerable to the specified type. (Defined by Enumerable.) |
![]() ![]() | OfType<TResult> | Filters the elements of an IEnumerable based on a specified type. (Defined by Enumerable.) |
For the generic version of this collection, see System.Collections.Generic::Stack<T>.
Stack is implemented as a circular buffer.
The capacity of a Stack is the number of elements the Stack can hold. As elements are added to a Stack, the capacity is automatically increased as required through reallocation.
If Count is less than the capacity of the stack, Push is an O(1) operation. If the capacity needs to be increased to accommodate the new element, Push becomes an O(n) operation, where n is Count. Pop is an O(1) operation.
Stack accepts nullptr as a valid value and allows duplicate elements.
The following example shows how to create and add values to a Stack and how to print out its values.
using namespace System; using namespace System::Collections; void PrintValues( IEnumerable^ myCollection ); int main() { // Creates and initializes a new Stack. Stack^ myStack = gcnew Stack; myStack->Push( "Hello" ); myStack->Push( "World" ); myStack->Push( "!" ); // Displays the properties and values of the Stack. Console::WriteLine( "myStack" ); Console::WriteLine( "\tCount: {0}", myStack->Count ); Console::Write( "\tValues:" ); PrintValues( myStack ); } void PrintValues( IEnumerable^ myCollection ) { IEnumerator^ myEnum = myCollection->GetEnumerator(); while ( myEnum->MoveNext() ) { Object^ obj = safe_cast<Object^>(myEnum->Current); Console::Write( " {0}", obj ); } Console::WriteLine(); } /* This code produces the following output. myStack Count: 3 Values: ! World Hello */
Windows 7, Windows Vista SP1 or later, Windows XP SP3, Windows XP SP2 x64 Edition, Windows Server 2008 (Server Core not supported), Windows Server 2008 R2 (Server Core supported with SP1 or later), Windows Server 2003 SP2
The .NET Framework does not support all versions of every platform. For a list of the supported versions, see .NET Framework System Requirements.
Public static (Shared in Visual Basic) members of this type are thread safe. Any instance members are not guaranteed to be thread safe.
To guarantee the thread safety of the Stack, all operations must be done through the wrapper returned by the Synchronized method.
Enumerating through a collection is intrinsically not a thread-safe procedure. Even when a collection is synchronized, other threads can still modify the collection, which causes the enumerator to throw an exception. To guarantee thread safety during enumeration, you can either lock the collection during the entire enumeration or catch the exceptions resulting from changes made by other threads.
