Oshgnacknak/AuD-2021-Exam-Prep
Archived
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Split up IterativeFullyUsedArrayProcessor and RecursiveFullyUsedArrayProcessor

Browse Source
This commit is contained in:
Oshgnacknak
2021-08-30 17:06:50 +02:00
parent f9c0ee2050
commit ab87b2e964
8 changed files with 756 additions and 556 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
src/aud/exam/prep/array/ArrayIterator.java Normal file
View File

@ -0,0 +1,26 @@
package aud.exam.prep.array;
import java.util.Iterator;
public class ArrayIterator<T> implements Iterator<T> {
private final T[] array;
private int index;
private final int end;
public ArrayIterator(T[] array, int begin, int end) {
this.array = array;
this.index = begin;
this.end = end;
}
@Override
public boolean hasNext() {
return index < end;
}
@Override
public T next() {
return array[index++];
}
}

549
src/aud/exam/prep/array/FullyUsedArrayProcessor.java
View File

@ -1,73 +1,8 @@
package aud.exam.prep.array; package aud.exam.prep.array;
import aud.exam.prep.Pair;
import aud.exam.prep.SequenceProcessor; import aud.exam.prep.SequenceProcessor;
import java.util.Comparator; abstract class FullyUsedArrayProcessor<T> implements SequenceProcessor<T, FullyUsedArray<T>> {
import java.util.Iterator;
import java.util.Objects;
@SuppressWarnings("ManualArrayCopy")
public class FullyUsedArrayProcessor<T> implements SequenceProcessor<T, FullyUsedArray<T>> {
@Override
public boolean find(FullyUsedArray<T> array, T t) {
for (int i = 0; i < array.theArray.length; i++) {
if (Objects.equals(array.theArray[i], t)) {
return true;
}
}
return false;
}
@Override
public boolean findBinary(FullyUsedArray<T> array, T t, Comparator<T> cmp) {
if (array.theArray.length == 0) {
return false;
}
var low = 0;
var high = array.theArray.length-1;
while (low <= high) {
var index = (low + high) / 2;
var c = cmp.compare(t, array.theArray[index]);
if (c == 0) {
return true;
} else if (c < 0) {
high = index-1;
} else {
low = index+1;
}
}
return false;
}
@Override
public boolean override(FullyUsedArray<T> array, T from, T to) {
for (int i = 0; i < array.theArray.length; i++) {
if (Objects.equals(array.theArray[i], from)) {
array.theArray[i] = to;
return true;
}
}
return false;
}
@Override
public boolean overrideAll(FullyUsedArray<T> array, T from, T to) {
var modified = false;
for (int i = 0; i < array.theArray.length; i++) {
if (Objects.equals(array.theArray[i], from)) {
array.theArray[i] = to;
modified = true;
}
}
return modified;
}
@Override @Override
public boolean overrideAt(FullyUsedArray<T> array, T to, int index) { public boolean overrideAt(FullyUsedArray<T> array, T to, int index) {
@ -79,490 +14,14 @@ public class FullyUsedArrayProcessor<T> implements SequenceProcessor<T, FullyUse
return true; return true;
} }
@Override
public void insertInOrder(FullyUsedArray<T> array, T t, Comparator<T> cmp) {
T[] newArray = Arrays.newArray(array.theArray.length+1);
var index = 0;
while (index < array.theArray.length && cmp.compare(array.theArray[index], t) < 0) {
newArray[index] = array.theArray[index];
index++;
}
newArray[index] = t;
while (index < array.theArray.length) {
newArray[index+1] = array.theArray[index];
index++;
}
array.theArray = newArray;
}
@Override
public boolean remove(FullyUsedArray<T> array, T t) {
if (!find(array, t)) {
return false;
}
T[] newArray = Arrays.newArray(array.theArray.length-1);
var index = 0;
while (!Objects.equals(array.theArray[index], t)) {
newArray[index] = array.theArray[index];
index++;
}
index++;
while (index < array.theArray.length) {
newArray[index-1] = array.theArray[index];
index++;
}
array.theArray = newArray;
return true;
}
@Override
public boolean removeAll(FullyUsedArray<T> array, T t) {
int size = 0;
for (int i = 0; i < array.theArray.length; i++) {
if (!Objects.equals(array.theArray[i], t)) {
size++;
}
}
if (size == array.theArray.length) {
return false;
}
T[] newArray = Arrays.newArray(size);
int index = 0;
for (int i = 0; i < array.theArray.length; i++) {
if (!Objects.equals(array.theArray[i], t)) {
newArray[index++] = array.theArray[i];
}
}
array.theArray = newArray;
return true;
}
@Override
public boolean isAscending(FullyUsedArray<T> array, Comparator<T> cmp) {
for (int i = 0; i < array.theArray.length-1; i++) {
if (cmp.compare(array.theArray[i], array.theArray[i+1]) > 0) {
return false;
}
}
return true;
}
@Override
public T max(FullyUsedArray<T> array, Comparator<T> cmp) {
if (array.theArray.length == 0) {
throw new IllegalArgumentException("The sequence may not be empty");
}
var max = array.theArray[0];
for (int i = 1; i < array.theArray.length; i++) {
if (cmp.compare(max, array.theArray[i]) < 0) {
max = array.theArray[i];
}
}
return max;
}
@Override
public T secondMax(FullyUsedArray<T> array, Comparator<T> cmp) {
if (array.theArray.length < 2) {
throw new IllegalArgumentException("The sequence must contains at least 2 elements");
}
T secondMax, max;
if (cmp.compare(array.theArray[0], array.theArray[1]) < 0) {
secondMax = array.theArray[0];
max = array.theArray[1];
} else {
secondMax = array.theArray[1];
max = array.theArray[0];
}
for (int i = 2; i < array.theArray.length; i++) {
if (cmp.compare(max, array.theArray[i]) < 0) {
secondMax = max;
max = array.theArray[i];
} else if (cmp.compare(secondMax, array.theArray[i]) < 0) {
secondMax = array.theArray[i];
}
}
return secondMax;
}
@Override
public boolean isItemWiseLessOrEqual(FullyUsedArray<T> a, FullyUsedArray<T> b, Comparator<T> cmp) {
if (b.theArray.length < a.theArray.length) {
return false;
}
for (int i = 0; i < a.theArray.length; i++) {
if (cmp.compare(a.theArray[i], b.theArray[i]) > 0) {
return false;
}
}
return true;
}
@Override
public boolean isItemWiseLess(FullyUsedArray<T> a, FullyUsedArray<T> b, Comparator<T> cmp) {
if (b.theArray.length < a.theArray.length) {
return false;
}
var actualLessElement = false;
for (int i = 0; i < a.theArray.length; i++) {
var c = cmp.compare(a.theArray[i], b.theArray[i]);
if (c > 0) {
return false;
} else if (c < 0) {
actualLessElement = true;
}
}
return a.theArray.length < b.theArray.length || actualLessElement;
}
@Override
public boolean isLexSmaller(FullyUsedArray<T> a, FullyUsedArray<T> b, Comparator<T> cmp) {
var end = Integer.min(a.theArray.length, b.theArray.length);
for (int i = 0; i < end; i++) {
var c = cmp.compare(a.theArray[i], b.theArray[i]);
if (c < 0) {
return true;
}
if (c > 0) {
return false;
}
}
return a.theArray.length < b.theArray.length;
}
@Override
public void exchangePairs(FullyUsedArray<T> array) {
for (int i = 1; i < array.theArray.length-1; i += 2) {
T t = array.theArray[i];
array.theArray[i] = array.theArray[i+1];
array.theArray[i+1] = t;
}
}
@Override
public void rotateTriples(FullyUsedArray<T> array) {
for (int i = 1; i < array.theArray.length-2; i += 3) {
T t = array.theArray[i+2];
array.theArray[i+2] = array.theArray[i+1];
array.theArray[i+1] = array.theArray[i];
array.theArray[i] = t;
}
}
@Override
public void removeEverySecond(FullyUsedArray<T> array) {
T[] newArray = Arrays.newArray(array.theArray.length - array.theArray.length / 2);
for (int i = 0; i < newArray.length; i++) {
newArray[i] = array.theArray[2*i];
}
array.theArray = newArray;
}
@Override
public void doubleAllKeys(FullyUsedArray<T> array) {
T[] newArray = Arrays.newArray(array.theArray.length*2);
for (int i = 0; i < array.theArray.length; i++) {
newArray[2*i] = newArray[2*i + 1] = array.theArray[i];
}
array.theArray = newArray;
}
@Override
public FullyUsedArray<T> rotateRight(FullyUsedArray<T> array) {
if (array.theArray.length < 2) {
return array;
}
var right = array.theArray[array.theArray.length-1];
for (int i = array.theArray.length-2; i >= 0; i--) {
array.theArray[i+1] = array.theArray[i];
}
array.theArray[0] = right;
return array;
}
@Override
public FullyUsedArray<T> rotateLeft(FullyUsedArray<T> array) {
if (array.theArray.length < 2) {
return array;
}
var left = array.theArray[0];
for (int i = 0; i < array.theArray.length-1; i++) {
array.theArray[i] = array.theArray[i+1];
}
array.theArray[array.theArray.length-1] = left;
return array;
}
@Override
public void removeDuplicates(FullyUsedArray<T> array) {
if (array.theArray.length < 2) {
return;
}
var distinctRuns = 1;
for (int i = 0; i < array.theArray.length-1; i++) {
if (array.theArray[i] != array.theArray[i+1]) {
distinctRuns++;
}
}
if (distinctRuns == array.theArray.length) {
return;
}
T[] newArray = Arrays.newArray(distinctRuns);
var index = 0;
for (int i = 0; i < array.theArray.length; i++) {
if (index == 0 || !Objects.equals(newArray[index-1], array.theArray[i])) {
newArray[index++] = array.theArray[i];
}
}
array.theArray = newArray;
}
@Override
public FullyUsedArray<T> invert(FullyUsedArray<T> array) {
for (int i = 0; i < array.theArray.length/2; i++) {
T t = array.theArray[i];
array.theArray[i] = array.theArray[array.theArray.length-i-1];
array.theArray[array.theArray.length-i-1] = t;
}
return array;
}
@Override
public FullyUsedArray<T> clone(FullyUsedArray<T> array) {
var newArray = new FullyUsedArray<T>();
newArray.theArray = Arrays.newArray(array.theArray.length);
for (int i = 0; i < array.theArray.length; i++) {
newArray.theArray[i] = array.theArray[i];
}
return newArray;
}
@Override
public FullyUsedArray<T> alternate(FullyUsedArray<T> a, FullyUsedArray<T> b) {
var newArray = new FullyUsedArray<T>();
newArray.theArray = Arrays.newArray(a.theArray.length + b.theArray.length);
var index = 0;
var indexA = 0;
var indexB = 0;
while (indexA < a.theArray.length || indexB < b.theArray.length) {
if (indexA < a.theArray.length) {
newArray.theArray[index++] = a.theArray[indexA++];
}
if (indexB < b.theArray.length) {
newArray.theArray[index++] = b.theArray[indexB++];
}
}
return newArray;
}
@Override
public FullyUsedArray<T> merge(FullyUsedArray<T> a, FullyUsedArray<T> b, Comparator<T> cmp) {
var newArray = new FullyUsedArray<T>();
newArray.theArray = Arrays.newArray(a.theArray.length + b.theArray.length);
var index = 0;
var indexA = 0;
var indexB = 0;
while (indexA < a.theArray.length && indexB < b.theArray.length) {
if (cmp.compare(a.theArray[indexA], b.theArray[indexB]) < 0) {
newArray.theArray[index++] = a.theArray[indexA++];
} else {
newArray.theArray[index++] = b.theArray[indexB++];
}
}
while (indexA < a.theArray.length) {
newArray.theArray[index++] = a.theArray[indexA++];
}
while (indexB < b.theArray.length) {
newArray.theArray[index++] = b.theArray[indexB++];
}
return newArray;
}
@Override
public Pair<FullyUsedArray<T>, FullyUsedArray<T>> divideAlternating(FullyUsedArray<T> array) {
var p = new Pair<FullyUsedArray<T>, FullyUsedArray<T>>();
p.fst = new FullyUsedArray<>();
p.snd = new FullyUsedArray<>();
p.snd.theArray = Arrays.newArray(array.theArray.length / 2);
p.fst.theArray = Arrays.newArray(array.theArray.length - p.snd.theArray.length);
for (int i = 0; i < array.theArray.length; i++) {
if (i % 2 == 0) {
p.fst.theArray[i/2] = array.theArray[i];
} else {
p.snd.theArray[i/2] = array.theArray[i];
}
}
return p;
}
@Override
public Pair<FullyUsedArray<T>, FullyUsedArray<T>> divideAlternatingByRuns(FullyUsedArray<T> array, Comparator<T> cmp) {
var p = new Pair<FullyUsedArray<T>, FullyUsedArray<T>>();
p.fst = new FullyUsedArray<>();
p.snd = new FullyUsedArray<>();
var runInFst = true;
var elementsInFst = 0;
for (int i = 0; i < array.theArray.length; i++) {
if (runInFst) {
elementsInFst++;
}
if (i < array.theArray.length-1 && cmp.compare(array.theArray[i], array.theArray[i + 1]) > 0) {
runInFst = !runInFst;
}
}
p.fst.theArray = Arrays.newArray(elementsInFst);
p.snd.theArray = Arrays.newArray(array.theArray.length - elementsInFst);
runInFst = true;
var indexA = 0;
var indexB = 0;
for (int i = 0; i < array.theArray.length; i++) {
if (runInFst) {
p.fst.theArray[indexA++] = array.theArray[i];
} else {
p.snd.theArray[indexB++] = array.theArray[i];
}
if (i < array.theArray.length-1 && cmp.compare(array.theArray[i], array.theArray[i + 1]) > 0) {
runInFst = !runInFst;
}
}
return p;
}
@Override
public Pair<FullyUsedArray<T>, FullyUsedArray<T>> divideByPivot(FullyUsedArray<T> array, T pivot, Comparator<T> cmp) {
var p = new Pair<FullyUsedArray<T>, FullyUsedArray<T>>();
p.fst = new FullyUsedArray<>();
p.snd = new FullyUsedArray<>();
var less = 0;
var greater = 0;
for (int i = 0; i < array.theArray.length; i++) {
var c = cmp.compare(array.theArray[i], pivot);
if (c < 0) {
less++;
}
if (c > 0) {
greater++;
}
}
p.fst.theArray = Arrays.newArray(less);
p.snd.theArray = Arrays.newArray(greater);
var indexA = 0;
var indexB = 0;
for (int i = 0; i < array.theArray.length; i++) {
var c = cmp.compare(array.theArray[i], pivot);
if (c < 0) {
p.fst.theArray[indexA++] = array.theArray[i];
}
if (c > 0) {
p.snd.theArray[indexB++] = array.theArray[i];
}
}
return p;
}
@Override @Override
public boolean check(FullyUsedArray<T> array) { public boolean check(FullyUsedArray<T> array) {
return true; return true;
} }
@Override
public FullyUsedArray<T> create(Iterable<T> iterable) {
var array = new FullyUsedArray<T>();
var size = 0;
for (T ignored : iterable) {
size++;
}
array.theArray = Arrays.newArray(size);
var index = 0;
for (T t : iterable) {
array.theArray[index] = t;
index++;
}
return array;
}
@Override @Override
public Iterable<T> iterate(FullyUsedArray<T> array) { public Iterable<T> iterate(FullyUsedArray<T> array) {
return () -> new Iterator<>() { return () ->
private int index = 0; new ArrayIterator<>(array.theArray, 0, array.theArray.length);
@Override
public boolean hasNext() {
return index < array.theArray.length;
}
@Override
public T next() {
return array.theArray[index++];
}
};
} }
} }

