A hard exercise to help build the right mental model for Python data.
- Solution: https://memory-graph.com/#codeurl=https%3A%2F%2Fraw.githubusercontent.com%2Fbterwijn%2Fmemory_graph_videos%2Frefs%2Fheads%2Fmain%2Fexercises%2Fexercise26.py&play=
- Explanation: https://github.com/bterwijn/memory_graph?tab=readme-ov-file#python-data-model
The “Solution” link visualizes execution and reveals what’s actually happening using 𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵: https://github.com/bterwijn/memory_graph
Nice puzzle and tool. I picked the right answer but I wasn’t overly confident.
You could list
{1: [100]}as another possible answer, if you assume:spoiler
b |= {...}is equivalent tob = b | {...}, but you also realise the lists are never deep-cloned.Thanks, maybe I should have added that possible answer instead of ‘D’, adding one more feels too many.
First link is broken, second doesn’t lead to what’s claimed.
Can you tell me what the problem is for you when you click the first link? I tried to make it work for all browsers (even mobile, but the UI isn’t very mobile friendly), so I would like to get it working on your system too. If you can give me a bug report (and maybe try from different system), that would be great.
The second link explains:
- mutability: https://github.com/bterwijn/memory_graph#mutable-type
- shallow copy: https://github.com/bterwijn/memory_graph#copying-values-of-mutable-type
- difference between
x += yandx = x + y: https://github.com/bterwijn/memory_graph#name-rebinding
It’s left to the reader to generalize this to
x |= yvsx = x | y.
Diagnostics came up with some “double percent-encoding” issue on IOS. I’ve updated the website with a workaround, hopefully it does work now. Thanks for bug reporting.
Not too familiar with the union operator for dicts, but that result was not what I expected.
The dict union operator is similar to that of set, but in addition the right operand overwrites values of keys of the left operand. It’s a nice operator once you get used to it.
Easy to make a mistake with this exercise:
- first realize
b = b | {3: []}makes a shallow copy - then realize the shallow copy still references the value of key
2inaso we can still append to that and changea
- first realize

