annotate src/uk/ac/qmul/eecs/ccmi/utilities/Stack.java @ 1:66b3a838feca logging tip

Added logging of user interaction
author Fiore Martin <fiore@eecs.qmul.ac.uk>
date Tue, 12 Feb 2013 15:31:48 +0000
parents e0ee6ac3a45f
children
rev   line source
fiore@0 1 /*
fiore@0 2 CCmI Diagram Editor for Android
fiore@0 3
fiore@0 4 Copyright (C) 2012 Queen Mary University of London (http://ccmi.eecs.qmul.ac.uk/)
fiore@0 5
fiore@0 6 This program is free software: you can redistribute it and/or modify
fiore@0 7 it under the terms of the GNU General Public License as published by
fiore@0 8 the Free Software Foundation, either version 3 of the License, or
fiore@0 9 (at your option) any later version.
fiore@0 10
fiore@0 11 This program is distributed in the hope that it will be useful,
fiore@0 12 but WITHOUT ANY WARRANTY; without even the implied warranty of
fiore@0 13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
fiore@0 14 GNU General Public License for more details.
fiore@0 15
fiore@0 16 You should have received a copy of the GNU General Public License
fiore@0 17 along with this program. If not, see <http://www.gnu.org/licenses/>.
fiore@0 18 */
fiore@0 19 package uk.ac.qmul.eecs.ccmi.utilities;
fiore@0 20
fiore@0 21 import java.util.ArrayList;
fiore@0 22
fiore@0 23 /**
fiore@0 24 *
fiore@0 25 * The stack is an {@code ArrayList} with a simplified interface for pushing and popping elements
fiore@0 26 * on and from the top
fiore@0 27 *
fiore@0 28 * @param <T> The type of objects contained in this stack
fiore@0 29 */
fiore@0 30 public class Stack<T> extends ArrayList<T> {
fiore@0 31
fiore@0 32 /**
fiore@0 33 * Create a stack with an initial capacity of {@code size}
fiore@0 34 *
fiore@0 35 * @param size the initial capacity
fiore@0 36 */
fiore@0 37 public Stack(int size){
fiore@0 38 super(size);
fiore@0 39 }
fiore@0 40
fiore@0 41 /**
fiore@0 42 * Returns the size of the stack
fiore@0 43 *
fiore@0 44 * @return the size of the stack
fiore@0 45 */
fiore@0 46 @Override
fiore@0 47 public int size(){
fiore@0 48 return super.size();
fiore@0 49 }
fiore@0 50
fiore@0 51 /**
fiore@0 52 * Return the index of the top element for the stack
fiore@0 53 *
fiore@0 54 * @return index of the top element for the stack or -1 if the stack is empty
fiore@0 55 */
fiore@0 56 public int level(){
fiore@0 57 return size()-1;
fiore@0 58 }
fiore@0 59
fiore@0 60 /**
fiore@0 61 * Adds a new element at the top of the stack. Like in an {@code ArrayList},
fiore@0 62 * the same object can be inserted more than once in the stack
fiore@0 63 *
fiore@0 64 * @param n the new element to add
fiore@0 65 */
fiore@0 66 public void push(T n){
fiore@0 67 add(n);
fiore@0 68 }
fiore@0 69
fiore@0 70 /**
fiore@0 71 * Removes the top element of the stack
fiore@0 72 *
fiore@0 73 * @return the removed element or {@code null} if the stack is empty
fiore@0 74 */
fiore@0 75 public T pop(){
fiore@0 76 if(size() == 0)
fiore@0 77 return null;
fiore@0 78 return remove(size()-1);
fiore@0 79 }
fiore@0 80
fiore@0 81 /**
fiore@0 82 * Returns a reference to the top element of the stack, the element is not removed
fiore@0 83 *
fiore@0 84 * @return the top element of the stack
fiore@0 85 */
fiore@0 86 public T current(){
fiore@0 87 if(size() == 0)
fiore@0 88 return null;
fiore@0 89 return get(size()-1);
fiore@0 90 }
fiore@0 91
fiore@0 92 private static final long serialVersionUID = 1L;
fiore@0 93 }