-
@Maunus, we have multiple ways to handle vowel sequences. But the question is what you think is best here. If I have something like "a ó", this indicates we are dealing with two syllables, I assume fo…
-
Ensure that all damage rolling possibilities are covered in the text. In particular:
-dice
+dice
+X
-X
+stat
-stat
+die size
-die size
b[]
w[]
-
### Bilateral Combinations
> The last mod-tap hold will be converted to the corresponding mod-tap tap if another key on the same hand is tapped during the hold, unless a key on the other hand is ta…
-
We should make sure that everything is always ordered lexicographically.
This would probably be best.
So our n choose k algorithms (e.g. `Itertools::combinations`) should always yield subsets that a…
-
## Objective
Create service to generate Rails new commands based on user selections
**Note - there's an overlap with the currently existing functionality. Resolve this when we get here**
## Tas…
-
That can't happen (I don't think). There are probably a bunch of impossible combinations worth being aware of and filtering against.
-
48,58
16,31
7,22,77
4,1,22
-
To match @gdejohn's implementation of `Collection.permutations()`, we also need `combinations()`.
-
To study the impact of single retrofit measures (e.g. rooftop etc.) on the building envelope and energy system, studying possible combinations is often done.
This feature adds a simple option to gene…
-
I'm using secrets = secrets.concat(combinations(tokens, '!!!!!!!!')); . How do I avoid the program using the same token multiple times in each attempt? It would save a lot of time. Thanks.