85
|
1 package alice.jungle.persistence;
|
|
2
|
|
3 import java.util.Iterator;
|
|
4 import java.util.concurrent.ConcurrentHashMap;
|
|
5
|
|
6 import fj.data.List;
|
|
7
|
|
8 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.Jungle;
|
|
9 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.JungleTree;
|
|
10 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.persistent.ChangeList;
|
|
11 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.ChangeSet;
|
|
12 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.TreeEditor;
|
|
13 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.operations.TreeOperation;
|
|
14 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.transaction.DefaultTreeContext;
|
|
15 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.transaction.DefaultTreeNode;
|
|
16
|
|
17 public class PersistentJungle implements Jungle {
|
|
18 private PersistentJournal journal;
|
|
19 private ConcurrentHashMap<String,JungleTree> trees;
|
|
20 private String uuid;
|
|
21 private TreeEditor editor;
|
|
22
|
|
23 public PersistentJungle(PersistentJournal _journal,String _uuid,TreeEditor _editor)
|
|
24 {
|
|
25 journal = _journal;
|
|
26 trees = new ConcurrentHashMap<String,JungleTree>();
|
|
27 uuid = _uuid;
|
|
28 editor = _editor;
|
|
29 }
|
|
30
|
|
31 @Override
|
|
32 public JungleTree getTreeByName(String _name)
|
|
33 {
|
|
34 return trees.get(_name);
|
|
35 }
|
|
36
|
|
37 @Override
|
|
38 public JungleTree createNewTree(String _name)
|
|
39 {
|
|
40 ChangeList list = new ChangeList(){
|
|
41 @Override
|
|
42 public Iterator<TreeOperation> iterator() {
|
|
43 List<TreeOperation> nil = List.nil();
|
|
44 return nil.iterator();
|
|
45 }
|
|
46 };
|
|
47 DefaultTreeNode root = new DefaultTreeNode();
|
|
48 ChangeSet set = new PersistentChangeSet(root.getAsNode(),null,list,uuid,0, _name);
|
|
49 DefaultTreeContext<DefaultTreeNode> tc = new DefaultTreeContext<DefaultTreeNode>(root,set);
|
|
50 JungleTree newTree = new PersistentJungleTree<DefaultTreeNode>(_name, tc,uuid, (PersistentChangeListWriter)journal.getWriter(),editor);
|
|
51 if(trees.putIfAbsent(_name,newTree) != null){
|
|
52 return null;
|
|
53 }
|
|
54 return newTree;
|
|
55 }
|
|
56
|
|
57 }
|