combinatorics.rb

combinatorics.rb copied to clipboard

It would be useful to add Monad primitives for Enumerating over Sets/Lists. Unlike Ruby's built-in `Array#combination` and `Array#permutation` methods, these Monads would accept any `Enumerable` value and only execute when...

postmodern

Allow all `cardinality` methods to accept an `Enumerable` value for `n`. In which case `n` will become `n.count`, which enumerates over the value and returns the total number of values...

postmodern

``` ([['a', 'b'].enum_for] * 2).comprehension ``` This will loop infinitely on `["b", "a"]`.

postmodern