8000 给部分方法添加有界通配符。 · mapengfei00099/javaalgorithm@d70b5e9 · GitHub
[go: up one dir, main page]

Skip to content

Commit d70b5e9

Browse files
author
shengshijun
committed
给部分方法添加有界通配符。
1 parent d6e0d0a commit d70b5e9

File tree

2 files changed

+9
-2
lines changed

2 files changed

+9
-2
lines changed

src/main/java/ssj/algorithm/SearchTree.java

Expand all lines: src/main/java/ssj/algorithm/SearchTree.java
Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -17,6 +17,13 @@ default void addAll(Iterable<? extends T> iter) {
1717
}
1818
}
1919

20+
default void deleteAll(Iterable<? extends T> iter) {
21+
Preconditions.checkNotNull(iter);
22+
for (T ele : iter) {
23+
delete(ele);
24+
}
25+
}
26+
2027
int size();
2128

2229
Iterator<T> preIterator();

src/main/java/ssj/algorithm/collections/AVLTree.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -203,7 +203,7 @@ private int pathLength(Node node) {
203203
return result;
204204
}
205205

206-
private Node getCommonNode(Stack<?extends Node> one, Stack<? extends Node> other) {
206+
private Node getCommonNode(Stack<? extends Node> one, Stack<? extends Node> other) {
207207
Preconditions.checkNotNull(one);
208208
Preconditions.checkNotNull(other);
209209
Preconditions.checkArgument(!one.equals(other));
@@ -228,7 +228,7 @@ private Stack<Node> getNodePath(T ele) {
228228
return stack;
229229
}
230230

231-
private boolean getNodePathCore(Node start, T ele, Stack<Node> path_stack) {
231+
private boolean getNodePathCore(Node start, T ele, Stack<? super Node> path_stack) {
232232
Preconditions.checkNotNull(ele);
233233
Preconditions.checkNotNull(path_stack);
234234
if (start == null) {

0 commit comments

Comments
 (0)
0