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