Mercurial > hg > Members > tatsuki > jungle-bench

comparison src/main/java/example/SimpleJungle.java @ 1:358d1797a35a

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
second commit
author one
date Tue, 04 Mar 2014 01:58:37 +0900
parents 81d5bb6831b2
children f716298e440a
comparison
equal deleted inserted replaced
0:81d5bb6831b2 1:358d1797a35a
4 4
5 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.DefaultJungle; 5 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.DefaultJungle;
6 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.Jungle; 6 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.Jungle;
7 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.JungleTree; 7 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.JungleTree;
8 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.JungleTreeEditor; 8 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.JungleTreeEditor;
9 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.core.Children;
9 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.core.Node; 10 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.core.Node;
10 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.DefaultNodePath; 11 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.DefaultNodePath;
11 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.DefaultTreeEditor; 12 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.DefaultTreeEditor;
12 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.DefaultTraverser; 13 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.DefaultTraverser;
13 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.Either; 14 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.Either;
37 38
38 Node node = tree.getRootNode(); 39 Node node = tree.getRootNode();
39 ByteBuffer v = node.getAttributes().get(key); 40 ByteBuffer v = node.getAttributes().get(key);
40 System.out.println(new String(v.array())); 41 System.out.println(new String(v.array()));
41 42
43 editor1 = tree.getTreeEditor();
44 either = editor1.addNewChildAt(root,0);
45 if(either.isA()){
46 Assert.fail();
47 }
48
49 editor1 = either.b();
50 either = editor1.success();
51 if(either.isA()){
52 Assert.fail();
53 }
54
55 editor1 = tree.getTreeEditor();
56 DefaultNodePath childPath = root.add(0);
57 either = editor1.putAttribute(childPath,key,value);
58 if(either.isA()){
59 Assert.fail();
60 }
61
62 editor1 = either.b();
63 either = editor1.success();
64 if(either.isA()){
65 Assert.fail();
66 }
67 node = tree.getRootNode();
68 Children<Node> children = node.getChildren();
69 Either<Error,Node> either2 = children.at(0);
70 if(either2.isA()){
71 Assert.fail();
72 }
73 Node childNode = either2.b();
74 ByteBuffer v2 = childNode.getAttributes().get(key);
75 System.out.println(new String(v2.array()));
42 } 76 }
43 } 77 }