Explore >> Select a destination
|
You are here 
|
initialcommit.com | ||
| | | | |
akaptur.github.com
|
|
| | | | | Nick Coghlan added another interesting note in response to my last post about creating side-effecting assignments in python. Here's Nick: @ ... | |
| | | | |
www.nkantar.com
|
|
| | | | | A bit of nuance about dealing with null and missing values in Python dictionaries. | |
| | | | |
fuzzyblog.io
|
|
| | | | | [AI summary] The author discusses differences between Python and Ruby regarding dictionary key access and missing keys, highlighting cultural design philosophies and the Pythonic .get() method. | |
| | | | |
pbrisbin.com
|
|
| | | While reading Understanding Computation again last night, I was going back through the chapter where Tom Stuart describes deterministic and non-deterministic finite automata. These simple state machines seem like little more than a teaching tool, but he eventually uses them as the implementation for a regular expression matcher. I thought seeing this concrete use for such an abstract idea was interesting and wanted to re-enforce the ideas by implementing such a system myself - with Haskell, of course. | ||
