send2trash VS more-itertools

This GitHub issue might be relevant as well.

And here are some libraries that might pique your interest although they don't strictly answer your question: - tqdm for adding a progress bar on for loops (it comes with useful information like iteration per second and estimated time needed to finish) - alive_progress adds a progress bar like tqdm, but it works even with generators and while loops which I don't think tqdm does. -timebudget, with just a decorator as soon as a function is completed it prints the time taken to execute it - send2trash for sending files to the trash bin instead of permanently deleting them - keyboard for sending keyboard inputs or check if a key is pressed - mouse same as keyboard but with mouse buttons - textract for extracting text from many types of file with a single interface. It supports documents, powerpoint presentations, csv, excels, images, gifs, audio, and many more

I'd bet that reading through more-itertools would be a good exercise.

check out the code examples in itertools and the source code of more-itertools if you want to see cases where next and iter get used by themselves.

from itertools import islice # Copied from the more-itertools library (MIT license) # https://github.com/more-itertools/more-itertools def batched(iterable, n): "Batch data into lists of length n. The last batch may be shorter." # batched('ABCDEFG', 3) --> ABC DEF G if n < 1: raise ValueError('n must be at least one') it = iter(iterable) while (batch := list(islice(it, n))): yield batch

more_itertools.chunked

I've had a tab open to more-itertools on github for weeks; maybe I should go read it...

The popular more-itertools library implements (among many others) a chunked method which yields lists of size n from an iterator. There is also the ichunked method which yields iterators of size n instead of lists.

There's a function called consecutive_groups in the more-itertools library that will do this for you efficiently.

Here are some that might answer your question: - algorithms is a library which contains many of the most useful algorithms for sorting, searching, working with trees, math algorithms like factorials, prime finders and many more - data classes to save you the trouble of writing everytime special methods in a class like init, repr, set, get - box allows the use of dot on dictionaries to access the keys - more-itertools for more routines to operate on iterables than those itertools provide.