|
8
|
1 package jp.ac.u_ryukyu.ie.cr.bbs.network.bbs;
|
|
2
|
2
|
|
|
3
|
|
|
4 import jp.ac.u_ryukyu.ie.cr.jungle.DefaultJungle;
|
|
|
5 import jp.ac.u_ryukyu.ie.cr.jungle.Jungle;
|
|
8
|
6 import jp.ac.u_ryukyu.ie.cr.jungle.store.nodepath.DefaultNodePath;
|
|
|
7 import jp.ac.u_ryukyu.ie.cr.jungle.store.nodepath.NodePath;
|
|
|
8 import jp.ac.u_ryukyu.ie.cr.jungle.transaction.editor.jungleTreeEditor.JungleTreeEditor;
|
|
|
9 import jp.ac.u_ryukyu.ie.cr.jungle.transaction.node.TreeNode;
|
|
|
10 import jp.ac.u_ryukyu.ie.cr.jungle.tree.JungleTree;
|
|
2
|
11 import jp.ac.u_ryukyu.ie.cr.jungle.util.Either;
|
|
8
|
12 import jp.ac.u_ryukyu.ie.cr.jungle.util.Error.Error;
|
|
2
|
13 import jp.ac.u_ryukyu.ie.cr.jungleNetwork.operations.NetworkTreeOperationLog;
|
|
|
14 import jp.ac.u_ryukyu.ie.cr.jungleNetwork.transaction.JungleUpdater;
|
|
|
15
|
|
|
16 import java.nio.ByteBuffer;
|
|
|
17 import java.util.concurrent.atomic.AtomicInteger;
|
|
|
18
|
|
|
19 public class BulletinBoardJungleManager {
|
|
|
20 private static BulletinBoardJungleManager instance = new BulletinBoardJungleManager();
|
|
|
21 private Jungle jungle;
|
|
|
22 private static AtomicInteger requestCounter = new AtomicInteger(0);
|
|
|
23
|
|
|
24 private BulletinBoardJungleManager() {
|
|
8
|
25 jungle = new DefaultJungle(null,"default");
|
|
2
|
26 }
|
|
|
27
|
|
|
28 public static int requestGetAndIncrement() {
|
|
|
29 return requestCounter.getAndIncrement();
|
|
|
30 }
|
|
|
31
|
|
|
32 public static int requestIncrementAndGet() {
|
|
|
33 return requestCounter.incrementAndGet();
|
|
|
34 }
|
|
|
35
|
|
|
36 public static BulletinBoardJungleManager getInstantce() {
|
|
|
37 return instance;
|
|
|
38 }
|
|
|
39
|
|
|
40 public static void setJungle(Jungle _j) {
|
|
|
41 instance.jungle = _j;
|
|
|
42 }
|
|
|
43 public static AtomicInteger getRequestCounter() {
|
|
|
44 return requestCounter;
|
|
|
45 }
|
|
|
46
|
|
|
47 public static Jungle getJungle() {
|
|
|
48 return instance.jungle;
|
|
|
49 }
|
|
|
50
|
|
|
51 public static JungleTree createNewTree(String name) {
|
|
|
52 return instance.jungle.createNewTree(name);
|
|
|
53 }
|
|
|
54
|
|
|
55 public static Either<Error, JungleTreeEditor> update(NetworkTreeOperationLog netLog) {
|
|
|
56 String treeName = netLog.getTreeName();
|
|
3
|
57 Jungle jungle = BulletinBoardJungleManager.getJungle();
|
|
2
|
58 if (jungle.getTreeByName(treeName) == null) {
|
|
|
59 if(null == jungle.createNewTree(treeName)){
|
|
|
60 throw new IllegalStateException();
|
|
|
61 }
|
|
|
62 }
|
|
|
63 Either<Error, JungleTreeEditor> either = null;
|
|
|
64 JungleTree tree = jungle.getTreeByName(treeName);
|
|
|
65
|
|
|
66 long timestamp = System.currentTimeMillis();
|
|
|
67 ByteBuffer tBuffer = ByteBuffer.allocate(16);
|
|
8
|
68 NodePath root = new DefaultNodePath();
|
|
2
|
69 tBuffer.putLong(timestamp);
|
|
|
70 do {
|
|
8
|
71 JungleTreeEditor editor = tree.getJungleTreeEditor();
|
|
9
|
72 /*
|
|
|
73 * Merge.
|
|
|
74 * posが使われていない
|
|
|
75 * calculatePositionは何をしているのだろうか？
|
|
2
|
76 */
|
|
|
77 int pos = calculatePosition(tree.getRootNode(), netLog.getTimeStamp());
|
|
|
78 either = JungleUpdater.edit(editor, netLog, pos);
|
|
|
79 if(either.isA()) {
|
|
|
80 throw new IllegalStateException();
|
|
|
81 }
|
|
|
82 editor = either.b();
|
|
|
83 either = editor.putAttribute(root, "renewtime", tBuffer);
|
|
|
84 if(either.isA()) {
|
|
|
85 throw new IllegalStateException();
|
|
|
86 }
|
|
|
87 editor = either.b();
|
|
|
88 either = editor.success();
|
|
|
89 }while(either.isA());
|
|
|
90 requestIncrementAndGet();
|
|
|
91 return either;
|
|
|
92 }
|
|
|
93
|
|
|
94 private static int calculatePosition(TreeNode node, long newNodeTimeStamp) {
|
|
|
95 int count = 0;
|
|
|
96 long childTimeStamp = 0;
|
|
|
97 for(TreeNode n : node.getChildren()) {
|
|
|
98 ByteBuffer timestamp = n.getAttributes().get("timestamp");
|
|
|
99 if(timestamp == null) {
|
|
|
100 return count;
|
|
|
101 }
|
|
|
102 childTimeStamp = timestamp.getLong(0);
|
|
|
103 if (newNodeTimeStamp < childTimeStamp) {
|
|
|
104 break;
|
|
|
105 }
|
|
|
106 count++;
|
|
|
107 }
|
|
|
108 return count;
|
|
|
109 }
|
|
|
110 }
|
