Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.lang.python > #29489 > unrolled thread

Re: A little morning puzzle

Started byDwight Hutto <dwightdhutto@gmail.com>
First post2012-09-19 08:22 -0400
Last post2012-09-19 08:22 -0400
Articles 1 — 1 participant

Back to article view | Back to comp.lang.python

This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by below is the oldest one visible, not the original post.


Contents

  Re: A little morning puzzle Dwight Hutto <dwightdhutto@gmail.com> - 2012-09-19 08:22 -0400

#29489 — Re: A little morning puzzle

FromDwight Hutto <dwightdhutto@gmail.com>
Date2012-09-19 08:22 -0400
SubjectRe: A little morning puzzle
Message-ID<mailman.915.1348057739.27098.python-list@python.org>
On Wed, Sep 19, 2012 at 8:01 AM, Dwight Hutto <dwightdhutto@gmail.com> wrote:
>> I have a list of dictionaries.  They all have the same keys.  I want to find the
>> set of keys where all the dictionaries have the same values.  Suggestions?
>
This one is better:


a = {}
a['dict'] = 1

b = {}
b['dict'] = 2

c = {}
c['dict'] = 1

d = {}
d['dict'] = 3

e = {}
e['dict'] = 1


x = [a,b,c,d,e]
count = 0
collection_count = 0
search_variable = 1
for dict_key_search in x:
	if dict_key_search['dict'] == search_variable:
		print "Match count found: #%i = %i" % (count,search_variable)
		collection_count += 1
	count += 1
print collection_count

-- 
Best Regards,
David Hutto
CEO: http://www.hitwebdevelopment.com

[toc] | [standalone]


Back to top | Article view | comp.lang.python


csiph-web