|
223
|
1 package jp.ac.u_ryukyu.ie.cr.jungleNetwork.operations;
|
|
|
2
|
|
|
3
|
|
263
|
4 import jp.ac.u_ryukyu.ie.cr.jungle.store.nodepath.NodePath;
|
|
223
|
5 import jp.ac.u_ryukyu.ie.cr.jungle.util.Pair;
|
|
|
6 import org.msgpack.annotation.Message;
|
|
|
7
|
|
|
8 import java.util.Iterator;
|
|
|
9 import java.util.LinkedList;
|
|
|
10
|
|
|
11 @Message
|
|
|
12 public class NetworkNodePath implements NodePath {
|
|
237
|
13 LinkedList<Integer> path;
|
|
223
|
14
|
|
237
|
15 public NetworkNodePath() {
|
|
|
16 path = new LinkedList<Integer>();
|
|
|
17 path.add(-1);
|
|
|
18 }
|
|
223
|
19
|
|
237
|
20 public NetworkNodePath(NodePath _p) {
|
|
|
21 path = new LinkedList<Integer>();
|
|
|
22 for (Integer pos : _p) {
|
|
|
23 path.add(pos);
|
|
|
24 }
|
|
223
|
25 }
|
|
237
|
26
|
|
|
27 private NetworkNodePath(LinkedList<Integer> _path) {
|
|
|
28 path = _path;
|
|
|
29 }
|
|
223
|
30
|
|
237
|
31 @Override
|
|
|
32 public Iterator<Integer> iterator() {
|
|
|
33 return path.iterator();
|
|
|
34 }
|
|
223
|
35
|
|
237
|
36 @Override
|
|
265
|
37 public int get(int index) {
|
|
|
38 return path.get(index);
|
|
|
39 }
|
|
|
40
|
|
|
41 @Override
|
|
237
|
42 public NetworkNodePath add(int _pos) {
|
|
|
43 LinkedList<Integer> newPath = copyPath();
|
|
|
44 newPath.add(_pos);
|
|
|
45 return new NetworkNodePath(newPath);
|
|
|
46 }
|
|
223
|
47
|
|
237
|
48 @Override
|
|
|
49 public NodePath addHead(int pos) {
|
|
|
50 return null; //Linked Listを後で直す
|
|
|
51 // List<Integer> newPath = path.add(0, pos);
|
|
|
52 // return new DefaultNodePath(newPath);
|
|
|
53 }
|
|
|
54
|
|
|
55 @Override
|
|
|
56 public Pair<Integer, NodePath> pop() {
|
|
|
57 LinkedList<Integer> cPath = copyPath();
|
|
|
58 int e = cPath.getFirst();
|
|
|
59 cPath.remove();
|
|
|
60 return new Pair<Integer, NodePath>(e, new NetworkNodePath(cPath));
|
|
|
61 }
|
|
223
|
62
|
|
237
|
63 @Override
|
|
|
64 public int size() {
|
|
|
65 return path.size();
|
|
223
|
66 }
|
|
|
67
|
|
237
|
68 private LinkedList<Integer> copyPath() {
|
|
|
69 LinkedList<Integer> newPath = new LinkedList<Integer>();
|
|
|
70 for (Integer i : path) {
|
|
|
71 newPath.add(i);
|
|
|
72 }
|
|
|
73 return newPath;
|
|
|
74 }
|
|
223
|
75
|
|
237
|
76 @Override
|
|
|
77 public String toString() {
|
|
|
78 return path.toString();
|
|
|
79 }
|
|
223
|
80
|
|
237
|
81 @Override
|
|
|
82 public NodePath tail() {
|
|
|
83 path.removeLast();
|
|
|
84 return new NetworkNodePath(path);
|
|
|
85 }
|
|
|
86
|
|
|
87 @Override
|
|
|
88 public Pair<Integer, NodePath> last() {
|
|
|
89 Integer num = path.removeLast();
|
|
|
90 return new Pair<Integer, NodePath>(num, new NetworkNodePath(path));
|
|
|
91 }
|
|
223
|
92
|
|
307
|
93 //以下使わない
|
|
|
94 @Override
|
|
|
95 public String getKey() {
|
|
|
96 return null;
|
|
|
97 }
|
|
|
98
|
|
|
99 @Override
|
|
|
100 public String getValue() {
|
|
|
101 return null;
|
|
|
102 }
|
|
223
|
103 }
|
