Description Usage Arguments Value Examples
In the context of a composite algorithm,
return the list of immediate predecessor algorithms
to a given component algorithm.
If the component is a constant, the list of predecessors will be empty.
Among the predecessors, we may find the composite if the component
is directly linked to one of the composite input bits.
Notation
N^{-}(x)
1 | predecessors(composite, component, ...)
|
composite |
The composite within which we want to perform this operation (R6 class algo_composite). |
component |
The component algorithm whose predecessors we want to list (R6 class algo_base | character vector of the component ID). |
The list of predecessor algorithms (list of algo_base items).
1 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.