Package com.google.common.base

Examples of com.google.common.base.Stopwatch.reset()

95
96
97
98
99
100
101
102
103
104
105
        treeId = createAndSaveTree(numEntries, true);
        sw.stop();
        System.err.println("Stored " + numEntries + " tree entries in " + sw + " ("
                + Math.round(numEntries / (sw.elapsed(TimeUnit.MILLISECONDS) / 1000D)) + "/s)");

        sw.reset().start();
        final RevTree tree = odb.getTree(treeId);
        sw.stop();
        System.err.println("Retrieved tree in " + sw);

        System.err.println("traversing with DepthTreeIterator...");
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
        final RevTree tree = odb.getTree(treeId);
        sw.stop();
        System.err.println("Retrieved tree in " + sw);

        System.err.println("traversing with DepthTreeIterator...");
        sw.reset().start();
        int counted = 0;
        for (DepthTreeIterator it = new DepthTreeIterator("", ObjectId.NULL, tree, odb,
                Strategy.CHILDREN); it.hasNext(); counted++) {
            NodeRef ref = it.next();
            if ((counted + 1) % (numEntries / 10) == 0) {
View Full Code Here
117
118
119
120
121
122
123
124
125
126
127
        sw.stop();
        System.err.println("\nTraversed " + counted + " in " + sw + " ("
                + Math.round(counted / (sw.elapsed(TimeUnit.MILLISECONDS) / 1000D)) + "/s)\n");

        System.err.println("traversing with DepthTreeIterator...");
        sw.reset().start();
        counted = 0;
        for (DepthTreeIterator it = new DepthTreeIterator("", ObjectId.NULL, tree, odb,
                Strategy.CHILDREN); it.hasNext(); counted++) {
            NodeRef ref = it.next();
            if ((counted + 1) % (numEntries / 10) == 0) {
View Full Code Here
146
147
148
149
150
151
152
153
154
155
156
        treeId = createAndSaveTree(numEntries, true);
        sw.stop();
        System.err.println("Stored " + numEntries + " tree entries in " + sw + " ("
                + Math.round(numEntries / (sw.elapsed(TimeUnit.MILLISECONDS) / 1000D)) + "/s)");

        sw.reset().start();
        final RevTree tree = odb.getTree(treeId);
        sw.stop();
        System.err.println("Retrieved tree in " + sw);

        {
View Full Code Here
165
166
167
168
169
170
171
172
173
174
175
                ObjectId newid = ObjectId.forString(name + "changed");
                Node ref = Node.create(name, newid, ObjectId.NULL, TYPE.FEATURE, null);
                randomEdits.put(random, ref);
            }
            RevTreeBuilder mutable = tree.builder(odb);
            sw.reset().start();
            for (Node ref : randomEdits.values()) {
                mutable.put(ref);
            }
            mutable.build();
            sw.stop();
View Full Code Here
181
182
183
184
185
186
187
188
189
190
191
        // .call();
        // System.out.println(treeStr);

        final FindTreeChild childFinder = repo.command(FindTreeChild.class).setParent(tree);

        sw.reset().start();
        System.err.println("Reading " + numEntries + " entries....");
        for (int i = 0; i < numEntries; i++) {
            if ((i + 1) % (numEntries / 10) == 0) {
                System.err.print("#" + (i + 1));
            } else if ((i + 1) % (numEntries / 100) == 0) {
View Full Code Here
189
190
191
192
193
194
195
196
197
198
199
        }
        System.err.printf("%,d nodes added in %s\n", numNodes, sw.stop());

        Collections.shuffle(nodeIds);

        sw.reset().start();
        CoordinateSequence sequence = cache.get(nodeIds);
        System.err.printf("requested %,d coordinates in %s\n", nodeIds.size(), sw.stop());
        assertNotNull(sequence);
        assertEquals(nodeIds.size(), sequence.size());
        long approxDbSize = caclDbSize();
View Full Code Here
196
197
198
199
200
201
202
203
204
205
206
      System.out.println(String.format("%d record%s selected (%f seconds)", rows, rows > 1 ? "s" : "", (float) watch.elapsed(TimeUnit.MILLISECONDS) / (float) 1000));
      if (query != queries[queries.length - 1]) {
        System.out.println();
      }
      watch.stop();
      watch.reset();
    }
    return 0;

  }
View Full Code Here
29
30
31
32
33
34
35
36
37
38
39
      if (i % 2 == 0) {
        m2.getDerived().setName("toto");
      } else {
        m2.getDerived().setName("titi");
      }
      sw.reset().start();
      models.add(compEngine.inspectChanges(m1, m2));
      if (i != 0) {
        moyParsing += sw.elapsedTime(TimeUnit.MICROSECONDS);
      }
//      System.out.print("Inspect Changes [" + i + "] : " + sw.elapsedTime(TimeUnit.MICROSECONDS) + " mus\n");
View Full Code Here
20
21
22
23
24
25
26
27
28
29
30
    Model m1 = new Model("titi");
    m1.setDerived(new Model("titi"));
    long moyParsing = 0;
    Stopwatch sw = new Stopwatch();
    for (int i = 0; i < MAX_LOOP; i++) {
      sw.reset().start();
      models.add(CompareTools.deepCopy(m1));
      if (i != 0) {
        moyParsing += sw.elapsedTime(TimeUnit.MICROSECONDS);
      }
//      System.out.print("DeepCopy [" + i + "] : " + sw.elapsedTime(TimeUnit.MICROSECONDS) + " mus\n");
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.