535
src/aud/exam/prep/array/IterativeFullyUsedArrayProcessor.java Normal file
View File

@ -0,0 +1,535 @@
package aud.exam.prep.array;
import aud.exam.prep.Pair;
import java.util.Comparator;
import java.util.Objects;
@SuppressWarnings("ManualArrayCopy")
public class IterativeFullyUsedArrayProcessor<T> extends FullyUsedArrayProcessor<T> {
@Override
public boolean find(FullyUsedArray<T> array, T t) {
for (int i = 0; i < array.theArray.length; i++) {
if (Objects.equals(array.theArray[i], t)) {
return true;
}
}
return false;
}
@Override
public boolean findBinary(FullyUsedArray<T> array, T t, Comparator<T> cmp) {
if (array.theArray.length == 0) {
return false;
}
var low = 0;
var high = array.theArray.length-1;
while (low <= high) {
var index = (low + high) / 2;
var c = cmp.compare(t, array.theArray[index]);
if (c == 0) {
return true;
} else if (c < 0) {
high = index-1;
} else {
low = index+1;
}
}
return false;
}
@Override
public boolean override(FullyUsedArray<T> array, T from, T to) {
for (int i = 0; i < array.theArray.length; i++) {
if (Objects.equals(array.theArray[i], from)) {
array.theArray[i] = to;
return true;
}
}
return false;
}
@Override
public boolean overrideAll(FullyUsedArray<T> array, T from, T to) {
var modified = false;
for (int i = 0; i < array.theArray.length; i++) {
if (Objects.equals(array.theArray[i], from)) {
array.theArray[i] = to;
modified = true;
}
}
return modified;
}
@Override
public void insertInOrder(FullyUsedArray<T> array, T t, Comparator<T> cmp) {
T[] newArray = Arrays.newArray(array.theArray.length+1);
var index = 0;
while (index < array.theArray.length && cmp.compare(array.theArray[index], t) < 0) {
newArray[index] = array.theArray[index];
index++;
}
newArray[index] = t;
while (index < array.theArray.length) {
newArray[index+1] = array.theArray[index];
index++;
}
array.theArray = newArray;
}
@Override
public boolean remove(FullyUsedArray<T> array, T t) {
if (!find(array, t)) {
return false;
}
T[] newArray = Arrays.newArray(array.theArray.length-1);
var index = 0;
while (!Objects.equals(array.theArray[index], t)) {
newArray[index] = array.theArray[index];
index++;
}
index++;
while (index < array.theArray.length) {
newArray[index-1] = array.theArray[index];
index++;
}
array.theArray = newArray;
return true;
}
@Override
public boolean removeAll(FullyUsedArray<T> array, T t) {
int size = 0;
for (int i = 0; i < array.theArray.length; i++) {
if (!Objects.equals(array.theArray[i], t)) {
size++;
}
}
if (size == array.theArray.length) {
return false;
}
T[] newArray = Arrays.newArray(size);
int index = 0;
for (int i = 0; i < array.theArray.length; i++) {
if (!Objects.equals(array.theArray[i], t)) {
newArray[index++] = array.theArray[i];
}
}
array.theArray = newArray;
return true;
}
@Override
public boolean isAscending(FullyUsedArray<T> array, Comparator<T> cmp) {
for (int i = 0; i < array.theArray.length-1; i++) {
if (cmp.compare(array.theArray[i], array.theArray[i+1]) > 0) {
return false;
}
}
return true;
}
@Override
public T max(FullyUsedArray<T> array, Comparator<T> cmp) {
if (array.theArray.length == 0) {
throw new IllegalArgumentException("The sequence may not be empty");
}
var max = array.theArray[0];
for (int i = 1; i < array.theArray.length; i++) {
if (cmp.compare(max, array.theArray[i]) < 0) {
max = array.theArray[i];
}
}
return max;
}
@Override
public T secondMax(FullyUsedArray<T> array, Comparator<T> cmp) {
if (array.theArray.length < 2) {
throw new IllegalArgumentException("The sequence must contains at least 2 elements");
}
T secondMax, max;
if (cmp.compare(array.theArray[0], array.theArray[1]) < 0) {
secondMax = array.theArray[0];
max = array.theArray[1];
} else {
secondMax = array.theArray[1];
max = array.theArray[0];
}
for (int i = 2; i < array.theArray.length; i++) {
if (cmp.compare(max, array.theArray[i]) < 0) {
secondMax = max;
max = array.theArray[i];
} else if (cmp.compare(secondMax, array.theArray[i]) < 0) {
secondMax = array.theArray[i];
}
}
return secondMax;
}
@Override
public boolean isItemWiseLessOrEqual(FullyUsedArray<T> a, FullyUsedArray<T> b, Comparator<T> cmp) {
if (b.theArray.length < a.theArray.length) {
return false;
}
for (int i = 0; i < a.theArray.length; i++) {
if (cmp.compare(a.theArray[i], b.theArray[i]) > 0) {
return false;
}
}
return true;
}
@Override
public boolean isItemWiseLess(FullyUsedArray<T> a, FullyUsedArray<T> b, Comparator<T> cmp) {
if (b.theArray.length < a.theArray.length) {
return false;
}
var actualLessElement = false;
for (int i = 0; i < a.theArray.length; i++) {
var c = cmp.compare(a.theArray[i], b.theArray[i]);
if (c > 0) {
return false;
} else if (c < 0) {
actualLessElement = true;
}
}
return a.theArray.length < b.theArray.length || actualLessElement;
}
@Override
public boolean isLexSmaller(FullyUsedArray<T> a, FullyUsedArray<T> b, Comparator<T> cmp) {
var end = Integer.min(a.theArray.length, b.theArray.length);
for (int i = 0; i < end; i++) {
var c = cmp.compare(a.theArray[i], b.theArray[i]);
if (c < 0) {
return true;
}
if (c > 0) {
return false;
}
}
return a.theArray.length < b.theArray.length;
}
@Override
public void exchangePairs(FullyUsedArray<T> array) {
for (int i = 1; i < array.theArray.length-1; i += 2) {
T t = array.theArray[i];
array.theArray[i] = array.theArray[i+1];
array.theArray[i+1] = t;
}
}
@Override
public void rotateTriples(FullyUsedArray<T> array) {
for (int i = 1; i < array.theArray.length-2; i += 3) {
T t = array.theArray[i+2];
array.theArray[i+2] = array.theArray[i+1];
array.theArray[i+1] = array.theArray[i];
array.theArray[i] = t;
}
}
@Override
public void removeEverySecond(FullyUsedArray<T> array) {
T[] newArray = Arrays.newArray(array.theArray.length - array.theArray.length / 2);
for (int i = 0; i < newArray.length; i++) {
newArray[i] = array.theArray[2*i];
}
array.theArray = newArray;
}
@Override
public void doubleAllKeys(FullyUsedArray<T> array) {
T[] newArray = Arrays.newArray(array.theArray.length*2);
for (int i = 0; i < array.theArray.length; i++) {
newArray[2*i] = newArray[2*i + 1] = array.theArray[i];
}
array.theArray = newArray;
}
@Override
public FullyUsedArray<T> rotateRight(FullyUsedArray<T> array) {
if (array.theArray.length < 2) {
return array;
}
var right = array.theArray[array.theArray.length-1];
for (int i = array.theArray.length-2; i >= 0; i--) {
array.theArray[i+1] = array.theArray[i];
}
array.theArray[0] = right;
return array;
}
@Override
public FullyUsedArray<T> rotateLeft(FullyUsedArray<T> array) {
if (array.theArray.length < 2) {
return array;
}
var left = array.theArray[0];
for (int i = 0; i < array.theArray.length-1; i++) {
array.theArray[i] = array.theArray[i+1];
}
array.theArray[array.theArray.length-1] = left;
return array;
}
@Override
public void removeDuplicates(FullyUsedArray<T> array) {
if (array.theArray.length < 2) {
return;
}
var distinctRuns = 1;
for (int i = 0; i < array.theArray.length-1; i++) {
if (array.theArray[i] != array.theArray[i+1]) {
distinctRuns++;
}
}
if (distinctRuns == array.theArray.length) {
return;
}
T[] newArray = Arrays.newArray(distinctRuns);
var index = 0;
for (int i = 0; i < array.theArray.length; i++) {
if (index == 0 || !Objects.equals(newArray[index-1], array.theArray[i])) {
newArray[index++] = array.theArray[i];
}
}
array.theArray = newArray;
}
@Override
public FullyUsedArray<T> invert(FullyUsedArray<T> array) {
for (int i = 0; i < array.theArray.length/2; i++) {
T t = array.theArray[i];
array.theArray[i] = array.theArray[array.theArray.length-i-1];
array.theArray[array.theArray.length-i-1] = t;
}
return array;
}
@Override
public FullyUsedArray<T> clone(FullyUsedArray<T> array) {
var newArray = new FullyUsedArray<T>();
newArray.theArray = Arrays.newArray(array.theArray.length);
for (int i = 0; i < array.theArray.length; i++) {
newArray.theArray[i] = array.theArray[i];
}
return newArray;
}
@Override
public FullyUsedArray<T> alternate(FullyUsedArray<T> a, FullyUsedArray<T> b) {
var newArray = new FullyUsedArray<T>();
newArray.theArray = Arrays.newArray(a.theArray.length + b.theArray.length);
var index = 0;
var indexA = 0;
var indexB = 0;
while (indexA < a.theArray.length || indexB < b.theArray.length) {
if (indexA < a.theArray.length) {
newArray.theArray[index++] = a.theArray[indexA++];
}
if (indexB < b.theArray.length) {
newArray.theArray[index++] = b.theArray[indexB++];
}
}
return newArray;
}
@Override
public FullyUsedArray<T> merge(FullyUsedArray<T> a, FullyUsedArray<T> b, Comparator<T> cmp) {
var newArray = new FullyUsedArray<T>();
newArray.theArray = Arrays.newArray(a.theArray.length + b.theArray.length);
var index = 0;
var indexA = 0;
var indexB = 0;
while (indexA < a.theArray.length && indexB < b.theArray.length) {
if (cmp.compare(a.theArray[indexA], b.theArray[indexB]) < 0) {
newArray.theArray[index++] = a.theArray[indexA++];
} else {
newArray.theArray[index++] = b.theArray[indexB++];
}
}
while (indexA < a.theArray.length) {
newArray.theArray[index++] = a.theArray[indexA++];
}
while (indexB < b.theArray.length) {
newArray.theArray[index++] = b.theArray[indexB++];
}
return newArray;
}
@Override
public Pair<FullyUsedArray<T>, FullyUsedArray<T>> divideAlternating(FullyUsedArray<T> array) {
var p = new Pair<FullyUsedArray<T>, FullyUsedArray<T>>();
p.fst = new FullyUsedArray<>();
p.snd = new FullyUsedArray<>();
p.snd.theArray = Arrays.newArray(array.theArray.length / 2);
p.fst.theArray = Arrays.newArray(array.theArray.length - p.snd.theArray.length);
for (int i = 0; i < array.theArray.length; i++) {
if (i % 2 == 0) {
p.fst.theArray[i/2] = array.theArray[i];
} else {
p.snd.theArray[i/2] = array.theArray[i];
}
}
return p;
}
@Override
public Pair<FullyUsedArray<T>, FullyUsedArray<T>> divideAlternatingByRuns(FullyUsedArray<T> array, Comparator<T> cmp) {
var p = new Pair<FullyUsedArray<T>, FullyUsedArray<T>>();
p.fst = new FullyUsedArray<>();
p.snd = new FullyUsedArray<>();
var runInFst = true;
var elementsInFst = 0;
for (int i = 0; i < array.theArray.length; i++) {
if (runInFst) {
elementsInFst++;
}
if (i < array.theArray.length-1 && cmp.compare(array.theArray[i], array.theArray[i + 1]) > 0) {
runInFst = !runInFst;
}
}
p.fst.theArray = Arrays.newArray(elementsInFst);
p.snd.theArray = Arrays.newArray(array.theArray.length - elementsInFst);
runInFst = true;
var indexA = 0;
var indexB = 0;
for (int i = 0; i < array.theArray.length; i++) {
if (runInFst) {
p.fst.theArray[indexA++] = array.theArray[i];
} else {
p.snd.theArray[indexB++] = array.theArray[i];
}
if (i < array.theArray.length-1 && cmp.compare(array.theArray[i], array.theArray[i + 1]) > 0) {
runInFst = !runInFst;
}
}
return p;
}
@Override
public Pair<FullyUsedArray<T>, FullyUsedArray<T>> divideByPivot(FullyUsedArray<T> array, T pivot, Comparator<T> cmp) {
var p = new Pair<FullyUsedArray<T>, FullyUsedArray<T>>();
p.fst = new FullyUsedArray<>();
p.snd = new FullyUsedArray<>();
var less = 0;
var greater = 0;
for (int i = 0; i < array.theArray.length; i++) {
var c = cmp.compare(array.theArray[i], pivot);
if (c < 0) {
less++;
}
if (c > 0) {
greater++;
}
}
p.fst.theArray = Arrays.newArray(less);
p.snd.theArray = Arrays.newArray(greater);
var indexA = 0;
var indexB = 0;
for (int i = 0; i < array.theArray.length; i++) {
var c = cmp.compare(array.theArray[i], pivot);
if (c < 0) {
p.fst.theArray[indexA++] = array.theArray[i];
}
if (c > 0) {
p.snd.theArray[indexB++] = array.theArray[i];
}
}
return p;
}
@Override
public FullyUsedArray<T> create(Iterable<T> iterable) {
var array = new FullyUsedArray<T>();
var size = 0;
for (T ignored : iterable) {
size++;
}
array.theArray = Arrays.newArray(size);
var index = 0;
for (T t : iterable) {
array.theArray[index] = t;
index++;
}
return array;
}
}

