--- a/src/main/java/jp/ac/u_ryukyu/ie/cr/tatsuki/xml/FunctionThread.java	Sat Dec 06 12:00:21 2014 +0900
+++ b/src/main/java/jp/ac/u_ryukyu/ie/cr/tatsuki/xml/FunctionThread.java	Mon Dec 08 01:08:03 2014 +0900
@@ -9,44 +9,47 @@
 
 public class FunctionThread extends Thread {
 
-  JungleTree tree;
-  int findCount;
-  boolean loop = true;
+    JungleTree tree;
+    int findCount;
+    boolean loop = true;
 
-  public FunctionThread(JungleTree tree) {
-    this.tree = tree;
-    this.findCount = 0;
-  }
+    public FunctionThread(JungleTree tree) {
+        this.tree = tree;
+        this.findCount = 0;
+    }
 
-  public int getFindCount() {
-    return findCount;
-  }
+    public int getFindCount() {
+        return findCount;
+    }
+
+    public void set(boolean loop) {
+        this.loop = loop;
+    }
 
-  public void set(boolean loop) {
-    this.loop = loop;
-  }
-  
-  @Override
-  public void run() {
-    while (loop) {
-      
-      Random rnd = new Random();
-      String value = String.valueOf(rnd .nextInt(1000));
-      InterfaceTraverser traverser = tree.getTraverser(true);
-      Iterator<TreeNode> resultIterator = traverser.find((TreeNode node) -> {
-        String nodeValue = node.getAttributes().getString("KEY");
-        if (nodeValue == null)
-          return false;
-        if (nodeValue.equals(value))
-          return true;
-        return false;
-      }, "KEY", "3");
+    @Override
+    public void run() {
+        while (loop) {
+            
+            findCount++;
+            Random rnd = new Random();
 
-      for (; resultIterator.hasNext();) {
-        resultIterator.next();
-      }
+            String value = String.valueOf(rnd.nextInt(1000));
+            InterfaceTraverser traverser = tree.getTraverser(true);
+            Iterator<TreeNode> resultIterator = traverser.find(
+                    (TreeNode node) -> {
+                        String nodeValue = node.getAttributes()
+                                .getString("KEY");
+                        if (nodeValue == null)
+                            return false;
+                        if (nodeValue.equals(value))
+                            return true;
+                        return false;
+                    }, "KEY", value);
 
-      findCount++;
+            for (; resultIterator.hasNext();) {
+                resultIterator.next();
+            }
+
+        }
     }
-  }
 }