Mercurial > hg > Members > tatsuki > bench > jungle-core

comparison src/main/java/jp/ac/u_ryukyu/ie/cr/tatsuki/jungle/test/findTreeAttributeThread.java @ 188:868a746996ad

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
minner change
author tatsuki
date Fri, 17 Apr 2015 22:12:44 +0900
parents d2b710337eaa
children
comparison
equal deleted inserted replaced
186:209df7faa37c 188:868a746996ad
1 package jp.ac.u_ryukyu.ie.cr.tatsuki.jungle.test; 1 package jp.ac.u_ryukyu.ie.cr.tatsuki.jungle.test;
2 2
3 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.JungleTree; 3 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.JungleTree;
4 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.TreeNode; 4 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.TreeNode;
5 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.InterfaceTraverser; 5 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.InterfaceTraverser;
6
7 import java.util.Iterator; 6 import java.util.Iterator;
8 7
9 /** 8 /**
10 * Created by e115731 on 15/03/20. 9 * Created by e115731 on 15/03/20.
11 */ 10 */
12 public class findTreeAttributeThread extends JungleBenchMarkThread { 11 public class findTreeAttributeThread extends JungleBenchMarkThread {
13 12
14 JungleTree tree; 13 JungleTree tree;
15 //InterfaceTraverser traverser;
16 private long findCount; 14 private long findCount;
17 15
18 boolean loop = true; 16 boolean loop = true;
19 17
20 public findTreeAttributeThread(JungleTree tree) { 18 public findTreeAttributeThread(JungleTree tree) {
21 this.tree = tree; 19 this.tree = tree;
22 // this.traverser = tree.getTraverser(true);
23 this.findCount = 0; 20 this.findCount = 0;
24 } 21 }
25 22
26 @Override 23 @Override
27 public long getFindCount() { 24 public long getFindCount() {
34 } 31 }
35 32
36 @Override 33 @Override
37 public void run() { 34 public void run() {
38 while (loop) { 35 while (loop) {
39 InterfaceTraverser traverser = tree.getTraverser(false); 36 InterfaceTraverser traverser = tree.getTraverser(true);
40 Iterator<TreeNode> it = traverser.find(null, "key", "0"); 37 Iterator<TreeNode> it = traverser.find(null, "key", "0");
41
42 if (it.hasNext()) { 38 if (it.hasNext()) {
43 findCount++; 39 findCount++;
44 } 40 }
45 } 41 }
46 } 42 }