#dicts — Public Fediverse posts

Handy set of tips and tricks with Python dicts #python #dicts #tricks #howto : "Get the most out of Python dicts"(https://open.substack.com/pub/bitecode/p/get-the-most-out-of-python-dicts?r=1slq0e&utm_medium=ios&utm_campaign=post)

Handy set of tips and tricks with Python dicts #python #dicts #tricks #howto : "Get the most out of Python dicts"(https://open.substack.com/pub/bitecode/p/get-the-most-out-of-python-dicts?r=1slq0e&utm_medium=ios&utm_campaign=post)

Handy set of tips and tricks with Python dicts #python #dicts #tricks #howto : "Get the most out of Python dicts"(https://open.substack.com/pub/bitecode/p/get-the-most-out-of-python-dicts?r=1slq0e&utm_medium=ios&utm_campaign=post)

Handy set of tips and tricks with Python dicts #python #dicts #tricks #howto : "Get the most out of Python dicts"(https://open.substack.com/pub/bitecode/p/get-the-most-out-of-python-dicts?r=1slq0e&utm_medium=ios&utm_campaign=post)

@winniehell

It is #unfortunate. It would be nice if we had a fourth member to go after #parentheses, #brackets, and #braces.

I tend not to use set literals, preferring `set(sequence)`. Maybe it's because my brain insists they're broken #dicts.

@winniehell

It is #unfortunate. It would be nice if we had a fourth member to go after #parentheses, #brackets, and #braces.

I tend not to use set literals, preferring `set(sequence)`. Maybe it's because my brain insists they're broken #dicts.

@winniehell

It is #unfortunate. It would be nice if we had a fourth member to go after #parentheses, #brackets, and #braces.

I tend not to use set literals, preferring `set(sequence)`. Maybe it's because my brain insists they're broken #dicts.

@winniehell

It is #unfortunate. It would be nice if we had a fourth member to go after #parentheses, #brackets, and #braces.

I tend not to use set literals, preferring `set(sequence)`. Maybe it's because my brain insists they're broken #dicts.

@winniehell

It is #unfortunate. It would be nice if we had a fourth member to go after #parentheses, #brackets, and #braces.

I tend not to use set literals, preferring `set(sequence)`. Maybe it's because my brain insists they're broken #dicts.

@nosherwan @xblasco This article for #Python #dicts is interesting: https://tenthousandmeters.com/blog/python-behind-the-scenes-10-how-python-dictionaries-work/

For one, it reiterates the time complexity as O(1), but then you can see the graph where it doesn't follow theory when benchmarked.

The article explains why. CPU Caches.

But the underlying question is, should be considered O(1) if in practice doesn't follow it?

@nosherwan @xblasco This article for #Python #dicts is interesting: https://tenthousandmeters.com/blog/python-behind-the-scenes-10-how-python-dictionaries-work/

For one, it reiterates the time complexity as O(1), but then you can see the graph where it doesn't follow theory when benchmarked.

The article explains why. CPU Caches.

But the underlying question is, should be considered O(1) if in practice doesn't follow it?

@nosherwan @xblasco This article for #Python #dicts is interesting: https://tenthousandmeters.com/blog/python-behind-the-scenes-10-how-python-dictionaries-work/

For one, it reiterates the time complexity as O(1), but then you can see the graph where it doesn't follow theory when benchmarked.

The article explains why. CPU Caches.

But the underlying question is, should be considered O(1) if in practice doesn't follow it?

@nosherwan @xblasco This article for #Python #dicts is interesting: https://tenthousandmeters.com/blog/python-behind-the-scenes-10-how-python-dictionaries-work/

For one, it reiterates the time complexity as O(1), but then you can see the graph where it doesn't follow theory when benchmarked.

The article explains why. CPU Caches.

But the underlying question is, should be considered O(1) if in practice doesn't follow it?

@[email protected] @xblasco This article for #Python #dicts is interesting: https://tenthousandmeters.com/blog/python-behind-the-scenes-10-how-python-dictionaries-work/

For one, it reiterates the time complexity as O(1), but then you can see the graph where it doesn't follow theory when benchmarked.

The article explains why. CPU Caches.

But the underlying question is, should be considered O(1) if in practice doesn't follow it?