Package bak.pcj

Examples of bak.pcj.IntCollection

44
45
46
47
48
49
50
51
52
53
54
55
56
    // ---------------------------------------------------------------
    //      Overriden methods
    // ---------------------------------------------------------------

    public String benchmarkContainsExisting(DataSet dataSet) {
        IntCollection c = create(dataSet.get(0));
        int[] l = dataSet.get(0);
        startTimer();
        for (int i = 0; i < SMALL_SIZE; i++)
            c.contains(l[i % l.length]);
        stopTimer();
        return SMALL_SIZE + " successful calls to contains() with " + c.size() + " elements";
    }
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
65
66
        stopTimer();
        return SMALL_SIZE + " successful calls to contains() with " + c.size() + " elements";
    }

    public String benchmarkContainsNonExisting(DataSet dataSet) {
        IntCollection c = create(dataSet.get(0));
        int[] l = dataSet.get(1);
        startTimer();
        for (int i = 0; i < SMALL_SIZE; i++)
            c.contains(l[i % l.length]);
        stopTimer();
        return SMALL_SIZE + " unsuccessful calls to contains() with " + c.size() + " elements";
    }
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
75
76
        stopTimer();
        return SMALL_SIZE + " unsuccessful calls to contains() with " + c.size() + " elements";
    }

    public String benchmarkRemoveExisting(DataSet dataSet) {
        IntCollection c = create(dataSet.get(0));
        int[] l = dataSet.get(0);
        startTimer();
        for (int i = 0; i < SMALL_SIZE; i++)
            c.remove(l[i % l.length]);
        stopTimer();
        return SMALL_SIZE + " successful calls to remove() with " + l.length + " existing elements";
    }
View Full Code Here
74
75
76
77
78
79
80
81
82
83
84
85
86
        stopTimer();
        return SMALL_SIZE + " successful calls to remove() with " + l.length + " existing elements";
    }

    public String benchmarkRemoveNonExisting(DataSet dataSet) {
        IntCollection c = create(dataSet.get(0));
        int[] l = dataSet.get(1);
        startTimer();
        for (int i = 0; i < SMALL_SIZE; i++)
            c.remove(l[i % l.length]);
        stopTimer();
        return SMALL_SIZE + " unsuccessful calls to remove() with " + l.length + " existing elements";
    }
View Full Code Here
44
45
46
47
48
49
50
51
52
53
54
55
56
        String name = v.getClass().getName();
        return name;
    }

    public String benchmarkAddExisting(DataSet dataSet) {
        IntCollection c = create(dataSet.get(0));
        int[] l = dataSet.get(0);
        startTimer();
        for (int i = 0; i < l.length; i++)
            c.add(l[i]);
        stopTimer();
        return l.length + " overwriting calls to add() with " + l.length + " elements";
    }
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
65
66
        stopTimer();
        return l.length + " overwriting calls to add() with " + l.length + " elements";
    }

    public String benchmarkAddNonExisting(DataSet dataSet) {
        IntCollection c = create(dataSet.get(0));
        int[] l = dataSet.get(1);
        startTimer();
        for (int i = 0; i < l.length; i++)
            c.add(l[i]);
        stopTimer();
        return l.length + " non-overwriting calls to add() with " + l.length + " elements";
    }
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
75
76
        stopTimer();
        return l.length + " non-overwriting calls to add() with " + l.length + " elements";
    }

    public String benchmarkContainsExisting(DataSet dataSet) {
        IntCollection c = create(dataSet.get(0));
        int[] l = dataSet.get(0);
        startTimer();
        for (int i = 0; i < l.length; i++)
            c.contains(l[i]);
        stopTimer();
        return l.length + " successful calls to contains() with " + c.size() + " elements";
    }
View Full Code Here
74
75
76
77
78
79
80
81
82
83
84
85
86
        stopTimer();
        return l.length + " successful calls to contains() with " + c.size() + " elements";
    }

    public String benchmarkContainsNonExisting(DataSet dataSet) {
        IntCollection c = create(dataSet.get(0));
        int[] l = dataSet.get(1);
        startTimer();
        for (int i = 0; i < l.length; i++)
            c.contains(l[i]);
        stopTimer();
        return l.length + " unsuccessful calls to contains() with " + c.size() + " elements";
    }
View Full Code Here
84
85
86
87
88
89
90
91
92
93
94
95
96
        stopTimer();
        return l.length + " unsuccessful calls to contains() with " + c.size() + " elements";
    }

    public String benchmarkRemoveExisting(DataSet dataSet) {
        IntCollection c = create(dataSet.get(0));
        int[] l = dataSet.get(0);
        startTimer();
        for (int i = 0; i < l.length; i++)
            c.remove(l[i]);
        stopTimer();
        return l.length + " successful calls to remove() with " + l.length + " elements";
    }
View Full Code Here
94
95
96
97
98
99
100
101
102
103
104
105
106
        stopTimer();
        return l.length + " successful calls to remove() with " + l.length + " elements";
    }

    public String benchmarkRemoveNonExisting(DataSet dataSet) {
        IntCollection c = create(dataSet.get(0));
        int[] l = dataSet.get(1);
        startTimer();
        for (int i = 0; i < l.length; i++)
            c.remove(l[i]);
        stopTimer();
        return l.length + " unsuccessful calls to remove() with " + l.length + " elements";
    }
View Full Code Here
TOP

Related Classes of bak.pcj.IntCollection

  • bak.pcj.benchmark.IntCollectionBenchmark
  • 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.