schlichtanders.mygenerators module

mygenerators encompasses many useful generators in order to work with for loops and the like in a nice way. I can recommend all, especially chunk, history, merge and product

schlichtanders.mygenerators.accumulate(iterable, func=<built-in function add>, base=None)

Return running totals

schlichtanders.mygenerators.call(funcs, *args, **kwargs)

schlichtanders.mygenerators.chunk(chunk_size, iterable)

schlichtanders.mygenerators.chunk_list(chunk_size, iterable)

schlichtanders.mygenerators.compress_idx(data, selectors)

Return data elements where indexes correspond to selector elements. Forms a shorter iterator from selected data elements using the selectors to choose the data elements.

schlichtanders.mygenerators.converge(func, initial, stop_criterion=<function <lambda>>)

schlichtanders.mygenerators.converge_stepwise(func, initial, *ARGS, **kwargs)

schlichtanders.mygenerators.cycle_permute(listlike)

schlichtanders.mygenerators.deepflatten(maybe_iterable)

flattens out everything

schlichtanders.mygenerators.deleteallbutone(elm, l)

schlichtanders.mygenerators.eat(gen, n=1)

schlichtanders.mygenerators.eatN(N, iterator)

just eats the first N iterator elements away (kind of a delete) essentially this is a flipped version of eat

Parameters:

• N – how much to eat
• iterator – to be eaten

Returns:

iterator[N::] kind of

schlichtanders.mygenerators.enumerate_(iterable)

schlichtanders.mygenerators.every(nth, iterable)

schlichtanders.mygenerators.hist(iterable, history_size=1, filler='None')

schlichtanders.mygenerators.history(iterable, history_size=1, filler='None')

schlichtanders.mygenerators.int_exponentials(base=2)

schlichtanders.mygenerators.iter_args(args)

schlichtanders.mygenerators.iter_kwargs(kwargs)

schlichtanders.mygenerators.merge(*args)

merges args into an already existing list of tuples structure (e.g. created by previous zip or product)

schlichtanders.mygenerators.merge_dyn(*args)

merges args into an already existing list of tuples structure (e.g. created by previous zip or product) slightly slower, but less code =), and more dynamic

schlichtanders.mygenerators.pipe_stepwise(vec, *transforms)

schlichtanders.mygenerators.product(*args)

schlichtanders.mygenerators.recurse(func, initial, stop_criterion=<function <lambda>>)

schlichtanders.mygenerators.recurse_stepwise(func, initial, *ARGS, **kwargs)

schlichtanders.mygenerators.replicate(func, *args, **kwargs)

repeatedly calls the function with given args/kwargs

the name is choosen to match R replicate

schlichtanders.mygenerators.run(gen)

schlichtanders.mygenerators.shallowflatten(maybe_iterable)

schlichtanders.mygenerators.succint_exponentials(base=2)

schlichtanders.mygenerators.takeN(n, iterable)

schlichtanders.mygenerators.takewhile1(predicate, iterable)

schlichtanders.mygenerators.time_gen(generator)