{"id":26304,"date":"2020-02-10T11:36:45","date_gmt":"2020-02-10T16:36:45","guid":{"rendered":"https:\/\/www.dannyadam.com\/blog\/?p=26304"},"modified":"2023-07-20T10:57:57","modified_gmt":"2023-07-20T14:57:57","slug":"revdoor","status":"publish","type":"post","link":"https:\/\/www.dannyadam.com\/blog\/2020\/02\/revdoor\/","title":{"rendered":"revdoor"},"content":{"rendered":"\n

revdoor<\/code> is a single-file C++ library for visiting revolving door<\/em> combinations<\/a>.<\/p>\n\n\n\n

The combinations without replacement<\/em> generator implements Algorithm R from TAOCP 7.2.1.3 [1<\/a>]. The combinations with replacement<\/em> generator implements the same algorithm, modified to support replacement.<\/p>\n\n\n\n

The algorithms visit combinations by indicating at most two pairs of items to swap in and out on each iteration.<\/p>\n\n\n\n

The source code is available on GitHub:
https:\/\/github.com\/dstein64\/revdoor<\/a><\/a><\/p>\n\n\n

<\/p>\n\n\n

Example<\/span><\/strong><\/h4>\n\n\n\n

The following example program\u2014that uses the revdoor<\/code> single-file header library\u2014visits combinations by indicating the replacement for each iteration. For the purpose of illustration, the full set of combination items is tracked and printed on each iteration.<\/p>\n\n\n\n

\n