Faltungen
Studieren Sie den zur Aufgabe gehörenden Lehrbrief und lösen Sie die Aufgaben darin. Testen Sie ihre Lösungen zunächst am besten interaktiv in der JShell.
package name.panitz.util;
import java.util.function.Function;
import java.util.function.Predicate;
import java.util.function.BiFunction;
import java.util.*;
import java.util.stream.Collectors;
public class Reduction{
static public int count(Iterable<String> xs){
int result = 0;
for (String x : xs) {result = result + 1;}
return result;
}
public static int chrNo(Iterable<String> xs){
int result = 0;
for (String x : xs) {result = result + x.length();}
return result;
}
public static String ap(Iterable<String> xs){
String result = " ";
for (String x : xs) {result = result + " " + x;}
return result;
}
public static String lo(Iterable<String> xs){
String result = "";
for (String x : xs) {result= result.length() > x.length()?result:x;}
return result;
}
public static boolean co(String y,Iterable<String> xs){
boolean result = false;
for (String x : xs) {result = result || x.equals(y);}
return result;
}
public static<E,R> R fold(Iterable<E> xs,R result,BiFunction<R,E,R> o){
for (E x : xs) {result = o.apply(result,x);}
return result;
}
public static int countF(Iterable<String> xs){
return fold(xs, 0, (result,x) -> result + 1);
}
public static int chrNoF(Iterable<String> xs) {
return fold(xs,0,(result,x) -> result + x.length());
}
public static String apF(Iterable<String> xs) {
return fold( xs, " ", (result,x) ->result + " " + x);
}
public static String loF(Iterable<String> xs) {
return fold( xs, "", (result,x)->result.length()>x.length()?result:x);
}
public static boolean coF(String y,Iterable<String> xs) {
return fold( xs, false, (result,x)-> result || x.equals(y));
}
public static int sum(Iterable<Integer> xs) {
return 0;
}
public static long product(Iterable<Long> xs) {
return 0;
}
public static long maximum(Iterable<Long> xs) {
return 0;
}
public static <E>
boolean exists(Iterable<E> xs, Predicate<? super E> p) {
return false;
}
public static <E>
boolean all(Iterable<E> xs, Predicate<? super E> p) {
return false;
}
public static <E>
Set<E> collect(Iterable<E> xs, Predicate<? super E> p) {
return Set.of();
}
public static List<Character> toList(String str) {
return str.chars()
.mapToObj(c -> (char) c).collect(Collectors.toList());
}
public static int readBinary(String str) {
return readBinary(toList(str));
}
public static int readBinary(Iterable<Character> xs) {
return 0;
}
public static record Pair<A,B>(A fst,B snd){}
public static int romanDigit(char c){
return switch(c){
case 'I' -> 1;
case 'V' -> 5;
case 'X' -> 10;
case 'L' -> 50;
case 'C' -> 100;
case 'D' -> 500;
case 'M' -> 1000;
default ->
throw new RuntimeException("Illegal roman digit: "+c);
};
}
public static int readRoman(String str) {
return readRoman(toList(str)).fst();
}
public static
Pair<Integer,Integer> readRoman(Iterable<Character> xs) {
return null; /* ToDo */
}
}
java
You are not logged in and therefore you cannot submit a solution.
Subato
