aboutsummaryrefslogtreecommitdiffstats
path: root/src/main/javassist/bytecode/LongVector.java
blob: fd90045e0ef5ac4858df4c1b8203313832b0e17d (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
/*
 * Javassist, a Java-bytecode translator toolkit.
 * Copyright (C) 1999-2005 Shigeru Chiba. All Rights Reserved.
 *
 * The contents of this file are subject to the Mozilla Public License Version
 * 1.1 (the "License"); you may not use this file except in compliance with
 * the License.  Alternatively, the contents of this file may be used under
 * the terms of the GNU Lesser General Public License Version 2.1 or later.
 *
 * Software distributed under the License is distributed on an "AS IS" basis,
 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
 * for the specific language governing rights and limitations under the
 * License.
 */

package javassist.bytecode;

final class LongVector {
    static final int SIZE = 128;
    private int num;
    private Object[] objects;
    private LongVector next;

    public LongVector() {
        this(SIZE);
    }

    public LongVector(int initialSize) {
        num = 0;
        objects = new Object[initialSize];
        next = null;
    }

    public void addElement(Object obj) {
        LongVector p = this;
        while (p.next != null)
            p = p.next;

        if (p.num < p.objects.length)
            p.objects[p.num++] = obj;
        else {
            LongVector q = p.next = new LongVector(SIZE);
            q.objects[q.num++] = obj;
        }
    }

    public int size() {
        LongVector p = this;
        int s = 0;
        while (p != null) {
            s += p.num;
            p = p.next;
        }

        return s;
    }

    public Object elementAt(int i) {
        LongVector p = this;
        while (p != null)
            if (i < p.num)
                return p.objects[i];
            else {
                i -= p.num;
                p = p.next;
            }

        return null;
    }

/*
    public static void main(String [] args) {
        LongVector v = new LongVector(4);
        int i;
        for (i = 0; i < 128; ++i)
            v.addElement(new Integer(i));

        System.out.println(v.size());
        for (i = 0; i < v.size(); ++i) {
            System.out.print(v.elementAt(i));
            System.out.print(", ");
        }
    }
*/
}