Package bak.pcj.map

Examples of bak.pcj.map.IntKeyMap

34
35
36
37
38
39
40
41
42
43
44
45
46
    public IntKeyOpenHashMapBenchmark() {
        super(
            new IntKeyMapFactory() {
                public IntKeyMap create(int[] keys, Integer[] values) {
                    IntKeyMap m = new IntKeyOpenHashMap();
                    for (int i = 0; i < keys.length; i++)
                        m.put(keys[i], values[i]);
                    return m;
                }
            }
        );
    }
View Full Code Here
34
35
36
37
38
39
40
41
42
43
44
45
46
    public IntKeyChainedHashMapBenchmark() {
        super(
            new IntKeyMapFactory() {
                public IntKeyMap create(int[] keys, Integer[] values) {
                    IntKeyMap m = new IntKeyChainedHashMap();
                    for (int i = 0; i < keys.length; i++)
                        m.put(keys[i], values[i]);
                    return m;
                }
            }
        );
    }
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
61
62
63
        String name = v.getClass().getName();
        return name;
    }

    public String benchmarkPutExisting(DataSet dataSet) {
        IntKeyMap c = create(dataSet.get(0), dataSet.getObjects(0));
        int[] l = dataSet.get(0);
        Integer[] k = dataSet.getObjects(1);
        startTimer();
        for (int i = 0; i < l.length; i++)
            c.put(l[i], k[i]);
        stopTimer();
        return l.length + " overwriting calls to put() with " + l.length + " mappings";
    }
View Full Code Here
61
62
63
64
65
66
67
68
69
70
71
72
73
74
        stopTimer();
        return l.length + " overwriting calls to put() with " + l.length + " mappings";
    }

    public String benchmarkPutNonExisting(DataSet dataSet) {
        IntKeyMap c = create(dataSet.get(0), dataSet.getObjects(0));
        int[] l = dataSet.get(1);
        Integer[] ll = dataSet.getObjects(1);
        startTimer();
        for (int i = 0; i < l.length; i++)
            c.put(l[i], ll[i]);
        stopTimer();
        return l.length + " non-overwriting calls to put() with " + l.length + " mappings";
    }
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
83
84
        stopTimer();
        return l.length + " non-overwriting calls to put() with " + l.length + " mappings";
    }

    public String benchmarkGetExisting(DataSet dataSet) {
        IntKeyMap c = create(dataSet.get(0), dataSet.getObjects(0));
        int[] l = dataSet.get(0);
        startTimer();
        for (int i = 0; i < l.length; i++)
            c.get(l[i]);
        stopTimer();
        return l.length + " successful calls to get() with " + c.size() + " mappings";
    }
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
93
94
        stopTimer();
        return l.length + " successful calls to get() with " + c.size() + " mappings";
    }

    public String benchmarkGetNonExisting(DataSet dataSet) {
        IntKeyMap c = create(dataSet.get(0), dataSet.getObjects(0));
        int[] l = dataSet.get(1);
        startTimer();
        for (int i = 0; i < l.length; i++)
            c.get(l[i]);
        stopTimer();
        return l.length + " unsuccessful calls to get() with " + c.size() + " mappings";
    }
View Full Code Here
92
93
94
95
96
97
98
99
100
101
102
103
104
        stopTimer();
        return l.length + " unsuccessful calls to get() with " + c.size() + " mappings";
    }

    public String benchmarkRemoveExisting(DataSet dataSet) {
        IntKeyMap c = create(dataSet.get(0), dataSet.getObjects(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 + " mappings";
    }
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
113
114
        stopTimer();
        return l.length + " successful calls to remove() with " + l.length + " mappings";
    }

    public String benchmarkRemoveNonExisting(DataSet dataSet) {
        IntKeyMap c = create(dataSet.get(0), dataSet.getObjects(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 + " mappings";
    }
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
        stopTimer();
        return l.length + " unsuccessful calls to remove() with " + l.length + " mappings";
    }

    public String benchmarkIterator(DataSet dataSet) {
        IntKeyMap c = create(dataSet.get(0), dataSet.getObjects(0));
        startTimer();
        IntKeyMapIterator it = c.entries();
        while (it.hasNext()) {
            it.next();
            it.getKey();
            it.getValue();
        }
        stopTimer();
        return "Iteration over " + c.size() + " mappings";
    }
View Full Code Here
TOP

Related Classes of bak.pcj.map.IntKeyMap

  • bak.pcj.benchmark.IntKeyChainedHashMapBenchmark
  • bak.pcj.benchmark.IntKeyMapBenchmark
  • bak.pcj.benchmark.IntKeyOpenHashMapBenchmark
    • 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.