145
|
1 package jp.ac.u_ryukyu.ie.cr.tatsuki.jungle.index;
|
|
2
|
146
|
3 import java.nio.ByteBuffer;
|
145
|
4 import java.util.Iterator;
|
|
5
|
|
6 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.DefaultJungle;
|
|
7 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.Jungle;
|
|
8 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.JungleTree;
|
|
9 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.JungleTreeEditor;
|
|
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.TreeNode;
|
|
12 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.DefaultTraverser;
|
|
13 import junit.framework.Assert;
|
|
14
|
|
15 import org.junit.Test;
|
|
16
|
146
|
17 import fj.data.List;
|
145
|
18 import fj.data.Option;
|
|
19 import fj.data.TreeMap;
|
|
20
|
|
21 public class ParentIndexTest {
|
|
22
|
|
23 @Test
|
|
24 public void testParentIndex() {
|
|
25 Jungle jungle = new DefaultJungle(null, "hogehoge", new DefaultTraverser());
|
|
26 jungle.createNewTree("tree");
|
|
27 JungleTree tree = jungle.getTreeByName("tree");
|
|
28 JungleTreeEditor editor = tree.getIndexTreeEditor();
|
|
29 DefaultNodePath path = new DefaultNodePath();
|
|
30 editor = editor.addNewChildAt(path, 0).b();
|
146
|
31
|
|
32
|
145
|
33 for (int num = 0; num < 5; num++) {
|
|
34 editor = editor.addNewChildAt(path.add(0), num).b().success().b();
|
146
|
35 editor = editor.putAttribute(path.add(0).add(num), "test",ByteBuffer.wrap("test".getBytes())).b().success().b();
|
145
|
36 }
|
146
|
37
|
145
|
38 TreeMap<TreeNode, TreeNode> parentIndex = tree.getParentIndex();
|
|
39 TreeNode node = tree.getRootNode();
|
|
40 for (int num = 0; node.getChildren().size() != 0; num++) {
|
|
41 Iterator<TreeNode> children = node.getChildren().iterator();
|
|
42 for (; children.hasNext();) {
|
|
43 TreeNode child = children.next();
|
|
44 TreeNode parent = parentIndex.get(child).some();
|
|
45 Assert.assertEquals(parent, node);
|
|
46 }
|
|
47 node = node.getChildren().at(num).b();
|
|
48 }
|
|
49
|
|
50 JungleTree oldTree = tree.getOldTree(tree.revision() - 1).b();
|
|
51 TreeNode oldRoot = oldTree.getRootNode();
|
|
52 TreeNode oldNode = oldRoot.getChildren().at(0).b();
|
|
53 Option<TreeNode> oldParentOp = parentIndex.get(oldNode);
|
|
54 Assert.assertTrue(oldParentOp.isNone());
|
|
55 TreeMap<TreeNode, TreeNode> oldTreeParentIndex = oldTree.getParentIndex();
|
|
56 oldParentOp = oldTreeParentIndex.get(oldNode);
|
|
57 Assert.assertTrue(oldParentOp.isSome());
|
|
58
|
|
59 }
|
|
60 }
|