br.usp.each.saeg.asm.defuse.IntList Maven / Gradle / Ivy
/**
* asm-defuse: asm powered by definitions/uses analysis
* Copyright (c) 2013, 2020 Roberto Araujo ([email protected])
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the copyright holders nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
package br.usp.each.saeg.asm.defuse;
public class IntList {
private int val;
private IntList next;
public IntList() {
val = 0;
}
private IntList(final int v) {
val = v;
}
public void add(final int v) {
final IntList currentNext = next;
val++;
next = new IntList(v);
next.next = currentNext;
}
public int[] toArray() {
final int[] values = new int[val];
IntList current = next;
for (int i = val - 1; i >= 0; i--) {
values[i] = current.val;
current = current.next;
}
return values;
}
public int[] toReverseArray() {
final int[] values = new int[val];
IntList current = next;
for (int i = 0; i < val; i++) {
values[i] = current.val;
current = current.next;
}
return values;
}
public void clear() {
IntList x = this;
val = 0;
while (x != null) {
final IntList next = x.next;
x.next = null;
x = next;
}
}
}