| /* |
| * Copyright 2000-2014 JetBrains s.r.o. |
| * |
| * Licensed under the Apache License, Version 2.0 (the "License"); |
| * you may not use this file except in compliance with the License. |
| * You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| package com.intellij.util.containers; |
| |
| /** |
| * @author lambdamix |
| */ |
| import java.util.EmptyStackException; |
| |
| public class LongStack { |
| private long[] data; |
| private int size; |
| public LongStack(int initialCapacity) { |
| data = new long[initialCapacity]; |
| size = 0; |
| } |
| |
| public LongStack() { |
| this(5); |
| } |
| |
| public void push(long t) { |
| if (size >= data.length) { |
| long[] newdata = new long[data.length * 3 / 2]; |
| System.arraycopy(data, 0, newdata, 0, size); |
| data = newdata; |
| } |
| data[size++] = t; |
| } |
| |
| public long peek() { |
| if (size == 0) throw new EmptyStackException(); |
| return data[size - 1]; |
| } |
| |
| public long pop() { |
| if (size == 0) throw new EmptyStackException(); |
| return data[--size]; |
| } |
| |
| public boolean empty() { |
| return size == 0; |
| } |
| |
| @Override |
| public boolean equals(Object o) { |
| if (o instanceof LongStack) { |
| LongStack otherStack = (LongStack)o; |
| if (size != otherStack.size) return false; |
| for (int i = 0; i < otherStack.size; i++) { |
| if (data[i] != otherStack.data[i]) return false; |
| } |
| return true; |
| } |
| |
| return false; |
| } |
| |
| public void clear() { |
| size = 0; |
| } |
| } |