FixedSizeStack provides an easy Stack implementation width a fixed size to prevent Stack Overflows in another sense. : Stack « Collections Data Structure « C# / C Sharp

Home
C# / C Sharp
1.2D Graphics
2.Class Interface
3.Collections Data Structure
4.Components
5.Data Types
6.Database ADO.net
7.Date Time
8.Design Patterns
9.Development Class
10.Event
11.File Stream
12.Generics
13.GUI Windows Form
14.Internationalization I18N
15.Language Basics
16.LINQ
17.Network
18.Office
19.Reflection
20.Regular Expressions
21.Security
22.Services Event
23.Thread
24.Web Services
25.Windows
26.Windows Presentation Foundation
27.XML
28.XML LINQ
C# Book
C# / C Sharp by API
C# / CSharp Tutorial
C# / CSharp Open Source
C# / C Sharp » Collections Data Structure » StackScreenshots 
FixedSizeStack provides an easy Stack implementation width a fixed size to prevent Stack Overflows in another sense.
        

#region Using directives

using System;
using System.Collections;
using System.Text;

#endregion

namespace Hanoi.Utils
{
    /// <summary>
    /// FixedSizeStack provides an easy Stack implementation width a fixed size to prevent Stack Overflows in another sense.
    /// It also performs faster and lets you compare a few stacks at the same time.
    /// </summary>
    public class FixedSizeStack: IEnumerable
    {
        private int _size;
        /// <summary>
        /// The maximum size of the stack. When it's reached, it throws a new StackOverflowException while
        /// adding new element.
        /// </summary>
        public int Size
        {
            get return _size; }
        }

        private int _count;
        /// <summary>
        /// Number of items currently inserted.
        /// </summary>
        public int Count
        {
            get return _count; }
        }

        private object[] _stack;
  

        public FixedSizeStack(int size)
            : base()
        {
            if (size < 1)
                throw new NotSupportedException("A Stack must have at least one element");

            InitializeMembers(size);
        }

        private void InitializeMembers(int size)
        {
            _size = size;
            _count = 0;
            _stack = new object[_size];
            for (int i = 0; i < _size; i++)
                _stack[inull;
        }

        public object Peek()
        {
            int index = _count - 1;
            if (index < 0)
                return null;
            else
                return _stack[index];
        }

        public object Pop()
        {
            int index = _count - 1;
            if (index < 0)
                throw new InvalidOperationException("There is not element on the stack.");
            else
            {
                _count--;
                return _stack[index];
            }
        }

        public void Push(object obj)
        {
            if (_count == _size)
                throw new StackOverflowException();
            else
            {
                _stack[_count= obj;
                _count++;
            }
        }

        public IEnumerator GetEnumerator()
        {
            return _stack.GetEnumerator();
        }

        public object[] ToArray()
        {
            return (object[])_stack.Clone();
        }

        public override string ToString()
        {
            StringBuilder sb = new StringBuilder();
            for (int i = _size; i > 0; i++)
            {
                object o = _stack[i];
                if (o == null)
                    sb.Append("   |");
                else
                    sb.Append(" " + o.ToString() " |");
            }

            return sb.ToString();
        }
    }
}

   
    
    
    
    
    
    
    
  
Related examples in the same category
1.new Stack(new int[] { 1, 2, 3, 4, 5, 6 })
2.new Stack())
3.Implements the stack data type using an arrayImplements the stack data type using an array
4.Stack demo Stack demo
5.Stack to arrayStack to array
6.illustrates the use of a Stackillustrates the use of a Stack
7.A stack class for charactersA stack class for characters
8.Demonstrate the Stack classDemonstrate the Stack class
9.Stack(T) Class represents a variable size last-in-first-out (LIFO) collection of instances of the same arbitrary type.
10.Overflow Stack
11.Thread Safe Stack
12.A Stacked array is an integer array that contains a sequence of ascending integers.
13.Stack abstraction that also supports the IList interface
java2s.com  |  | Contact Us | Privacy Policy
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.