Notice: While JavaScript is not essential for this website, your interaction with the content will be limited. Please turn JavaScript on for the full experience.
Location: Austin, Texas United States
Scale the backend for the AI that will edit all real estate photos on the internet. Lead a team of junior developers building AI editing models, new features, and a fast backend architecture. We intend to 5X our daily photo editing volume in the coming months while decreasing the average …
...algorithms in a simple and safe way to others, you can argue that providing a scripting language is not worth the effort. However, if you do have that need, as we did, scripting is a no brainer, and it makes complete sense to use a powerful, documented, cross-platform standard such as Python." -- Mustafa Thamer of Firaxis Games, talking about Civilization IV. Quoted on page 18 of the August 2005 Game Developer Magazine. "Python, like many good technologies, soon spreads virally thro...
...sort() implementation - this one is a "stable sort" (equal inputs appear in the same order in the output) and faster than before. Tim Peters also changed long int multiplication to use the Karatsuba algorithm, based on a patch by Christopher A. Craig. This speeds up multiplication of very long ints.
...algorithm that's currently implemented, but its description of the algorithm is pretty hard to grasp - I had originally documented a different, naive, algorithm and didn't even realize that it didn't always compute the same MRO until Tim Peters found a counterexample. More recently, Samuele Pedroni has found a counterexample showing that the naive algorithm fails to maintain monotonicity, so I won't even describe it any more. Samuele has convinced me to use a newer MRO algorithm named ...
...Sorting Dictionaries by Value - Griffin This is a small idea that's very important to its proposer, but that IMO attempts to solve a problem that is better solved in some other way, e.g. by teaching newbies the correct algorithm/idiom. I note that the PEP uses sloppy language, e.g. it talks about "sorting a dictionary" while the dictionary itself is never sorted -- the PEP only proposes methods that return the items or keys in sorted order. The PEP also suffers from lack of definiten...
...sort order. We figure that you know more about your project than we do, so we give you a set of very flexible tools to mold our software around your project, instead of vice-versa. Background Christian Simms, Botonomy co-founder, and I had worked together for several years, and we used Python for utility-type tasks in larger J2EE projects. We had talked informally a couple of times about building some kind of software product or service. I had just wrapped up a project where the client had no ...
...sorted() builtin function that returns a new sorted list from any iterable. CObjects are now mutable (on the C level) through PyCObject_SetVoidPtr. list.sort() now supports three keyword arguments: cmp, key, and reverse. The key argument can be a function of one argument that extracts a comparison key from the original record: mylist.sort(key=str.lower). The reverse argument is a boolean value and if True will change the sort order as if the comparison arguments were reversed. In addition, th...
...algorithm that's currently implemented, but its description of the algorithm is pretty hard to grasp - I didn't even realize that the algorithm above doesn't always compute the same MRO until Tim Peters found a counterexample. Fortunately, counterexamples can only occur when there are order disagreements in the inheritance graph. The book outlaws classes containing such order disagreements, if the order disagreement is "serious". An order disagreement between two classes is serious wh...
...sort() has a new implementation. While cross-platform results may vary, and in data-dependent ways, this is much faster on many kinds of partially ordered lists than the previous implementation, and reported to be just as fast on randomly ordered lists on several major platforms. This sort is also stable (if A==B and A precedes B in the list at the start, A precedes B after the sort too), although the language definition does not guarantee stability. A potential drawback is that list.sort() m...
...sorts. Some examples of such projects are Project Oxygen at MIT [Dertouzos], Portolano/Workscape at Xerox PARC and the University of Washington [Portolano], and Invisible Computing at CMU. We expect that the main benefit for us of such cooperation will be early deployment of our technology in advanced systems, while their benefit will be improved end user programmability of the systems they are developing. Note that the timing is excellent here: widespread deployment of the personal, embe...
If you didn't find what you need, try your search in the Python language documentation.