{"push_id":1856042040,"size":1,"distinct_size":1,"ref":"refs/heads/markov-chain-iterator","head":"290ed03b0d9611cfb47da062928c873a30c69d0f","before":"c5b4be2f5979e9aad11d370e52f5ff26bd9c0030","commits":[{"sha":"290ed03b0d9611cfb47da062928c873a30c69d0f","author":{"name":"Martin Geisler","email":"ea98e1d0a9a4d10e3af04e16be88050749615623@geisler.net"},"message":"MarkovChain: add iter and iter_from methods\n\nThese methods return an iterator which will generate a neverending\nchain of words. The iterator can be used by itself, or it can be used\nindirectly by the generate and generate_from methods.\n\nThe new iterator works slightly differently from the old code in\ncorner cases where the iteration ends up in a state from which there\nis no next state in the Markov chain. Like before, a new state is\npicked at random, but this now happens one word earlier than before.\nThis should not make a big difference outside of artificially small\ntest cases.","distinct":true,"url":"https://api.github.com/repos/mgeisler/lipsum/commits/290ed03b0d9611cfb47da062928c873a30c69d0f"}]}
{"actor":{"display_login":"mgeisler"}}