Package bak.pcj.list

Examples of bak.pcj.list.IntList

33
34
35
36
37
38
39
40
41
42
43
44
45
    public IntArrayDequeBenchmark() {
        super(
            new IntListFactory() {
                public IntList create(int[] elements) {
                    IntList s = new IntArrayDeque(elements.length);
                    for (int i = 0; i < elements.length; i++)
                        s.add(elements[i]);
                    return s;
                }
            }
        );
    }
View Full Code Here
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
    // ---------------------------------------------------------------
    //      List methods
    // ---------------------------------------------------------------

    public String benchmarkAddMiddle(DataSet dataSet) {
        IntList c = (IntList)create(dataSet.get(0));
        int[] l = dataSet.get(0);
        int size = l.length;
        startTimer();
        for (int i = 0; i < SMALL_SIZE; i++) {
            c.add(size/2, l[i % l.length]);
            size++;
        }
        stopTimer();
        return SMALL_SIZE + " calls to add(int,int) at middle of list with " + l.length + " existing elements";
    }
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
        stopTimer();
        return SMALL_SIZE + " calls to add(int,int) at middle of list with " + l.length + " existing elements";
    }

    public String benchmarkAddBeginning(DataSet dataSet) {
        IntList c = (IntList)create(dataSet.get(0));
        int[] l = dataSet.get(0);
        int size = l.length;
        startTimer();
        for (int i = 0; i < SMALL_SIZE; i++) {
            c.add(0, l[i % l.length]);
            size++;
        }
        stopTimer();
        return SMALL_SIZE + " calls to add(int,int) at beginning of list with " + l.length + " existing elements";
    }
View Full Code Here
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
        stopTimer();
        return SMALL_SIZE + " calls to add(int,int) at beginning of list with " + l.length + " existing elements";
    }

    public String benchmarkRemoveMiddle(DataSet dataSet) {
        IntList c = (IntList)create(dataSet.get(0));
        int[] l = dataSet.get(0);
        int size = l.length;
        startTimer();
        for (int i = 0; i < SMALL_SIZE; i++) {
            if (size == 0) break;
            c.removeElementAt(size/2);
            size--;
        }
        stopTimer();
        return SMALL_SIZE + " calls to removeElementAt(int) at middle of list with " + l.length + " existing elements";
    }
View Full Code Here
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
        stopTimer();
        return SMALL_SIZE + " calls to removeElementAt(int) at middle of list with " + l.length + " existing elements";
    }

    public String benchmarkRemoveBeginning(DataSet dataSet) {
        IntList c = (IntList)create(dataSet.get(0));
        int[] l = dataSet.get(0);
        int size = l.length;
        startTimer();
        for (int i = 0; i < SMALL_SIZE; i++) {
            if (size == 0) break;
            c.removeElementAt(0);
            size--;
        }
        stopTimer();
        return SMALL_SIZE + " calls to removeElementAt(int) at beginning of list with " + l.length + " existing elements";
    }
View Full Code Here
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
        stopTimer();
        return SMALL_SIZE + " calls to removeElementAt(int) at beginning of list with " + l.length + " existing elements";
    }

    public String benchmarkRemoveEnd(DataSet dataSet) {
        IntList c = (IntList)create(dataSet.get(0));
        int[] l = dataSet.get(0);
        int size = l.length;
        startTimer();
        for (int i = 0; i < SMALL_SIZE; i++) {
            if (size == 0) break;
            c.removeElementAt(size-1);
            size--;
        }
        stopTimer();
        return SMALL_SIZE + " calls to removeElementAt(int) at end of list with " + l.length + " existing elements";
    }
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
44
45
    public IntArrayListBenchmark() {
        super(
            new IntListFactory() {
                public IntList create(int[] elements) {
                    IntList s = new IntArrayList(elements.length);
                    for (int i = 0; i < elements.length; i++)
                        s.add(elements[i]);
                    return s;
                }
            }
        );
    }
View Full Code Here
TOP

Related Classes of bak.pcj.list.IntList

  • bak.pcj.benchmark.IntArrayDequeBenchmark
  • bak.pcj.benchmark.IntArrayListBenchmark
  • bak.pcj.benchmark.IntListBenchmark
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.