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