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.
Initializes a new instance of the Stack class that contains elements copied from the specified collection and has sufficient capacity to accommodate the number of elements copied. Initializes a new instance of the Stack class that is empty and has the default initial capacity. Stack accepts null as a valid value for reference types and allows duplicate elements. If the capacity needs to be increased to accommodate the new element, Push becomes an O( n) operation, where n is Count. If Count is less than the capacity of the stack, Push is an O(1) operation. The capacity can be decreased by calling TrimExcess. As elements are added to a Stack, the capacity is automatically increased as required by reallocating the internal array. The capacity of a Stack is the number of elements the Stack can hold. Peek returns an element that is at the top of the Stack but does not remove it from the Stack. Pop removes an element from the top of the Stack. Push inserts an element at the top of the Stack. Three main operations can be performed on a and its elements: Use the and types when you need to access the collection from multiple threads concurrently.Ī common use for is to preserve variable states during calls to other procedures. Use if you need to access the information in reverse order. Use Queue if you need to access the information in the same order that it is stored in the collection. Stacks and queues are useful when you need temporary storage for information that is, when you might want to discard an element after retrieving its value. 'Contents of the second copy, with duplicates and nulls:
#KEEP IT A STACK CODE#
' This code example produces the following output: A stack can be enumerated without disturbing its contents.Ĭonsole.WriteLine("\nPopping '", _ The Contains method is used to show that the string "four" is in the first copy of the stack, after which the Clear method clears the copy and the Count property shows that the stack is empty. The Stack constructor is used again to create a copy of the stack with the order of elements reversed thus, the three null elements are at the end. The elements of the copy are displayed.Īn array twice the size of the stack is created, and the CopyTo method is used to copy the array elements beginning at the middle of the array. The ToArray method is used to create an array and copy the stack elements to it, then the array is passed to the Stack constructor that takes IEnumerable, creating a copy of the stack with the order of the elements reversed. The Peek method is used to look at the next item on the stack, and then the Pop method is used to pop it off. The Pop method is used to pop the first string off the stack. The elements of the stack are enumerated, which does not change the state of the stack. The code example creates a stack of strings with default capacity and uses the Push method to push five strings onto the stack. The following code example demonstrates several methods of the Stack generic class. IEnumerable IReadOnl圜ollection ICollection IEnumerable Examples Implements ICollection, IEnumerable(Of T) Type Parameters Implements ICollection, IEnumerable(Of T), IReadOnl圜ollection(Of T) Public Class Stack(Of T)
Interface IEnumerable Public Class Stack(Of T) Interface IReadOnl圜ollection type Stack = class Public class Stack :, 圜ollection, public class Stack :, type Stack = class Public ref class Stack : System::Collections::Generic::IEnumerable, System::Collections::ICollection public class Stack :, 圜ollection, Public ref class Stack : System::Collections::Generic::IEnumerable, System::Collections::Generic::IReadOnl圜ollection, System::Collections::ICollection generic Represents a variable size last-in-first-out (LIFO) collection of instances of the same specified type.
0 kommentar(er)
