Collin Funk wrote:
> > The output needs to be deterministic; the natural order from the module
> > description is perfectly fine. Therefore the sorting in the Python code 
> > should
> > go away.
> 
> I've attached a patch

Thanks; applied!

> Since sets are unordered, before I found out duplicates weren't
> removed, I was wondering what the fastest way to remove duplicates
> from a list in Python would be while preserving order. Turns out an
> implementation detail in Python 3.7+ allows for this to be done
> quickly in one line. Might be come in handy later.
> 
> [1] https://stackoverflow.com/a/17016257

Nice trick; thanks for sharing.

Bruno




Reply via email to