170
src/aud/exam/prep/array/RecursiveFullyUsedArrayProcessor.java Normal file
View File

@ -0,0 +1,170 @@
package aud.exam.prep.array;
import aud.exam.prep.Pair;
import java.util.Comparator;
import java.util.Iterator;
public class RecursiveFullyUsedArrayProcessor<T> extends FullyUsedArrayProcessor<T> {
@Override
public boolean find(FullyUsedArray<T> array, T t) {
return false;
}
@Override
public boolean findBinary(FullyUsedArray<T> array, T t, Comparator<T> cmp) {
return false;
}
@Override
public boolean override(FullyUsedArray<T> array, T from, T to) {
return false;
}
@Override
public boolean overrideAll(FullyUsedArray<T> array, T from, T to) {
return false;
}
@Override
public void insertInOrder(FullyUsedArray<T> array, T t, Comparator<T> cmp) {
}
@Override
public boolean remove(FullyUsedArray<T> array, T t) {
return false;
}
@Override
public boolean removeAll(FullyUsedArray<T> array, T t) {
return false;
}
@Override
public boolean isAscending(FullyUsedArray<T> array, Comparator<T> cmp) {
return false;
}
@Override
public T max(FullyUsedArray<T> array, Comparator<T> cmp) {
return null;
}
@Override
public T secondMax(FullyUsedArray<T> array, Comparator<T> cmp) {
return null;
}
@Override
public boolean isItemWiseLessOrEqual(FullyUsedArray<T> a, FullyUsedArray<T> b, Comparator<T> cmp) {
return false;
}
@Override
public boolean isItemWiseLess(FullyUsedArray<T> a, FullyUsedArray<T> b, Comparator<T> cmp) {
return false;
}
@Override
public boolean isLexSmaller(FullyUsedArray<T> a, FullyUsedArray<T> b, Comparator<T> cmp) {
return false;
}
@Override
public void exchangePairs(FullyUsedArray<T> array) {
}
@Override
public void rotateTriples(FullyUsedArray<T> array) {
}
@Override
public void removeEverySecond(FullyUsedArray<T> array) {
}
@Override
public void doubleAllKeys(FullyUsedArray<T> array) {
}
@Override
public FullyUsedArray<T> rotateRight(FullyUsedArray<T> array) {
return null;
}
@Override
public FullyUsedArray<T> rotateLeft(FullyUsedArray<T> array) {
return null;
}
@Override
public void removeDuplicates(FullyUsedArray<T> array) {
}
@Override
public FullyUsedArray<T> invert(FullyUsedArray<T> array) {
return null;
}
@Override
public FullyUsedArray<T> clone(FullyUsedArray<T> array) {
return null;
}
@Override
public FullyUsedArray<T> alternate(FullyUsedArray<T> a, FullyUsedArray<T> b) {
return null;
}
@Override
public FullyUsedArray<T> merge(FullyUsedArray<T> a, FullyUsedArray<T> b, Comparator<T> cmp) {
return null;
}
@Override
public Pair<FullyUsedArray<T>, FullyUsedArray<T>> divideAlternating(FullyUsedArray<T> array) {
return null;
}
@Override
public Pair<FullyUsedArray<T>, FullyUsedArray<T>> divideAlternatingByRuns(FullyUsedArray<T> array, Comparator<T> cmp) {
return null;
}
@Override
public Pair<FullyUsedArray<T>, FullyUsedArray<T>> divideByPivot(FullyUsedArray<T> array, T pivot, Comparator<T> cmp) {
return null;
}
@Override
public FullyUsedArray<T> create(Iterable<T> iterable) {
var size = countElement(iterable.iterator());
var array = new FullyUsedArray<T>();
array.theArray = Arrays.newArray(size);
copyElements(array.theArray, iterable.iterator(), 0);
return array;
}
private void copyElements(T[] array, Iterator<T> iter, int index) {
if (index < array.length) {
array[index] = iter.next();
copyElements(array, iter, index+1);
}
}
private int countElement(Iterator<T> iter) {
if (iter.hasNext()) {
iter.next();
return 1 + countElement(iter);
}
return 0;
}
}

