Welcome to mirror list, hosted at ThFree Co, Russian Federation.

ByteStack.cs « Xml « System « System.Xml « referencesource « class « mcs - github.com/mono/mono.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: d1dac9ff8bef36537bf137c53b7b4f8485e60324 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
//------------------------------------------------------------------------------
// <copyright file="ByteStack.cs" company="Microsoft">
//     Copyright (c) Microsoft Corporation.  All rights reserved.
// </copyright>
// <owner current="true" primary="true">Microsoft</owner>
//------------------------------------------------------------------------------

using System;

namespace System.Xml {

// This stack is designed to minimize object creation for the
// objects being stored in the stack by allowing them to be
// re-used over time.  It basically pushes the objects creating
// a high water mark then as Pop() is called they are not removed
// so that next time Push() is called it simply returns the last
// object that was already on the stack.

    internal class ByteStack {
        private byte[] stack;
        private int growthRate;
        private int top;
        private int size;

        public ByteStack(int growthRate) {
            this.growthRate = growthRate;
            top = 0;
            stack = new byte[growthRate];
            size = growthRate; 
        }

        public void Push(byte data) {
            if (size == top) {
                byte[] newstack = new byte[size + growthRate];
                if (top > 0) {
                    Buffer.BlockCopy(stack, 0, newstack, 0, top);
                }
                stack = newstack;
                size += growthRate;
            }
            stack[top++] = data;
        }

        public byte Pop() {
            if (top > 0) {
                return stack[--top];
            } else {
                return 0;
            }
        }

        public byte Peek() {
            if (top > 0) {
                return stack[top - 1];
            } else {
                return 0;
            }
        }

        public int Length {
            get { 
                return top;
            }
        }
    }
}