Scala translation

woah, didnt expect the timeout lol

Fixed in Python, added random tests for it as well (somewhat lazily).

Python fork

• New test framework
• Fixed tests for laziness
• Random tests for laziness

Approved, great job!

Finding the algorithm isn't enough to be deemed a puzzle, you'd also need to find out part of the specification, which is the case in this kata. Eventhough you give visual examples, the user still needs to find out the pattern. So I would add the puzzle tag.

I have no opinion in this matter as I don’t know what “puzzle” means.

From my perspective the algorithm is clearly described by example. The solving of the kata includes finding out a more formal description which then is straight forwardly implemented. Also, looking at the various solutions, I think an algorithm description would narrow it down. My solution was a recursive one (which in combination with generators isn’t something everybody is familiar with). But other solution are using different approaches (and thus different algorithms) to achieve the same results.

It’s like with sorting. By looking at the result (the sorted lists) you cannot find out which algorithm has been used. But I wouldn’t call that a puzzle either.

If, however, puzzle means that you have to find the algorithm, then I’m fine with giving this kata the puzzle tag.

Shouldn't this get a puzzle tag, as the algorithm to dither is not described at all?

Rust translation ready for review (author inactive)

i dont understand !!! :(

I suggest to split the tests like this, and also fix the spelling on Partial

@test.it('Partial tests 2x2')
def _():
    test.assert_equals(list(dithering(2, 2)),
                       [(0,0), (1,1), (1,0), (0,1)])
@test.it('Partial tests 4x4')
def _():        
    g = dithering(4, 4)
    for i in range(10):
      next(g)
    test.assert_equals(next(g), (3,0))

Thank you for pointing out the direction out of the fog.;=)