Package xbird.util.datetime

Examples of xbird.util.datetime.StopWatch

95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
    public void testInt2QMap() {
        StringBuilder buf = new StringBuilder(1024);
        System.gc();
        long free = SystemUtils.getHeapFreeMemory();
        buf.append(" free(init): " + free);
        StopWatch sw = new StopWatch("testInt2QMap");
        Int2QCache<Integer> lru = new Int2QCache<Integer>(LIMIT);
        for(int i = 0; i < LOOP; i++) {
            lru.put(i, i);
        }
        Random random = new Random();
        for(int i = 0; i < LOOP / 2; i++) {
            int r = random.nextInt(LOOP - 1);
            lru.put(r, r);
        }
        buf.insert(0, sw.toString());
        long used = free - SystemUtils.getHeapFreeMemory();
        buf.append(", used(before GC): " + used);
        System.gc();
        used = free - SystemUtils.getHeapFreeMemory();
        buf.append(", used(after GC): " + used);
View Full Code Here
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
    public void testLongLruMap() {
        StringBuilder buf = new StringBuilder(1024);
        System.gc();
        long free = SystemUtils.getHeapFreeMemory();
        buf.append(" free(init): " + free);
        StopWatch sw = new StopWatch("testLongLruMap");
        LongLRUMap<Integer> lru = new LongLRUMap<Integer>(LIMIT);
        for(int i = 0; i < LOOP; i++) {
            lru.put(i, i);
        }
        buf.insert(0, sw.toString());
        Random random = new Random();
        for(int i = 0; i < LOOP / 2; i++) {
            int r = random.nextInt(LOOP - 1);
            lru.put(r, r);
        }
View Full Code Here
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
    public void testLong2QMap() {
        StringBuilder buf = new StringBuilder(1024);
        System.gc();
        long free = SystemUtils.getHeapFreeMemory();
        buf.append(" free(init): " + free);
        StopWatch sw = new StopWatch("testLong2QMap");
        Long2QCache<Integer> lru = new Long2QCache<Integer>(LIMIT);
        for(int i = 0; i < LOOP; i++) {
            lru.put(i, i);
        }
        Random random = new Random();
        for(int i = 0; i < LOOP / 2; i++) {
            int r = random.nextInt(LOOP - 1);
            lru.put(r, r);
        }
        buf.insert(0, sw.toString());
        long used = free - SystemUtils.getHeapFreeMemory();
        buf.append(", used(before GC): " + used);
        System.gc();
        used = free - SystemUtils.getHeapFreeMemory();
        buf.append(", used(after GC): " + used);
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
        }
        Arrays.sort(keys);
        final int[] values = ArrayUtils.copy(keys);
        ArrayUtils.shuffle(values);

        final StopWatch watchdog1 = new StopWatch("Construction of " + repeat + " objects");
        btree.setBulkloading(true, 0.1f, 0.1f);
        final SortedMap<Integer, Set<Integer>> expected = new TreeMap<Integer, Set<Integer>>();
        for(int i = 0; i < repeat; i++) {
            int k = keys[i];
            int v = values[i];
            Set<Integer> vset = expected.get(k);
            if(vset == null) {
                vset = new HashSet<Integer>();
                expected.put(k, vset);
            }
            vset.add(v);
            btree.addValue(new Value(k), new Value(v));
        }
        System.err.println(watchdog1);

        final StopWatch watchdog2 = new StopWatch("Searching " + repeat + " objects");
        btree.setBulkloading(false, 0.1f, 0.1f);
        final SortedMap<Integer, Set<Integer>> actual = new TreeMap<Integer, Set<Integer>>();
        btree.search(new IndexConditionANY(), new CallbackHandler() {
            public boolean indexInfo(Value value, long pointer) {
                throw new UnsupportedOperationException();
View Full Code Here
52
53
54
55
56
57
58
59
60
61
62
    /*
     * Test method for 'xbird.util.IntHash.put(int, V)'
     */
    public void testPut() {
        StopWatch sw = new StopWatch();
        long[] keys = new long[100000];
        LongHash<Long> hash = new LongHash<Long>();
        Random random = new Random(System.currentTimeMillis());
        for(int i = 0; i < 100000; i++) {
            int key = random.nextInt();
View Full Code Here
52
53
54
55
56
57
58
59
60
61
62
    public void testPut10000000() {
        put(10000000);
    }

    public void put(int times) {
        StopWatch sw = new StopWatch("[Long2LongOpenHashTest] testPut" + times);
        List<Long> keys = new ArrayList<Long>(times);
        Long2LongOpenHash hash = new Long2LongOpenHash(times);
        Random random = new Random(System.currentTimeMillis());
        for(int i = 0; i < times; i++) {
            long key = random.nextLong();
View Full Code Here
TOP

Related Classes of xbird.util.datetime.StopWatch

  • benchmark.xmark.XMarkCollectionValidateTest
  • benchmark.xmark.XMarkRemoteTest
  • benchmark.xmark.XMarkTest
  • performance.indexes.IndexPerformanceTest
  • performance.remote.RemoteEvalLoadTest
  • performance.SAXParsePerformanceTest
  • scenario.engine.RemoteQueryTest
  • scenario.storage.BTreeScenarioTest
  • xbird.client.command.CommandInvoker
  • xbird.client.InteractiveShell
    • 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.