antlr.v4.runtime.misc.IntegerStack source code

1 /*
2  * [The "BSD license"]
3  *  Copyright (c) 2012 Terence Parr
4  *  Copyright (c) 2012 Sam Harwell
5  *  All rights reserved.
6  *
7  *  Redistribution and use in source and binary forms, with or without
8  *  modification, are permitted provided that the following conditions
9  *  are met:
10  *
11  *  1. Redistributions of source code must retain the above copyright
12  *     notice, this list of conditions and the following disclaimer.
13  *  2. Redistributions in binary form must reproduce the above copyright
14  *     notice, this list of conditions and the following disclaimer in the
15  *     documentation and/or other materials provided with the distribution.
16  *  3. The name of the author may not be used to endorse or promote products
17  *     derived from this software without specific prior written permission.
18  *
19  *  THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
20  *  IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21  *  OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
22  *  IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
23  *  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
24  *  NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25  *  DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26  *  THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27  *  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
28  *  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29  */
30 
31 module antlr.v4.runtime.misc.IntegerStack;
32 
33 import antlr.v4.runtime.misc.IntegerList;
34 
35 // Class IntegerStack
36 /**
37  * TODO add class description
38  */
39 class IntegerStack : IntegerList
40 {
41 
42     public this()
43     {
44     }
45 
46     public this(int capacity)
47     {
48     }
49 
50     public this(IntegerStack list)
51     {
52         data_ = list.data;
53     }
54 
55     /**
56      * @uml
57      * @final
58      */
59     public final void push(int value)
60     {
61         data_ ~= value;
62     }
63 
64     /**
65      * @uml
66      * @final
67      */
68     public final int pop()
69     {
70         int i = data_[$-1];
71         data_.length --;
72         return i;
73     }
74 
75     /**
76      * @uml
77      * @final
78      */
79     public final int peek()
80     {
81         return data_[$-1];
82     }
83 
84 }