diff options
Diffstat (limited to 'src')
| -rw-r--r-- | src/algorithms/arrays/MinMax.java | 49 | ||||
| -rw-r--r-- | src/comparable | 105 |
2 files changed, 154 insertions, 0 deletions
diff --git a/src/algorithms/arrays/MinMax.java b/src/algorithms/arrays/MinMax.java new file mode 100644 index 0000000..ccdbc56 --- /dev/null +++ b/src/algorithms/arrays/MinMax.java @@ -0,0 +1,49 @@ +/** + * Copyright © 2014 Mattias Andrée (maandree@member.fsf.org) + * + * This program is free software: you can redistribute it and/or modify + * it under the terms of the GNU Affero General Public License as published by + * the Free Software Foundation, either version 3 of the License, or + * (at your option) any later version. + * + * This program is distributed in the hope that it will be useful, + * but WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + * GNU Affero General Public License for more details. + * + * You should have received a copy of the GNU Affero General Public License + * along with this program. If not, see <http://www.gnu.org/licenses/>. + */ +package algorithms.arrays; + + +/** + * Class for finding the minimum and maximum values in one iteration + */ +public class MinMax +{ +£>for T in boolean char byte short int long float double T T+; do . src/comparable + /** + * Find the minimum and maximum values in an array + * + * @param items The items over to search + * @return An array with two elements, at index 0, the minimum value, and at position 1, the maximum value + */ +£>[ $T = T ] && + @SuppressWarnings("unchecked") + public static £(fun "${T}[]" getBounds "${T}[] items") + { + £{T} max, min, cur; + max = min = items[0]; + + for (int i = 1, n = items.length; i < n; i++) + if (£(greater "cur = items[i]" "max")) + max = cur; + else if (£(less "cur" "min")) + min = cur; + + return £(T-array min max); + } +£>done +} + diff --git a/src/comparable b/src/comparable new file mode 100644 index 0000000..51762d3 --- /dev/null +++ b/src/comparable @@ -0,0 +1,105 @@ +# -*- shell-script -*- + +Tparam="" +Targ="" +function T-array +{ + elems="" + for elem in "$@"; do + elems="${elems:+${elems}, }${elem}" + done + if [ $T = T ]; then + echo "((${T}[])(new Object[] { ${elems} }))" + else + echo "(new ${T}[] { ${elems} })" + fi +} +if [ $T = boolean ]; then + function greater + { echo "($1) & !($2)" + } + function greater= + { echo "($1) | !($2)" + } + function = + { echo "($1) == ($2)" + } + function not= + { echo "($1) ^ ($2)" + } + function less= + { echo "!($1) | ($2)" + } + function less + { echo "!($1) & ($2)" + } +elif [ $T = T ] || [ $T = T+ ]; then + if [ $T = T ]; then + Tparam="<T> " + Targ=", Comparator<T> comparator" + function greater + { echo "comparator.compare($1, $2) > 0" + } + function greater= + { echo "comparator.compare($1, $2) >= 0" + } + function = + { echo "comparator.compare($1, $2) == 0" + } + function not= + { echo "comparator.compare($1, $2) != 0" + } + function less= + { echo "comparator.compare($1, $2) <= 0" + } + function less + { echo "comparator.compare($1, $2) < 0" + } + else + Tparam="<T extends Comparable<? super T>> " + Targ="" + function greater + { echo "($1).compareTo($2) > 0" + } + function greater= + { echo "($1).compareTo($2) >= 0" + } + function = + { echo "($1).compareTo($2) == 0" + } + function not= + { echo "($1).compareTo($2) != 0" + } + function less= + { echo "($1).compareTo($2) <= 0" + } + function less + { echo "($1).compareTo($2) < 0" + } + T=T + fi +else + function greater + { echo "($1) > ($2)" + } + function greater= + { echo "($1) >= ($2)" + } + function = + { echo "($1) == ($2)" + } + function not= + { echo "($1) != ($2)" + } + function less= + { echo "($1) <= ($2)" + } + function less + { echo "($1) < ($2)" + } +fi +function fun +{ + echo "${Tparam}${1} ${2}(${3}${Targ})" +} + |