2
test/aud/exam/prep/SequenceProcessorTest.java
View File

@ -512,7 +512,7 @@ public abstract class SequenceProcessorTest<S> {
@ParameterizedTest @ParameterizedTest
@ArgumentsSource(DoubleListProvider.class) @ArgumentsSource(DoubleListProvider.class)
void testThat_cloneWorks(List<Integer> listA, List<Integer> listB) { void testThat_alternateWorks(List<Integer> listA, List<Integer> listB) {
S a = processor.create(listA); S a = processor.create(listA);
S b = processor.create(listB); S b = processor.create(listB);

10
test/aud/exam/prep/array/FullyUsedArrayProcessorTest.java
View File

@ -1,10 +0,0 @@
package aud.exam.prep.array;
import aud.exam.prep.SequenceProcessorTest;
public class FullyUsedArrayProcessorTest extends SequenceProcessorTest<FullyUsedArray<Integer>> {
protected FullyUsedArrayProcessorTest() {
super(new FullyUsedArrayProcessor<>());
}
}

10
test/aud/exam/prep/array/IterativeFullyUsedArrayProcessorTest.java Normal file
View File

@ -0,0 +1,10 @@
package aud.exam.prep.array;
import aud.exam.prep.SequenceProcessorTest;
public class IterativeFullyUsedArrayProcessorTest extends SequenceProcessorTest<FullyUsedArray<Integer>> {
protected IterativeFullyUsedArrayProcessorTest() {
super(new IterativeFullyUsedArrayProcessor<>());
}
}

10
test/aud/exam/prep/array/RecursiveFullyUsedArrayProcessorTest.java Normal file
View File

@ -0,0 +1,10 @@
package aud.exam.prep.array;
import aud.exam.prep.SequenceProcessorTest;
class RecursiveFullyUsedArrayProcessorTest extends SequenceProcessorTest<FullyUsedArray<Integer>> {
protected RecursiveFullyUsedArrayProcessorTest() {
super(new RecursiveFullyUsedArrayProcessor<>());
}
}