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

comparison src/test/java/jp/ac/u_ryukyu/ie/cr/shoshi/jungle/tests/util/TestUtil.java @ 54:650fe2a0dccc

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
modified tests
author Shoshi TAMAKI
date Fri, 08 Feb 2013 17:08:42 +0900
parents fb00d7b147c8
children a3a8c49ad209
comparison
equal deleted inserted replaced
53:ed890dcb673e 54:650fe2a0dccc
2 2
3 import java.nio.ByteBuffer; 3 import java.nio.ByteBuffer;
4 4
5 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.NodePath; 5 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.NodePath;
6 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.DefaultNodePath; 6 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.DefaultNodePath;
7 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.transaction.ClonableDefaultNode; 7 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.transaction.DefaultTreeNode;
8 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.Either; 8 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.Either;
9 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.Error; 9 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.Error;
10 10
11 public class TestUtil 11 public class TestUtil
12 { 12 {
13 public static ClonableDefaultNode createMockTree(int _maxDepth) 13 public static DefaultTreeNode createMockTree(int _maxDepth)
14 { 14 {
15 return _createMockTree(1,_maxDepth,new DefaultNodePath()); 15 return _createMockTree(1,_maxDepth,new DefaultNodePath());
16 } 16 }
17 17
18 public static ClonableDefaultNode _createMockTree(int _currentDepth,int _maxDepth,NodePath _path) 18 public static DefaultTreeNode _createMockTree(int _currentDepth,int _maxDepth,NodePath _path)
19 { 19 {
20 ClonableDefaultNode parent = new ClonableDefaultNode(); 20 DefaultTreeNode parent = new DefaultTreeNode();
21 Either<Error, ClonableDefaultNode> either = parent.getAttributes().put("KEY",ByteBuffer.wrap(_path.toString().getBytes())); 21 Either<Error, DefaultTreeNode> either = parent.getAttributes().put("KEY",ByteBuffer.wrap(_path.toString().getBytes()));
22 if(either.isA()){ 22 if(either.isA()){
23 return null; 23 return null;
24 } 24 }
25 parent = either.b(); 25 parent = either.b();
26 26
27 if(_currentDepth != _maxDepth){ 27 if(_currentDepth != _maxDepth){
28 for(int i = 0;i <= _currentDepth;i ++){ 28 for(int i = 0;i <= _currentDepth;i ++){
29 ClonableDefaultNode ch = _createMockTree(_currentDepth + 1,_maxDepth,_path.add(i)); 29 DefaultTreeNode ch = _createMockTree(_currentDepth + 1,_maxDepth,_path.add(i));
30 either = parent.getChildren().addNewChildAt(i,ch); 30 either = parent.getChildren().addNewChildAt(i,ch);
31 if(either.isA()){ 31 if(either.isA()){
32 return null; 32 return null;
33 } 33 }
34 parent = either.b(); 34 parent = either.b();