Oshgnacknak/aud-2021-exam-prep
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Use a pointer where trees might get modified but a value has to be returned

Browse source
This commit is contained in:
Oshgnacknak 2021-09-04 14:36:31 +02:00
parent 39f3c2e2a2
commit 63377702ad
Signed by: Oshgnacknak
GPG key ID: 8CB7375654585956
2 changed files with 16 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
src/aud/exam/prep/Pointer.java Normal file
View file

@ -0,0 +1,10 @@
package aud.exam.prep;
public class Pointer<T> {
public T deref;
public Pointer(T initial) {
deref = initial;
}
}

10
src/aud/exam/prep/tree/OrderedTreeProcessor.java
View file

@ -1,5 +1,7 @@
package aud.exam.prep.tree;
import aud.exam.prep.Pointer;
import java.util.Comparator;
/**
@ -15,15 +17,15 @@ public interface OrderedTreeProcessor<V, T> {
boolean find(T t, V v, Comparator<V> cmp);
boolean override(T t, V from, V to, Comparator<V> cmp);
boolean override(Pointer<T> t, V from, V to, Comparator<V> cmp);
boolean overrideAll(T t, V from, V to, Comparator<V> cmp);
boolean overrideAll(Pointer<T> t, V from, V to, Comparator<V> cmp);
T insert(T t, V v, Comparator<V> cmp);
boolean remove(T t, V v, Comparator<V> cmp);
boolean remove(Pointer<T> t, V v, Comparator<V> cmp);
boolean removeAll(T t, V v, Comparator<V> cmp);
boolean removeAll(Pointer<T> t, V v, Comparator<V> cmp);
V max(T t);