Algorithmic Sets: Unterschied zwischen den Versionen
Zur Navigation springen
Zur Suche springen
imported>Mkurz Die Seite wurde neu angelegt: „== Definition Algorithmic Set == * We want to define an algorithms set via a Predicate deciding if an element is part of the set.“ |
imported>Mkurz Keine Bearbeitungszusammenfassung |
||
| Zeile 1: | Zeile 1: | ||
== Definition Algorithmic Set == | == Definition Algorithmic Set == | ||
* We want to define an | * We want to define an algorithmic set via a Predicate deciding if an element is part of the set. | ||
* In java we could use the functional interface Predicate<T> | |||
<pre> | |||
public interface Predicate<T>{ | |||
} | |||
</pre> | |||
Version vom 8. November 2014, 08:34 Uhr
Definition Algorithmic Set
- We want to define an algorithmic set via a Predicate deciding if an element is part of the set.
- In java we could use the functional interface Predicate<T>
public interface Predicate<T>{
}