reorder_nodes allows reordering
the nodes in an existing FFT definition
(in the tidy data frame format).
reorder_nodes allows to directly set and change the node
order in an FFT definition by specifying nodes.
When a former non-final node becomes a final node,
the exit type of the former final node
is set to the signal value (i.e., exit_types[2]).
reorder_nodes(fft, order = NA, quiet = FALSE)One FFT definition (as a data frame in tidy format, with one row per node).
The desired node order (as an integer vector).
The values of order must be a permutation of 1:nrow(fft).
Default: order = NA.
Hide feedback messages (as logical)?
Default: quiet = FALSE.
One FFT definition (as a data frame in tidy format, with one row per node).
add_nodes for adding nodes to an FFT definition;
edit_nodes for editing nodes in an FFT definition;
drop_nodes for deleting nodes from an FFT definition;
flip_exits for reversing exits in an FFT definition;
select_nodes for selecting nodes in an FFT definition;
get_fft_df for getting the FFT definitions of an FFTrees object;
read_fft_df for reading one FFT definition from tree definitions;
add_fft_df for adding FFTs to tree definitions;
FFTrees for creating FFTs from and applying them to data.
Other tree definition and manipulation functions:
add_fft_df(),
add_nodes(),
drop_nodes(),
edit_nodes(),
flip_exits(),
get_fft_df(),
read_fft_df(),
select_nodes(),
write_fft_df()