comparison src/test/java/jp/ac/u_ryukyu/ie/cr/shoshi/jungle/core/impl/treeeditor/DefaultTreeEditorTest.java @ 81:715a9fbf02fc

remove <T> many source
author one
date Sun, 31 Aug 2014 07:46:30 +0900
parents 053c9b52a5b2
children fb1dc448ac8c
comparison
equal deleted inserted replaced
80:a833000f64bf 81:715a9fbf02fc
1 package jp.ac.u_ryukyu.ie.cr.shoshi.jungle.core.impl.treeeditor; 1 package jp.ac.u_ryukyu.ie.cr.shoshi.jungle.core.impl.treeeditor;
2 2
3 import java.nio.ByteBuffer; 3 import java.nio.ByteBuffer;
4
4 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.DefaultNodePath; 5 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.DefaultNodePath;
5 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.DefaultTreeEditor; 6 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.DefaultTreeEditor;
7 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.TreeNode;
6 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.trasnformer.AppendChildAt; 8 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.trasnformer.AppendChildAt;
7 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.trasnformer.PutAttribute; 9 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.trasnformer.PutAttribute;
8 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.tests.util.TestUtil; 10 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.tests.util.TestUtil;
9 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.transaction.DefaultTreeNode; 11 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.transaction.DefaultTreeNode;
10 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.DefaultEvaluator; 12 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.DefaultEvaluator;
23 return new DefaultTreeEditor(traverser); 25 return new DefaultTreeEditor(traverser);
24 } 26 }
25 27
26 public void testEdittingDoesNotEffectToOtherTree() 28 public void testEdittingDoesNotEffectToOtherTree()
27 { 29 {
28 DefaultTreeNode root = TestUtil.createMockTree(3); 30 TreeNode root = TestUtil.createMockTree(3);
29 DefaultTreeEditor editor = new DefaultTreeEditor(new DefaultTraverser()); 31 DefaultTreeEditor editor = new DefaultTreeEditor(new DefaultTraverser());
30 DefaultNodePath path = new DefaultNodePath().add(0).add(2); 32 DefaultNodePath path = new DefaultNodePath().add(0).add(2);
31 33
32 DefaultTreeNode oldRoot = root; 34 TreeNode oldRoot = root;
33 35
34 DefaultTreeEditor currentEditor = editor; 36 DefaultTreeEditor currentEditor = editor;
35 String key = "path"; 37 String key = "path";
36 38
37 39
38 DefaultTreeNode currentRoot = root; 40 TreeNode currentRoot = root;
39 for(DefaultNodePath part : path.inits()){ 41 for(DefaultNodePath part : path.inits()){
40 ByteBuffer value = ByteBuffer.wrap(part.toString().getBytes()); 42 ByteBuffer value = ByteBuffer.wrap(part.toString().getBytes());
41 PutAttribute putAttribute = new PutAttribute(key,value); 43 PutAttribute putAttribute = new PutAttribute(key,value);
42 Either<Error,DefaultTreeNode> either = currentEditor.edit(currentRoot,part,putAttribute); 44 Either<Error,TreeNode> either = currentEditor.edit(currentRoot,part,putAttribute);
43 if(either.isA()){ 45 if(either.isA()){
44 Assert.fail(); 46 Assert.fail();
45 } 47 }
46 currentRoot = either.b(); 48 currentRoot = either.b();
47 } 49 }
48 50
49 DefaultTreeNode newRoot = currentRoot; 51 TreeNode newRoot = currentRoot;
50 DefaultTraverser traverser = new DefaultTraverser(); 52 DefaultTraverser traverser = new DefaultTraverser();
51 53
52 for(DefaultNodePath part : path.inits()){ 54 for(DefaultNodePath part : path.inits()){
53 Either<Error,Traversal<DefaultTreeNode>> either = traverser.traverse(newRoot,new DefaultEvaluator(part)); 55 Either<Error,Traversal<TreeNode>> either = traverser.traverse(newRoot,new DefaultEvaluator(part));
54 if(either.isA()){ 56 if(either.isA()){
55 Assert.fail(); 57 Assert.fail();
56 } 58 }
57 DefaultTreeNode target = either.b().destination(); 59 TreeNode target = either.b().destination();
58 String expected = part.toString(); 60 String expected = part.toString();
59 String actual = new String(target.getAttributes().get(key).array()); 61 String actual = new String(target.getAttributes().get(key).array());
60 62
61 Assert.assertEquals(expected,actual); 63 Assert.assertEquals(expected,actual);
62 } 64 }
63 65
64 for(DefaultNodePath part : path.inits()){ 66 for(DefaultNodePath part : path.inits()){
65 Either<Error,Traversal<DefaultTreeNode>> either = traverser.traverse(oldRoot,new DefaultEvaluator(part)); 67 Either<Error,Traversal<TreeNode>> either = traverser.traverse(oldRoot,new DefaultEvaluator(part));
66 if(either.isA()){ 68 if(either.isA()){
67 Assert.fail(); 69 Assert.fail();
68 } 70 }
69 DefaultTreeNode target = either.b().destination(); 71 TreeNode target = either.b().destination();
70 ByteBuffer actual = target.getAttributes().get(key); 72 ByteBuffer actual = target.getAttributes().get(key);
71 73
72 Assert.assertNull(actual); 74 Assert.assertNull(actual);
73 } 75 }
74 76
78 { 80 {
79 DefaultTreeEditor instance = instance(); 81 DefaultTreeEditor instance = instance();
80 DefaultTreeNode node = new DefaultTreeNode(); 82 DefaultTreeNode node = new DefaultTreeNode();
81 DefaultNodePath path = new DefaultNodePath(); 83 DefaultNodePath path = new DefaultNodePath();
82 84
83 Either<Error,DefaultTreeNode> either = instance.edit(node,path,new AppendChildAt(0)); 85 Either<Error,TreeNode> either = instance.edit(node,path,new AppendChildAt(0));
84 if(either.isA()){ 86 if(either.isA()){
85 Assert.fail(); 87 Assert.fail();
86 } 88 }
87 DefaultTreeNode newRoot = either.b(); 89 TreeNode newRoot = either.b();
88 Assert.assertEquals(1,newRoot.getChildren().size()); 90 Assert.assertEquals(1,newRoot.getChildren().size());
89 } 91 }
90 } 92 }