Комментарии:
Do you have a link to the code you did just so I can keep it for copy/pasting in the future as I try it out?
ОтветитьDownvoted for spending so much time writing code that hasn't nothing to do with match case.
ОтветитьPitty they did not use case else rather than case _ for catch all.
ОтветитьThank you for this awesome video, it's very well explained. I also learned about reading and writing files in chunks, didn't know that was a possibility.
Ответитьis this jupyterlab? thanks
Ответитьwhy the fuck didn't they call it switch ffs.
ОтветитьGreat content, just a comment to help the algorithm to push your content, you deserve it :)
ОтветитьThanks you too much
ОтветитьGreat content!
ОтветитьAwesome example, thank you
ОтветитьThe last part is the most interesting part. The direct comparison of the two different implementations show the benefit of structural pattern matching very good.
ОтветитьI have not yet watch it in total, but it seem that can we use it to replace if-else statement.
ОтветитьFrom a non-compsci background, what is the difference between this and just re-creating the functionality using a dictionary?
I.e. the dictionary is used to determine case and can be used to point to a function or value.
Cool content, thanks a lot!
ОтветитьI wonder how much Rust influenced the decision to add the match statement.
ОтветитьExcited for match case in python.
ОтветитьThanks for great tutorial! In the final example, you check for answers longer than 0 does that happen implicitly in the match code as well?
ОтветитьDoes anyone know how much faster this is than doing if / elif trees?
Ответитьi think the part between 5-15 minutes could have been more concise/pre-coded and quickly explained
otherwise amazing video! many people think its just a switch-case, but no it can be used that way, but it has none of the speed advantages of switch case in C++ for example
but the matching, oh god the matching is so powerful!