Imo, this is the coolest addition to python since acyncio:
Leo issue
#2541provides support for the required new ast parse-tree nodes.
I'm still trying to get my head around the "declarative" style of
pattern matching. It might be possible to improve Leo's fast-read
algorithm using this feature.
It
is possible to (conditionally) use the match statement in Leo's code. The trick would be to put the new code in a separate file, say
leoPython3.10.py. To use the new code, you would try to import functions from this file, falling back to legacy code if the import failed.
Edward