Mercurial > hg > Members > tatsuki > jungle-bench

comparison src/main/java/jp/ac/u_ryukyu/ie/cr/tatsuki/xml/ReadJungleThread.java @ 19:17cc11b04157

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
change read function for transactionPerSecond
author one
date Sun, 15 Feb 2015 02:06:57 +0900
parents 917ecf2c7350
children 195c1a644550
comparison
equal deleted inserted replaced
18:190890be73e4 19:17cc11b04157
1 package jp.ac.u_ryukyu.ie.cr.tatsuki.xml; 1 package jp.ac.u_ryukyu.ie.cr.tatsuki.xml;
2 2
3 import java.util.Iterator; 3 import java.util.Iterator;
4 import java.util.Random; 4 import java.util.Random;
5 5
6 import jp.ac.u_ryukyu.cr.ie.tatsuki.xmlTestBbs.JuGrix;
6 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.JungleTree; 7 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.JungleTree;
7 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.TreeNode; 8 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.TreeNode;
8 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.InterfaceTraverser; 9 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.InterfaceTraverser;
9 10
10 public class ReadJungleThread extends Thread { 11 public class ReadJungleThread extends Thread {
11 12
12 JungleTree tree; 13 JuGrix jugrix;
13 int findCount; 14 int findCount;
14 boolean loop = true; 15 boolean loop = true;
15 16
16 public ReadJungleThread(JungleTree tree) { 17 public ReadJungleThread(JuGrix jugrix) {
17 this.tree = tree; 18 this.jugrix = jugrix;
18 this.findCount = 0; 19 this.findCount = 0;
19 } 20 }
20 21
21 public int getFindCount() { 22 public int getFindCount() {
22 return findCount; 23 return findCount;
31 while (loop) { 32 while (loop) {
32 33
33 findCount++; 34 findCount++;
34 Random rnd = new Random(); 35 Random rnd = new Random();
35 36
36 String value = String.valueOf(rnd.nextInt(1000)); 37 String value = String.valueOf(rnd.nextInt(400));
37 InterfaceTraverser traverser = tree.getTraverser(true); 38 boolean account = jugrix.isActive("p:" + value,"v:1");
38 Iterator<TreeNode> resultIterator = traverser.find( 39 // System.out.println(account);
39 (TreeNode node) -> {
40 String nodeValue = node.getAttributes().getString("KEY");
41 if (nodeValue == null)
42 return false;
43 if (nodeValue.equals(value))
44 return true;
45 return false;
46 }, "KEY", value);
47
48 for (; resultIterator.hasNext();) {
49 resultIterator.next();
50 }
51
52 } 40 }
53 } 41 }
54 } 42 }