From 076e4393f25bf1ad1ff1bd2853153e2b595dd90b Mon Sep 17 00:00:00 2001 From: Roman Shevchenko Date: Thu, 28 Aug 2014 21:34:14 +0400 Subject: java-decompiler: post-import cleanup (formatting and copyright) --- .../jetbrains/java/decompiler/util/ListStack.java | 178 ++++++++++----------- 1 file changed, 89 insertions(+), 89 deletions(-) (limited to 'src/org/jetbrains/java/decompiler/util/ListStack.java') diff --git a/src/org/jetbrains/java/decompiler/util/ListStack.java b/src/org/jetbrains/java/decompiler/util/ListStack.java index fa36a0b..20c6614 100644 --- a/src/org/jetbrains/java/decompiler/util/ListStack.java +++ b/src/org/jetbrains/java/decompiler/util/ListStack.java @@ -1,101 +1,101 @@ /* - * Fernflower - The Analytical Java Decompiler - * http://www.reversed-java.com + * Copyright 2000-2014 JetBrains s.r.o. * - * (C) 2008 - 2010, Stiver + * 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 * - * This software is NEITHER public domain NOR free software - * as per GNU License. See license.txt for more details. + * http://www.apache.org/licenses/LICENSE-2.0 * - * This software is distributed WITHOUT ANY WARRANTY; without - * even the implied warranty of MERCHANTABILITY or FITNESS FOR - * A PARTICULAR PURPOSE. + * 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 org.jetbrains.java.decompiler.util; import java.util.ArrayList; public class ListStack extends ArrayList { - protected int pointer = 0; - - public ListStack(){ - super(); - } - - public ListStack(ArrayList list){ - super(list); - } - - public ListStack clone() { - ListStack newstack = new ListStack(this); - newstack.pointer = this.pointer; - return newstack; - } - - public T push(T item) { - this.add(item); - pointer++; - return item; - } - - public T pop() { - pointer--; - T o = this.get(pointer); - this.remove(pointer); - return o; - } - - public T pop(int count) { - T o = null; - for(int i=count;i>0;i--) { - o = this.pop(); - } - return o; - } - - public void remove() { - pointer--; - this.remove(pointer); - } - - public void removeMultiple(int count) { - while(count>0) { - pointer--; - this.remove(pointer); - count--; - } - } - - public boolean empty() { - return (pointer==0); - } - - public int getPointer() { - return pointer; - } - - public T get(int index) { - return super.get(index); - } - - public T set(int index, T element) { - return super.set(index, element); - } - - public T getByOffset(int offset) { - return this.get(pointer+offset); - } - - public void insertByOffset(int offset, T item) { - this.add(pointer+offset, item); - pointer++; - } - - public void clear() { - super.clear(); - pointer = 0; - } - + protected int pointer = 0; + + public ListStack() { + super(); + } + + public ListStack(ArrayList list) { + super(list); + } + + public ListStack clone() { + ListStack newstack = new ListStack(this); + newstack.pointer = this.pointer; + return newstack; + } + + public T push(T item) { + this.add(item); + pointer++; + return item; + } + + public T pop() { + pointer--; + T o = this.get(pointer); + this.remove(pointer); + return o; + } + + public T pop(int count) { + T o = null; + for (int i = count; i > 0; i--) { + o = this.pop(); + } + return o; + } + + public void remove() { + pointer--; + this.remove(pointer); + } + + public void removeMultiple(int count) { + while (count > 0) { + pointer--; + this.remove(pointer); + count--; + } + } + + public boolean empty() { + return (pointer == 0); + } + + public int getPointer() { + return pointer; + } + + public T get(int index) { + return super.get(index); + } + + public T set(int index, T element) { + return super.set(index, element); + } + + public T getByOffset(int offset) { + return this.get(pointer + offset); + } + + public void insertByOffset(int offset, T item) { + this.add(pointer + offset, item); + pointer++; + } + + public void clear() { + super.clear(); + pointer = 0; + } } -- cgit v1.2.3