The Mental Game of Python - Raymond Hettinger [synced version]

All credit goes to SF Python: / @sfpython
Timestamps (credit: Станислав Купряхин):
00:00 Intro
02:47 Overview of strategies
05:41 Strategy: Chunking and Aliasing
09:36 Example: Random module
22:05 Strategy: Solve a related but simpler problem
23:09 "The Feynman Algorithm"
35:58 Strategy: Build classes independently and let inheritance discover itself
47:32 Strategy: Repeat tasks manually until patterns emerge, then move to a function
1:04:15 Strategy: Consider object oriented programming as a graph traversal problem
Video synced using Blender.
Original video: • The Mental Game of Pyt...
Original Description:
This talk was presented at PyBay2019 - 4th annual Bay Area Regional Python conference. See pybay.com for more details about PyBay and click SHOW MORE for more information about this talk.
Description
or "Strategies learned from coaching, teaching, and StackOverflow"
If you work with thousands of developers, ranging from the experienced to the aspirational, you can see what patterns of thought seem to confer success. Raymond shares what he’s seen that works best for developing problem solving skills, learning how to learn, how to get unstuck, and reliable strategies for managing complexity.
The talk includes live coding examples to make these ideas concrete.
About the speaker
Python core developer. Certified Public Accountant. Freelance programmer/consultant/trainer. Husband to Rachel. Father to Matthew.
Sponsor Acknowledgement
This and other PyBay2019 videos are via the help of our media partner AlphaVoice (www.alphavoice.io/)!

[@josh8778leong]

Thanks for the work of syncing

[@csmole1231]

didn't expect 5 sec of sync would be this helpful! thx a lot!
my tiny brain now work just fine!

[@TheDekeyras]

I almost gave up on the original video but decided to scroll to the comments to see if it was just me... lo and behold your video was linked. Thanks for the effort

[@techma82]

I'm glad you found it useful!

[@godfather7339]

@@techma82 massive respect.

[@godfather7339]

btw, you could have used something to download the video, and then used a player like vlc to shift the audio.

[@Diachron]

Thank you for taking the time to fix this. Well worth the effort to salvage a great talk.

[@akbarghurbal]

Please TH-cam Algorithm, recommends more videos like this one.

[@techma82]

Thank you for your kind words! Though all credit goes to the original creators, I just synced it.

[@keshavnemeli]

Thank God I found this after I watched only 15 min of the original.

[@joseville]

Nice! Not only did you sync! But you also added timecodes. Thanks so much!

[@jocketf3083]

Awesome work! Thank You!!

[@juanignaciosanchez2202]

Thanks!!!!! really appreciate the sync work!

[@tommckeesick781]

Massive legend! I was going to do this myself it was driving me crazy, thanks for putting in the effort! Fixes an awesome talk

[@fanu4059]

Thank You Tech Ma

[@locanix]

Thanks a lot bro!

[@bekabest]

Thanks!

[@apdy27]

thank you so much! you are a hero!

[@Asdayasman]

People like you are absolute kings. AV desync is so annoying and SO prevalent.

[@Savukala]

Thank you my kind sir!

[@wlgrd7052]

Thank you

[@andreienache6290]

👏🏻👏🏻👏🏻👏🏻👏🏻 how helpful this man is ..

[@michalwasaznik143]

I'm so glad I clicked on this.

[@JimmCracker]

When he talked about being able to do post mortems on code, fix it, and have code continue where it left off, he basically described the condition system in Common Lisp

[@andreienache6290]

Anyone could place a big comment on the last part, object oriented as graph traversal ? I understood it well but I’d love to hear someone else consideration. Thanks 🙏🏻

[@brucebenik2]

20:51 what is the k=10. I can't reproduce his results for this instance.

[@geurgeury]

k=10 is the number of choices you want
the "choices" function is only available in python 3, sound like you might be using python 2

[@joseville]

Just making a note here:
0:00 -- Overview - Ten Strategies that Work!
5:40 -- Strategy 1: Chunking and Aliasing (manage cognitive load and reduce complexity)
22:08 -- Solve a related but simpler problem / Incremental Development -- Apply Feynman problem solving method: 1. Write down a clear problem spec. 2. Think very hard. 3. Write down the solution.
"The computer gives us words that does things. SWEs make new words that make computers easier to use" lol

[@vwwvwwwvwwwvwwvvwwvw]

Around 1:03:50, I think the speaker could have redefined the root element using the refactored code like this: root = add_element(None, 'contact_list', status=..., company=...)
Otherwise, the line "if parent is not None" is unnecessary.

[@robertkelleher1850]

You are correct. He said it, he just didn't do it. He said "It generalizes to this one" and pointed to the root. He just didn't finish rewriting the code there.
I think he noticed he was running out of time.

[@vwwvwwwvwwwvwwvvwwvw]

The proposed solution in the Tree Walker example (around 23:00) is the function path_to(target, node) but path_to does not fully address the problem specification!
The problem states: "Given a target find the path to it, starting with any node in a tree." The function path_to will only solve those problems when a target exists further down the tree than the given node; otherwise, path_to will not find the target!
I propose changing the problem specification to "Given a target and a json document given as a Python object, find the path to it."

[@sasucarefree4694]

Luke Skywalker can code???😵😀

[@futurepython6774]

python/django/mysql新教程：
python基础：th-cam.com/video/g6RnSRDjd5M/w-d-xo.html