1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
|
package bjc.utils.funcdata.bst;
import java.util.Comparator;
import java.util.function.BiFunction;
import java.util.function.Function;
import java.util.function.Predicate;
/**
* A leaf in a tree.
*
* @author ben
*
* @param <T>
* The data stored in the tree.
*/
public class BinarySearchTreeLeaf<T> implements ITreePart<T> {
/**
* The data held in this tree leaf
*/
protected T data;
/**
* Whether this node is soft-deleted or not
*/
protected boolean isDeleted;
/**
* Create a new leaf holding the specified data.
*
* @param element
* The data for the leaf to hold.
*/
public BinarySearchTreeLeaf(T element) {
data = element;
}
/*
* Can't add things to a leaf. (non-Javadoc)
*
* @see bjc.utils.data.bst.ITreePart#add(java.lang.Object,
* java.util.Comparator)
*/
@Override
public void add(T element, Comparator<T> comparator) {
throw new IllegalArgumentException("Can't add to a leaf.");
}
/*
* Just transform our data. (non-Javadoc)
*
* @see
* bjc.utils.data.bst.ITreePart#collapse(java.util.function.Function,
* java.util.function.BiFunction)
*/
@Override
public <E> E collapse(Function<T, E> leafTransformer,
BiFunction<E, E, E> branchCollapser) {
if (leafTransformer == null) {
throw new NullPointerException("Transformer must not be null");
}
return leafTransformer.apply(data);
}
/*
* Only check our data. (non-Javadoc)
*
* @see bjc.utils.data.bst.ITreePart#contains(java.lang.Object,
* java.util.Comparator)
*/
@Override
public boolean contains(T element, Comparator<T> comparator) {
return this.data.equals(element);
}
/*
* Just get the data (non-Javadoc)
*
* @see bjc.utils.data.bst.ITreePart#data()
*/
@Override
public T data() {
return data;
}
/*
* Just mark ourselves as "not here" (non-Javadoc)
*
* @see bjc.utils.data.bst.ITreePart#delete(java.lang.Object,
* java.util.Comparator)
*/
@Override
public void delete(T element, Comparator<T> comparator) {
if (data.equals(element)) {
isDeleted = true;
}
}
/*
* Just walk our data and only succede if the walk does, because
* there's nowhere left to go. (non-Javadoc)
*
* @see bjc.utils.data.bst.ITreePart#directedWalk(bjc.utils.data.bst.
* DirectedWalkFunction)
*/
@Override
public boolean directedWalk(DirectedWalkFunction<T> treeWalker) {
if (treeWalker == null) {
throw new NullPointerException("Tree walker must not be null");
}
switch (treeWalker.walk(data)) {
case SUCCESS:
return true;
default:
return false;
}
}
/*
* Just check our data. (non-Javadoc)
*
* @see
* bjc.utils.data.bst.ITreePart#forEach(bjc.utils.data.bst.ITreePart.
* TreeLinearizationMethod, java.util.function.Predicate)
*/
@Override
public boolean forEach(TreeLinearizationMethod linearizationMethod,
Predicate<T> traversalPredicate) {
if (traversalPredicate == null) {
throw new NullPointerException("Predicate must not be null");
}
return traversalPredicate.test(data);
}
}
|
