python Programming Glossary: raymond
Python string 'join' is faster(?) than '+', but what's wrong here? http://stackoverflow.com/questions/1349311/python-string-join-is-faster-than-but-whats-wrong-here and least can afford you. But for you Armin Rigo and Raymond Hettinger the last two dear personal friends of mine BTW not..
Understanding performance difference http://stackoverflow.com/questions/17640235/understanding-performance-difference slower. Why is that I recently watched this video where Raymond Hettinger says that Python tends to reuse tuples so no extra..
C-like structures in Python http://stackoverflow.com/questions/35988/c-like-structures-in-python share improve this question For a whole solution see Raymond Hettinger's named tuple recipe. It's nice for your basic example..
how do i rewrite this function to implement OrderedDict? http://stackoverflow.com/questions/4126348/how-do-i-rewrite-this-function-to-implement-ordereddict which was introduced in v2.5 you may be able use Raymond Hettinger's Ordered Dictionary for Py2.4 ActiveState recipe..
Handling subprocess crash in Windows http://stackoverflow.com/questions/5069224/handling-subprocess-crash-in-windows # How to suppress crash notification dialog Jan 14 2004 # Raymond Chen's response 1 import ctypes SEM_NOGPFAULTERRORBOX 0x0002..
Letter frequency in python http://stackoverflow.com/questions/5148903/letter-frequency-in-python '' keep None # Python Cookbook Recipe 1.9 # Chris Perkins Raymond Hettinger if len to 1 to to len frm trans string.maketrans frm..
Why does Python's itertools.permutations contain duplicates? (When the original list has duplicates) http://stackoverflow.com/questions/6534430/why-does-pythons-itertools-permutations-contain-duplicates-when-the-original I can't speak for the designer of itertools.permutations Raymond Hettinger but it seems to me that there are a couple of points..
What is the best ordered dict implementation in python? http://stackoverflow.com/questions/719744/what-is-the-best-ordered-dict-implementation-in-python share improve this question This one by Raymond Hettinger is a drop in substitute for the collections.OrderedDict..
Intersection complexity http://stackoverflow.com/questions/8102478/intersection-complexity Average O min len s len t Worst case O len s len t EDIT As Raymond points out below the worst case scenario isn't likely to occur...
How can I find the missing value more concisely? http://stackoverflow.com/questions/8792440/how-can-i-find-the-missing-value-more-concisely element which is returned by pop . Edit As suggested by Raymond Hettinger in the comments you could also use tuple unpacking..
|