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

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

Re: A little morning puzzle

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:01 -0400

#29483 — Re: A little morning puzzle

> 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?

Here is my solution:


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]
collection_count = 0

for dict_key_search in x:
	if dict_key_search['dict'] == 1:
		collection_count += 1
		print dict_key_search['dict']


Might be better ones though.


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

[toc] | [standalone]

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

csiph-web