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


Groups > comp.lang.python > #29489

Re: A little morning puzzle

References <k3c9jb$2gr$1@ger.gmane.org> <CA+vVgJXh2PyeAT5LdWD6twijHPhmAoL9UPJxj+QJXvmey-WAgQ@mail.gmail.com>
Date 2012-09-19 08:22 -0400
Subject Re: A little morning puzzle
From Dwight Hutto <dwightdhutto@gmail.com>
Newsgroups comp.lang.python
Message-ID <mailman.915.1348057739.27098.python-list@python.org> (permalink)

Show all headers | View raw


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

Back to comp.lang.python | Previous | Next | Find similar | Unroll thread


Thread

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

csiph-web