Mercurial > hg > Members > shoshi > jungle > jungle-core

comparison src/main/java/jp/ac/u_ryukyu/ie/cr/jungle/store/impl/DefaultNodePath.java @ 213:7da9056e9357

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
delete List worning
author tatsuki
date Tue, 04 Aug 2015 23:07:43 +0900
parents 74648c746dd4
children 33c93f162389
comparison
equal deleted inserted replaced
212:bdfd1e7c8bb7 213:7da9056e9357
37 37
38 @Override 38 @Override
39 public Pair<Integer, NodePath> pop() { 39 public Pair<Integer, NodePath> pop() {
40 Integer head = path.head(); 40 Integer head = path.head();
41 List<Integer> tail = path.deleteHead(); 41 List<Integer> tail = path.deleteHead();
42 return new Pair<Integer, NodePath>(head, new DefaultNodePath(tail)); 42 return new Pair<>(head, new DefaultNodePath(tail));
43 } 43 }
44 44
45 @Override 45 @Override
46 public Pair<Integer, NodePath> last() { 46 public Pair<Integer, NodePath> last() {
47 Integer last = path.head(); 47 Integer last = path.head();
48 List<Integer> list = path.deleteHead(); 48 List<Integer> list = path.deleteHead();
49 return new Pair<Integer, NodePath>(last, new DefaultNodePath(list)); 49 return new Pair<>(last, new DefaultNodePath(list));
50 } 50 }
51 51
52 @Override 52 @Override
53 public String toString() { 53 public String toString() {
54 return path.toString(); 54 return path.toString();
67 List<Integer> tail = path.deleteLast(); 67 List<Integer> tail = path.deleteLast();
68 return new DefaultNodePath(tail); 68 return new DefaultNodePath(tail);
69 } 69 }
70 70
71 public List<DefaultNodePath> inits() { 71 public List<DefaultNodePath> inits() {
72 List<DefaultNodePath> paths = new List(); 72 List<DefaultNodePath> paths = new List<>();
73 List<Integer> coursePath = new List(); 73 List<Integer> coursePath = new List<>();
74 Iterator<Integer> iterator = path.iterator(); 74 for (Integer tmpPath : path) {
75 while (iterator.hasNext()) { 75 List<Integer> tmp = coursePath.addLast(tmpPath);
76 List<Integer> tmp = coursePath.addLast(iterator.next());
77 paths = paths.addLast(new DefaultNodePath(tmp)); 76 paths = paths.addLast(new DefaultNodePath(tmp));
78 coursePath = tmp; 77 coursePath = tmp;
79 } 78 }
80 return paths; 79 return paths;
81 } 80 }