summaryrefslogtreecommitdiff
path: root/BJC-Utils2
diff options
context:
space:
mode:
authorbculkin2442 <bjculkin@mix.wvu.edu>2015-09-29 16:24:37 -0400
committerbculkin2442 <bjculkin@mix.wvu.edu>2015-09-29 16:24:37 -0400
commitba7711b8546e08fa6376a85271d2ca1c34cc902b (patch)
treea04b8283c828eb49c978955ccef7c4cab3fe9754 /BJC-Utils2
parentb964a4b44cd2c24083db8e1cccfd6de22e440861 (diff)
Moved around tree stuff.
Diffstat (limited to 'BJC-Utils2')
-rw-r--r--BJC-Utils2/src/examples/java/bjc/utils/examples/BinarySearcher.java4
-rw-r--r--BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/BinarySearchTree.java (renamed from BJC-Utils2/src/main/java/bjc/utils/data/bst/BinarySearchTree.java)4
-rw-r--r--BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/DirectedWalkFunction.java (renamed from BJC-Utils2/src/main/java/bjc/utils/data/bst/DirectedWalkFunction.java)2
-rw-r--r--BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/ITreePart.java (renamed from BJC-Utils2/src/main/java/bjc/utils/data/bst/ITreePart.java)2
-rw-r--r--BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/TreeLeaf.java (renamed from BJC-Utils2/src/main/java/bjc/utils/data/bst/TreeLeaf.java)2
-rw-r--r--BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/TreeNode.java (renamed from BJC-Utils2/src/main/java/bjc/utils/data/bst/TreeNode.java)4
6 files changed, 9 insertions, 9 deletions
diff --git a/BJC-Utils2/src/examples/java/bjc/utils/examples/BinarySearcher.java b/BJC-Utils2/src/examples/java/bjc/utils/examples/BinarySearcher.java
index 8e2ca51..bfaae82 100644
--- a/BJC-Utils2/src/examples/java/bjc/utils/examples/BinarySearcher.java
+++ b/BJC-Utils2/src/examples/java/bjc/utils/examples/BinarySearcher.java
@@ -2,8 +2,8 @@ package bjc.utils.examples;
import java.util.Scanner;
-import bjc.utils.data.bst.BinarySearchTree;
-import bjc.utils.data.bst.ITreePart.TreeLinearizationMethod;
+import bjc.utils.funcdata.bst.BinarySearchTree;
+import bjc.utils.funcdata.bst.ITreePart.TreeLinearizationMethod;
/**
* Example showing how to use the binary search tree.
diff --git a/BJC-Utils2/src/main/java/bjc/utils/data/bst/BinarySearchTree.java b/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/BinarySearchTree.java
index 509cfcd..d028293 100644
--- a/BJC-Utils2/src/main/java/bjc/utils/data/bst/BinarySearchTree.java
+++ b/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/BinarySearchTree.java
@@ -1,11 +1,11 @@
-package bjc.utils.data.bst;
+package bjc.utils.funcdata.bst;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.function.Predicate;
-import bjc.utils.data.bst.ITreePart.TreeLinearizationMethod;
+import bjc.utils.funcdata.bst.ITreePart.TreeLinearizationMethod;
/**
* A binary search tree, with some mild support for functional traversal.
diff --git a/BJC-Utils2/src/main/java/bjc/utils/data/bst/DirectedWalkFunction.java b/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/DirectedWalkFunction.java
index 232f3d4..18e80be 100644
--- a/BJC-Utils2/src/main/java/bjc/utils/data/bst/DirectedWalkFunction.java
+++ b/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/DirectedWalkFunction.java
@@ -1,4 +1,4 @@
-package bjc.utils.data.bst;
+package bjc.utils.funcdata.bst;
/**
* Represents a function for doing a directed walk of a binary tree.
diff --git a/BJC-Utils2/src/main/java/bjc/utils/data/bst/ITreePart.java b/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/ITreePart.java
index 5667ce1..0c8f12e 100644
--- a/BJC-Utils2/src/main/java/bjc/utils/data/bst/ITreePart.java
+++ b/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/ITreePart.java
@@ -1,4 +1,4 @@
-package bjc.utils.data.bst;
+package bjc.utils.funcdata.bst;
import java.util.Comparator;
import java.util.function.BiFunction;
diff --git a/BJC-Utils2/src/main/java/bjc/utils/data/bst/TreeLeaf.java b/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/TreeLeaf.java
index 173afc1..1928185 100644
--- a/BJC-Utils2/src/main/java/bjc/utils/data/bst/TreeLeaf.java
+++ b/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/TreeLeaf.java
@@ -1,4 +1,4 @@
-package bjc.utils.data.bst;
+package bjc.utils.funcdata.bst;
import java.util.Comparator;
import java.util.function.BiFunction;
diff --git a/BJC-Utils2/src/main/java/bjc/utils/data/bst/TreeNode.java b/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/TreeNode.java
index 660fd03..65eb546 100644
--- a/BJC-Utils2/src/main/java/bjc/utils/data/bst/TreeNode.java
+++ b/BJC-Utils2/src/main/java/bjc/utils/funcdata/bst/TreeNode.java
@@ -1,6 +1,6 @@
-package bjc.utils.data.bst;
+package bjc.utils.funcdata.bst;
-import static bjc.utils.data.bst.DirectedWalkFunction.DirectedWalkResult.*;
+import static bjc.utils.funcdata.bst.DirectedWalkFunction.DirectedWalkResult.*;
import java.util.Comparator;
import java.util.function.BiFunction;