On Mon, 06 Dec 2004 13:08:15 -0800, Scott David Daniels
[EMAIL PROTECTED] wrote:
Zak Arntson wrote:
On Fri, 03 Dec 2004 14:48:30 -0800, Scott David Daniels
Most likely so. Possibly an equal amount of has work -- hash of a pair
is a function of hashes of the lelements, but fewer trips in and
Zak Arntson wrote:
On Mon, 06 Dec 2004 13:08:15 -0800, Scott David Daniels
[EMAIL PROTECTED] wrote:
Zak Arntson wrote:
On Fri, 03 Dec 2004 14:48:30 -0800, Scott David Daniels wrote:
...The real advantage is clarity: the inner dictionaries in a dict-of-dict
implementation have no real meaning. The
On Mon, 06 Dec 2004 14:11:04 -0800, Scott David Daniels wrote:
Second, I was referring to code like:
try:
inner = table[state]
except KeyError:
table[state] = inner = {}
inner[action] = whatever
vs. code like this:
table[state, action] =
I'm currently implementing a game GUI, where there are three
components to the screen: A battle, a command button area and a city
view area. Each of these are rectangular, and handle interactions in
different ways.
For example, on the battle frame you can select units, right-click
to deliver
