#> cbArrangements 1.057 1.116 0.618 1.052 1.002 0.03638 100įirst, we examine permutations without replacement chosen m at a time.īenchmark: microbenchmark(cbRcppAlgos = permuteGeneral(testVector3, 6),ĬbGtools = gtools::permutations(10, 6, testVector3),ĬbArrangements = permutations(testVector3, 6),
Now, we examine combinations with replacement chosen m at a time.īenchmark: microbenchmark(cbRcppAlgos = comboGeneral(testVector2, m, TRUE),ĬbGtools = gtools::combinations(10, m, testVector2, repeats.allowed = TRUE),ĬbArrangements = combinations(testVector2, m, replace = TRUE), Combinationsįirst, we examine combinations without replacement chosen m at a time.īenchmark: microbenchmark(cbRcppAlgos = comboGeneral(testVector1, m),ĬbGRbase = gRbase::combnPrim(testVector1, m),ĬbGtools = gtools::combinations(17, m, testVector1),ĬbCombinat = combinat::combn(testVector1, m),ĬbArrangements = combinations(17, m, testVector1), Also, gc() is periodically called to ensure all memory is available (See ?gc). The results for the other two systems were similar. The listed results were obtained from setup #1 (i.e. In practice, we are generally concerned with finding rearrangements of a general vector, therefore all examinations below will reflect this (when possible).Īll benchmarks were ran on 3 different set-ups. The tasks, m at a time and general vector, refer to the capability of generating results " m at a time" (when m is less than the length of the vector) and rearranging a "general vector" as opposed to 1:n. |general vector | Yes | Yes | Yes | Yes | |_| iterpc | arrangements | RcppAlgos | gRbase | |- OVERVIEW -| |_| gtools | combinat | multicool | partitions | I did not include permute, permutations, or gRbase::aperm/ar_perm as they are not really meant to attack these types of problems. Thus, no matter how many times a particular element originally occurs, the output will have an instance(s) of that element repeated 1 to m times. This is so, because when we have replacement, it is not specific. non-distint items chosen m at a time are equivalent. If I have left out any package, please forgive me and please leave a comment or better yet, edit this post.īefore we begin, we note that combinations/permutations with replacement of distinct vs. A Walk Through a Slice of Combinatorics in R*īelow, we examine packages equipped with the capabilities of generating combinations & permutations.
0 kommentar(er)
