|
128
|
1 package jp.ac.u_ryukyu.ie.cr.tatsuki.jungle.store.index;
|
|
|
2
|
|
147
|
3 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.TreeNode;
|
|
|
4 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.TreeNodeAttributes;
|
|
|
5 import fj.Ord;
|
|
129
|
6 import fj.data.List;
|
|
147
|
7 import fj.data.Option;
|
|
129
|
8 import fj.data.TreeMap;
|
|
128
|
9
|
|
|
10 public class DefaultIndexEditor implements IndexEditor {
|
|
|
11
|
|
147
|
12 TreeMap<String, TreeMap<String, List<TreeNode>>> indexTreeMap;
|
|
|
13
|
|
|
14 public DefaultIndexEditor(TreeMap<String, TreeMap<String, List<TreeNode>>> indexTreeMap) {
|
|
|
15 this.indexTreeMap = indexTreeMap;
|
|
|
16 }
|
|
|
17
|
|
|
18 @Override
|
|
|
19 public IndexEditor delete(TreeNode node) {
|
|
|
20 TreeNodeAttributes attribute = node.getAttributes();
|
|
|
21 List<String> keys = attribute.getKeys();
|
|
|
22 TreeMap<String, TreeMap<String, List<TreeNode>>> newIndexTreeMap = indexTreeMap;
|
|
|
23 for (String key : keys) {
|
|
|
24 Option<TreeMap<String, List<TreeNode>>> indexOp = indexTreeMap.get(key);
|
|
|
25 if (indexOp.isSome()) {
|
|
|
26 TreeMap<String, List<TreeNode>> index = indexOp.some();
|
|
|
27 String value = attribute.getString(key);
|
|
|
28 Option<List<TreeNode>> nodeListOp = index.get(value);
|
|
|
29 if (nodeListOp.isSome()) {
|
|
|
30 List<TreeNode> nodeList = nodeListOp.some();
|
|
|
31 List<TreeNode> newNodeList = List.nil();
|
|
|
32 for (TreeNode indexingNode : nodeList) {
|
|
|
33 if (indexingNode != node)
|
|
|
34 newNodeList = newNodeList.cons(indexingNode);
|
|
|
35 }
|
|
|
36 TreeMap<String, List<TreeNode>> newIndex;
|
|
|
37 // if (newNodeList.isEmpty())
|
|
|
38 // newIndex = index.delete(value);
|
|
|
39 // else
|
|
|
40 newIndex = index.set(value, newNodeList);
|
|
|
41 newIndexTreeMap = newIndexTreeMap.set(key, newIndex);
|
|
|
42 }
|
|
|
43
|
|
|
44 }
|
|
|
45 }
|
|
|
46
|
|
|
47 return new DefaultIndexEditor(newIndexTreeMap);
|
|
|
48 }
|
|
128
|
49
|
|
147
|
50 @Override
|
|
|
51 public IndexEditor add(TreeNode node) {
|
|
|
52 TreeNodeAttributes attribute = node.getAttributes();
|
|
|
53 List<String> keys = attribute.getKeys();
|
|
|
54 TreeMap<String, TreeMap<String, List<TreeNode>>> newIndexTreeMap = indexTreeMap;
|
|
|
55 for (String key : keys) {
|
|
|
56 Option<TreeMap<String, List<TreeNode>>> indexOp = indexTreeMap.get(key);
|
|
|
57 if (indexOp.isSome()) {
|
|
|
58 TreeMap<String, List<TreeNode>> index = indexOp.some();
|
|
|
59 String value = attribute.getString(key);
|
|
|
60 Option<List<TreeNode>> nodeListOp = index.get(value);
|
|
|
61 if (nodeListOp.isSome()) {
|
|
|
62 List<TreeNode> nodeList = nodeListOp.some();
|
|
|
63 List<TreeNode> newNodeList = nodeList.cons(node);
|
|
|
64 TreeMap<String, List<TreeNode>> newIndex = index.set(value, newNodeList);
|
|
|
65 newIndexTreeMap = newIndexTreeMap.set(key, newIndex);
|
|
|
66 } else { // test
|
|
|
67 List<TreeNode> nodeList = List.nil();
|
|
|
68 value = attribute.getString(key);
|
|
|
69 List<TreeNode> newNodeList = nodeList.cons(node);
|
|
|
70 TreeMap<String, List<TreeNode>> newIndex = index.set(value, newNodeList);
|
|
|
71 newIndexTreeMap = newIndexTreeMap.set(key, newIndex);
|
|
|
72 }
|
|
129
|
73
|
|
147
|
74 } else { // test
|
|
|
75 TreeMap<String, List<TreeNode>> index = TreeMap.empty(Ord.stringOrd);
|
|
|
76 List<TreeNode> nodeList = List.nil();
|
|
|
77 String value = attribute.getString(key);
|
|
|
78 List<TreeNode> newNodeList = nodeList.cons(node);
|
|
|
79 TreeMap<String, List<TreeNode>> newIndex = index.set(value, newNodeList);
|
|
|
80 newIndexTreeMap = newIndexTreeMap.set(key, newIndex);
|
|
|
81 }
|
|
|
82 }
|
|
|
83
|
|
|
84 return new DefaultIndexEditor(newIndexTreeMap);
|
|
|
85 }
|
|
|
86
|
|
|
87 @Override
|
|
|
88 public TreeMap<String, TreeMap<String, List<TreeNode>>> getIndex() {
|
|
|
89 return indexTreeMap;
|
|
|
90 }
|
|
|
91
|
|
|
92 @Override
|
|
|
93 public IndexEditor edit(TreeNode node) {
|
|
|
94 return this;
|
|
|
95 }
|
|
129
|
96
|
|
128
|
97 }
|
