summaryrefslogtreecommitdiff
path: root/BJC-Utils2/src/main/java/bjc/utils
diff options
context:
space:
mode:
authorbjculkin <bjculkin@mix.wvu.edu>2017-03-18 14:47:57 -0400
committerbjculkin <bjculkin@mix.wvu.edu>2017-03-18 14:47:57 -0400
commit453b566b81fd3f08ac0a7edf72389ea8493bae31 (patch)
treee5b93ea2d5f8d8563f7d9ffc7f653fd0f2e81bfa /BJC-Utils2/src/main/java/bjc/utils
parent79cab78bf3d688bb8a359eedcfaf2575ef9d4092 (diff)
Use whole child, not just child head for find
Diffstat (limited to 'BJC-Utils2/src/main/java/bjc/utils')
-rw-r--r--BJC-Utils2/src/main/java/bjc/utils/data/ITree.java2
-rw-r--r--BJC-Utils2/src/main/java/bjc/utils/data/Tree.java4
2 files changed, 3 insertions, 3 deletions
diff --git a/BJC-Utils2/src/main/java/bjc/utils/data/ITree.java b/BJC-Utils2/src/main/java/bjc/utils/data/ITree.java
index 63d16d4..9132278 100644
--- a/BJC-Utils2/src/main/java/bjc/utils/data/ITree.java
+++ b/BJC-Utils2/src/main/java/bjc/utils/data/ITree.java
@@ -186,5 +186,5 @@ public interface ITree<ContainedType> {
* @return The index of the right-most child that satisfies the
* predicate, or -1 if one doesn't exist.
*/
- int revFind(Predicate<ContainedType> childPred);
+ int revFind(Predicate<ITree<ContainedType>> childPred);
}
diff --git a/BJC-Utils2/src/main/java/bjc/utils/data/Tree.java b/BJC-Utils2/src/main/java/bjc/utils/data/Tree.java
index 697dd66..86ea884 100644
--- a/BJC-Utils2/src/main/java/bjc/utils/data/Tree.java
+++ b/BJC-Utils2/src/main/java/bjc/utils/data/Tree.java
@@ -334,12 +334,12 @@ public class Tree<ContainedType> implements ITree<ContainedType> {
}
@Override
- public int revFind(Predicate<ContainedType> childPred) {
+ public int revFind(Predicate<ITree<ContainedType>> childPred) {
if(childCount == 0) {
return -1;
} else {
for(int i = childCount - 1; i >= 0; i--) {
- if(childPred.test(getChild(i).getHead())) {
+ if(childPred.test(getChild(i))) {
return i;
}
}