additions to itertools standard library
Return iterable that counts from start to end (both included).
return iterator over n values linearly interpolated between (and including) start and end
Make groups of ‘n’ elements from the iterable advancing ‘step’ elements on each iteration
Like reduce() but using iterators (a.k.a scanl)
List unique elements, preserving order. Remember all elements ever seen.
Return dictionary with occurrences from iterable
http://stackoverflow.com/questions/12093364/cartesian-product-of-large-iterators-itertools
Return True if pred(x) is True for at least one element in the iterable
Return True if pred(x) is True for all elements in the iterable
Returns True if pred(x) is False for every element in the iterable
Make groups of ‘n’ elements from the iterable advancing ‘step’ elements each iteration
Count how many times the predicate is true
generates values in random order equivalent to using shuffle in random, without generating all values at once
@return list of elements in iterable that satisfy condition, and those that don’t
Like C++ std::next_permutation() but implemented as generator. Yields copies of seq. see http://blog.bjrn.se/2008/04/lexicographic-permutations-using.html
Bases: object
Takes in an object that is iterable. http://code.activestate.com/recipes/578092-flattening-an-arbitrarily-deep-list-or-any-iterato/ Allows for the following method calls (that should be built into iterators anyway...) calls: - append - appends another iterable onto the iterator. - insert - only accepts inserting at the 0 place, inserts an iterable before other iterables. - adding. an iter2 object can be added to another object that is iterable. i.e. iter2 + iter (not iter + iter2). It’s best to make all objects iter2 objects to avoid syntax errors. :D
list of weak references to the object (if defined)