|
45
|
1 package jp.ac.u_ryukyu.ie.cr.shoshi.jungle;
|
|
|
2
|
|
174
|
3 import fj.data.TreeMap;
|
|
45
|
4 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.persistent.ChangeListWriter;
|
|
171
|
5 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.NodePath;
|
|
179
|
6 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.TreeContext;
|
|
54
|
7 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.TreeEditor;
|
|
|
8 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.TreeNode;
|
|
45
|
9 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.transaction.DefaultJungleTreeEditor;
|
|
|
10 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.transaction.DefaultTransactionManager;
|
|
100
|
11 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.InterfaceTraverser;
|
|
142
|
12 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.DefaultEither;
|
|
|
13 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.Either;
|
|
|
14 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.Error;
|
|
|
15 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.GetOldTreeError;
|
|
149
|
16 import jp.ac.u_ryukyu.ie.cr.tatsuki.jungle.store.index.ParentIndex;
|
|
45
|
17
|
|
179
|
18 import java.util.concurrent.atomic.AtomicReference;
|
|
|
19
|
|
142
|
20 public class DefaultJungleTree implements JungleTree {
|
|
171
|
21
|
|
179
|
22 private final AtomicReference<TreeContext> repository;
|
|
142
|
23 private final String uuid;
|
|
|
24 private final ChangeListWriter writer;
|
|
145
|
25 private final TreeEditor treeEditor;
|
|
151
|
26
|
|
153
|
27 public DefaultJungleTree(TreeContext tc, String uuid, ChangeListWriter writer, TreeEditor editor) {
|
|
179
|
28 this.repository = new AtomicReference<TreeContext>(tc);
|
|
142
|
29 this.uuid = uuid;
|
|
|
30 this.writer = writer;
|
|
145
|
31 this.treeEditor = editor;
|
|
142
|
32 }
|
|
45
|
33
|
|
142
|
34 @Override
|
|
|
35 public JungleTreeEditor getTreeEditor() {
|
|
|
36 TreeContext tc = repository.get();
|
|
|
37 DefaultTransactionManager txManager = new DefaultTransactionManager(writer, tc, repository, uuid);
|
|
179
|
38 TreeNode root = tc.getRoot();
|
|
153
|
39 return new DefaultJungleTreeEditor(root, txManager, treeEditor);
|
|
142
|
40 }
|
|
|
41
|
|
|
42 @Override
|
|
|
43 public JungleTreeEditor getLocalTreeEditor() {
|
|
|
44 return getTreeEditor();
|
|
|
45 }
|
|
|
46
|
|
|
47 @Override
|
|
|
48 public TreeNode getRootNode() {
|
|
|
49 TreeContext tc = repository.get();
|
|
179
|
50 return tc.getRoot();
|
|
142
|
51 }
|
|
45
|
52
|
|
142
|
53 @Override
|
|
153
|
54 public InterfaceTraverser getTraverser(boolean useIndex) {
|
|
174
|
55 TreeMap<String, TreeMap<String, TreeMap<TreeNode, TreeNode>>> index = getIndex();
|
|
153
|
56 ParentIndex parentIndex = getParentIndex();
|
|
179
|
57 return new InterfaceTraverser(repository.get().getRoot(), index, parentIndex, useIndex);
|
|
153
|
58 }
|
|
|
59
|
|
|
60 @Override
|
|
|
61 public ParentIndex getParentIndex() {
|
|
|
62 TreeContext tc = repository.get();
|
|
179
|
63 return tc.getParentIndex();
|
|
142
|
64 }
|
|
|
65
|
|
|
66 @Override
|
|
174
|
67 public TreeMap<String, TreeMap<String, TreeMap<TreeNode, TreeNode>>> getIndex() {
|
|
142
|
68 TreeContext tc = repository.get();
|
|
179
|
69 return tc.getIndex();
|
|
142
|
70 }
|
|
|
71
|
|
|
72 @Override
|
|
|
73 public long revision() {
|
|
|
74 TreeContext tc = repository.get();
|
|
179
|
75 return tc.revision();
|
|
142
|
76 }
|
|
|
77
|
|
|
78 @Override
|
|
|
79 public Either<Error, JungleTree> getOldTree(long revision) {
|
|
|
80 TreeContext tc = repository.get();
|
|
151
|
81
|
|
179
|
82 for (; tc.revision() != revision;) {
|
|
|
83 tc = tc.prev();
|
|
|
84 if (tc == null)
|
|
142
|
85 return DefaultEither.newA(GetOldTreeError.OLD_TREE_NOT_FOUND);
|
|
|
86 }
|
|
151
|
87
|
|
|
88
|
|
142
|
89 String oldTreeUuid = uuid + revision;
|
|
179
|
90 JungleTree oldTree = new DefaultJungleTree(tc, oldTreeUuid, writer, treeEditor);
|
|
142
|
91 return DefaultEither.newB(oldTree);
|
|
|
92 }
|
|
|
93
|
|
171
|
94 @Override
|
|
|
95 public Either<Error, TreeNode> getNodeOfPath(NodePath path) {
|
|
179
|
96 TreeNode node = repository.get().getRoot();
|
|
171
|
97 for (int num : path) {
|
|
|
98 if (num == -1)
|
|
|
99 continue;
|
|
|
100 Either<Error, TreeNode> either = node.getChildren().at(num);
|
|
|
101 if (either.isA())
|
|
|
102 return either;
|
|
|
103 node = either.b();
|
|
|
104 }
|
|
|
105 return DefaultEither.newB(node);
|
|
|
106 }
|
|
153
|
107
|
|
45
|
108 }
|
