|
128
|
1 package jp.ac.u_ryukyu.ie.cr.tatsuki.jungle.store.index;
|
|
|
2
|
|
134
|
3 import fj.Ord;
|
|
129
|
4 import fj.data.List;
|
|
146
|
5 import fj.data.Option;
|
|
129
|
6 import fj.data.TreeMap;
|
|
|
7 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.NodePath;
|
|
134
|
8 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.DefaultNodePath;
|
|
129
|
9 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.TreeNode;
|
|
146
|
10 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.TreeNodeAttributes;
|
|
129
|
11 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.Pair;
|
|
146
|
12 import jp.ac.u_ryukyu.ie.cr.tatsuki.jungle.query.PathNodeIterator;
|
|
128
|
13
|
|
|
14 public class DeleteChildIndexEditor implements IndexEditor {
|
|
|
15
|
|
151
|
16 Index index;
|
|
146
|
17 int pos;
|
|
134
|
18
|
|
151
|
19 public DeleteChildIndexEditor(int pos, Index index) {
|
|
|
20 this.index = index;
|
|
146
|
21 this.pos = pos;
|
|
|
22 }
|
|
134
|
23
|
|
146
|
24 @Override
|
|
|
25 public IndexEditor delete(TreeNode node) {
|
|
|
26 TreeNodeAttributes attribute = node.getAttributes();
|
|
|
27 List<String> keys = attribute.getKeys();
|
|
151
|
28 TreeMap<String, TreeMap<String, List<TreeNode>>> newIndexTreeMap = index;
|
|
146
|
29 for (String key : keys) {
|
|
151
|
30 Option<TreeMap<String, List<TreeNode>>> indexOp = index.get(key);
|
|
146
|
31 if (indexOp.isSome()) {
|
|
|
32 TreeMap<String, List<TreeNode>> index = indexOp.some();
|
|
|
33 String value = attribute.getString(key);
|
|
|
34 Option<List<TreeNode>> nodeListOp = index.get(value);
|
|
|
35 if (nodeListOp.isSome()) {
|
|
|
36 List<TreeNode> nodeList = nodeListOp.some();
|
|
|
37 List<TreeNode> newNodeList = List.nil();
|
|
|
38 for (TreeNode indexingNode : nodeList) {
|
|
|
39 if (indexingNode != node)
|
|
|
40 newNodeList = newNodeList.cons(indexingNode);
|
|
|
41 }
|
|
|
42 TreeMap<String, List<TreeNode>> newIndex;
|
|
|
43 newIndex = index.set(value, newNodeList);
|
|
|
44 newIndexTreeMap = newIndexTreeMap.set(key, newIndex);
|
|
|
45 }
|
|
134
|
46
|
|
146
|
47 }
|
|
|
48 }
|
|
128
|
49
|
|
146
|
50 return new DefaultIndexEditor(newIndexTreeMap);
|
|
|
51 }
|
|
134
|
52
|
|
146
|
53 @Override
|
|
|
54 public IndexEditor add(TreeNode node) {
|
|
|
55 TreeNodeAttributes attribute = node.getAttributes();
|
|
|
56 List<String> keys = attribute.getKeys();
|
|
151
|
57 TreeMap<String, TreeMap<String, List<TreeNode>>> newIndexTreeMap = index;
|
|
146
|
58 for (String key : keys) {
|
|
151
|
59 Option<TreeMap<String, List<TreeNode>>> indexOp = index.get(key);
|
|
146
|
60 if (indexOp.isSome()) {
|
|
|
61 TreeMap<String, List<TreeNode>> index = indexOp.some();
|
|
|
62 String value = attribute.getString(key);
|
|
|
63 Option<List<TreeNode>> nodeListOp = index.get(value);
|
|
|
64 if (nodeListOp.isSome()) {
|
|
|
65 List<TreeNode> nodeList = nodeListOp.some();
|
|
|
66 List<TreeNode> newNodeList = nodeList.cons(node);
|
|
|
67 TreeMap<String, List<TreeNode>> newIndex = index.set(value, newNodeList);
|
|
|
68 newIndexTreeMap = newIndexTreeMap.set(key, newIndex);
|
|
|
69 } else { // test
|
|
|
70 List<TreeNode> nodeList = List.nil();
|
|
|
71 value = attribute.getString(key);
|
|
|
72 List<TreeNode> newNodeList = nodeList.cons(node);
|
|
|
73 TreeMap<String, List<TreeNode>> newIndex = index.set(value, newNodeList);
|
|
|
74 newIndexTreeMap = newIndexTreeMap.set(key, newIndex);
|
|
|
75 }
|
|
134
|
76
|
|
146
|
77 } else { // test
|
|
|
78 TreeMap<String, List<TreeNode>> index = TreeMap.empty(Ord.stringOrd);
|
|
|
79 List<TreeNode> nodeList = List.nil();
|
|
|
80 String value = attribute.getString(key);
|
|
|
81 List<TreeNode> newNodeList = nodeList.cons(node);
|
|
|
82 TreeMap<String, List<TreeNode>> newIndex = index.set(value, newNodeList);
|
|
|
83 newIndexTreeMap = newIndexTreeMap.set(key, newIndex);
|
|
|
84 }
|
|
|
85 }
|
|
134
|
86
|
|
146
|
87 return new DefaultIndexEditor(newIndexTreeMap);
|
|
|
88 }
|
|
134
|
89
|
|
146
|
90 @Override
|
|
|
91 public TreeMap<String, TreeMap<String, List<TreeNode>>> getIndex() {
|
|
151
|
92 return index;
|
|
146
|
93 }
|
|
|
94
|
|
|
95 @Override
|
|
|
96 public IndexEditor edit(TreeNode node) {
|
|
|
97 PathNodeIterator nodeSearcher = new PathNodeIterator(new Pair<TreeNode, NodePath>(node, new DefaultNodePath()));
|
|
151
|
98 TreeMap<String, TreeMap<String, List<TreeNode>>> newIndexTreeMap = index;
|
|
134
|
99
|
|
146
|
100 for (; nodeSearcher.hasNext();) {
|
|
|
101 TreeNode deleteNode = nodeSearcher.next().left();
|
|
|
102 TreeNodeAttributes attribute = deleteNode.getAttributes();
|
|
|
103 List<String> keys = attribute.getKeys();
|
|
|
104 for (String key : keys) {
|
|
|
105 Option<TreeMap<String, List<TreeNode>>> indexOp = newIndexTreeMap.get(key);
|
|
|
106 if (indexOp.isSome()) {
|
|
|
107 TreeMap<String, List<TreeNode>> index = indexOp.some();
|
|
|
108 String value = attribute.getString(key);
|
|
|
109 Option<List<TreeNode>> nodeListOp = index.get(value);
|
|
|
110 if (nodeListOp.isSome()) {
|
|
|
111 List<TreeNode> nodeList = nodeListOp.some();
|
|
|
112 List<TreeNode> newNodeList = List.nil();
|
|
|
113 for (TreeNode indexingNode : nodeList) {
|
|
|
114 if (indexingNode != deleteNode)
|
|
|
115 newNodeList = newNodeList.cons(indexingNode);
|
|
|
116 }
|
|
|
117 TreeMap<String, List<TreeNode>> newIndex = index.set(value, newNodeList);
|
|
|
118 newIndexTreeMap = newIndexTreeMap.set(key, newIndex);
|
|
|
119 }
|
|
134
|
120
|
|
146
|
121 }
|
|
|
122 }
|
|
|
123 }
|
|
|
124 return null;
|
|
|
125 }
|
|
129
|
126
|
|
128
|
127 }
|
