| Package | Description |
|---|---|
| de.spricom.dessert.assertions | |
| de.spricom.dessert.partitioning | |
| de.spricom.dessert.resolve |
The classes of this package are used to build up a hierarchical data structure of
packages.
|
| de.spricom.dessert.slicing | |
| de.spricom.dessert.util |
| Class and Description |
|---|
| Dag
This class implements the Depth-first search algorithm (see https://en.wikipedia.org/wiki/Topological_sorting)
to detect illegal cycles on a directed acyclic graph.
|
| Class and Description |
|---|
| Predicate
A functional interface for a test on any object.
|
| Class and Description |
|---|
| Predicate
A functional interface for a test on any object.
|
| Class and Description |
|---|
| Predicate
A functional interface for a test on any object.
|
| Class and Description |
|---|
| Predicate
A functional interface for a test on any object.
|
Copyright © 2017–2021 Hans Jörg Heßmann. All rights reserved.