list all subset combinations of n element in given set of r element. This is a recursive function that collects all subsets of the set of size n with the given set of size r.
(
set: &[i32],
n: usize,
r: usize,
index: usize,
data: &mut [i32],
i: usize,
)
source not stored for this graph (policy: none)