Ad:

Python Discussion Thread
Marked Solved
Views: 744

Aug 26th, 2008

comparing lists

Expand Post »

Does any one know of any modules which could help me in comparing lists.

I have the following problem. There are lists with names and there are lists with associated weights. For example,

a = ['a', 'b', 'c', 'd']
w_a = [0.25, 0.25, 0.25, 0.25]

b = ['a', 'c']
w_b = [0.5, 0.5]

I need to write a function that will compare a and b and insert 0s into the appropriate positions within w_b.... i.e. the output should be a list [0.5, 0, 0.5, 0].

I have tried the following, but it goes into an endless loop!

python Syntax (Toggle Plain Text)
def comp_lists(list1, list2):
	length = max(len(list1), len(list2))
	i = 0
	while i < length:
		a = list1[i]
		b = list2[i]
		if a != b and min(a, b) != 0:
			break
		else:
			i = i + 1
	return i
 
def insert_zero_weight(share_list1, share_list2, w1, w2):
	W1 = list(w1)
	W2 = list(w2)
	if share_list1 == share_list2:
		return "List are equal"
	i = comp_lists(share_list1, share_list2)
	print i
	print max(len(share_list1), len(share_list2))
	print len(share_list1), len(share_list2)
	if i < max(len(share_list1), len(share_list2)) and len(share_list1) < len(share_list2):
		W1.insert(i, 0)
		return W1
	elif i < max(len(share_list1), len(share_list2)) and len(share_list1) > len(share_list2):
		W2.insert(i, 0)
		return W2
	else:
		return "Error"
 
def Insert_zero_weight(share_list1, share_list2, w1, w2):
	W1 = list(w1)
	W2 = list(w2)
	if W1 < W2:
		while W1 < W2:
			print 'in is %d long' %len(W1)
			W3 = insert_zero_weight(share_list1, share_list2, W1, W2)
			print 'out is %d long' %len(W3)
			del W1
			W1 = list(W3)
		return W1
	elif W1 > W2:
		while W2 < W1:
			print 'in is %d long' %len(W2)
			W3 = insert_zero_weight(share_list1, share_list2, W1, W2)
			print 'out is %d long' %len(W3)
			del W2
			W2 = list(W3)
		return W2
	else:
		return "Error"
def comp_lists(list1, list2):
	length = max(len(list1), len(list2))
	i = 0
	while i < length:
		a = list1[i]
		b = list2[i]
		if a != b and min(a, b) != 0:
			break
		else:
			i = i + 1
	return i
	
def insert_zero_weight(share_list1, share_list2, w1, w2):
	W1 = list(w1)
	W2 = list(w2)
	if share_list1 == share_list2:
		return "List are equal"
	i = comp_lists(share_list1, share_list2)
	print i
	print max(len(share_list1), len(share_list2))
	print len(share_list1), len(share_list2)
	if i < max(len(share_list1), len(share_list2)) and len(share_list1) < len(share_list2):
		W1.insert(i, 0)
		return W1
	elif i < max(len(share_list1), len(share_list2)) and len(share_list1) > len(share_list2):
		W2.insert(i, 0)
		return W2
	else:
		return "Error"

def Insert_zero_weight(share_list1, share_list2, w1, w2):
	W1 = list(w1)
	W2 = list(w2)
	if W1 < W2:
		while W1 < W2:
			print 'in is %d long' %len(W1)
			W3 = insert_zero_weight(share_list1, share_list2, W1, W2)
			print 'out is %d long' %len(W3)
			del W1
			W1 = list(W3)
		return W1
	elif W1 > W2:
		while W2 < W1:
			print 'in is %d long' %len(W2)
			W3 = insert_zero_weight(share_list1, share_list2, W1, W2)
			print 'out is %d long' %len(W3)
			del W2
			W2 = list(W3)
		return W2
	else:
		return "Error"

Where you would run

Python Syntax (Toggle Plain Text)

Insert_zero_weight(a, b, w_a, w_b)

.

Any help, whatsoever, would be appreciated.

Similar Threads

comparing elemets of arraylist in Java
Polynomials with linked lists in C++
Linked Lists Help C++ in C++
Comparing Python and C, Part 10, Structures in Python
Comparing a matrix(list[][]) ? in Python

sjvr767

Reputation Points: 10

Solved Threads: 1

Newbie Poster

Offline

7 posts
since Oct 2007

Permalink

Aug 26th, 2008

Re: comparing lists

At first blush i would say this might do:

python Syntax (Toggle Plain Text)
# compare these two list set and convert
# w_b into [0.5, 0, 0.5, 0]
 
a = ['a', 'b', 'c', 'd']
w_a = [0.25, 0.25, 0.25, 0.25]
 
b = ['a', 'c']
w_b = [0.5, 0.5]
 
 
for ix, aa in enumerate(a):
    if aa not in b:
        w_b.insert(ix, 0)
 
print w_b  # result --> [0.5, 0, 0.5, 0]
# compare these two list set and convert
# w_b into [0.5, 0, 0.5, 0]

a = ['a', 'b', 'c', 'd']
w_a = [0.25, 0.25, 0.25, 0.25]

b = ['a', 'c']
w_b = [0.5, 0.5]


for ix, aa in enumerate(a):
    if aa not in b:
        w_b.insert(ix, 0)
        
print w_b  # result --> [0.5, 0, 0.5, 0]

Also note that you can combine two related lists in one container:

python Syntax (Toggle Plain Text)
# combine two lists to show their relationship better
 
a = ['a', 'b', 'c', 'd']
w_a = [0.25, 0.25, 0.25, 0.25]
 
# list of (name, weight) tuples
print zip(a, w_a)  # [('a', 0.25), ('b', 0.25), ('c', 0.25), ('d', 0.25)]
 
# dictioary with name:weight pairs
print dict(zip(a, w_a)) # {'a': 0.25, 'c': 0.25, 'b': 0.25, 'd': 0.25}
# combine two lists to show their relationship better

a = ['a', 'b', 'c', 'd']
w_a = [0.25, 0.25, 0.25, 0.25]

# list of (name, weight) tuples
print zip(a, w_a)  # [('a', 0.25), ('b', 0.25), ('c', 0.25), ('d', 0.25)]

# dictioary with name:weight pairs
print dict(zip(a, w_a)) # {'a': 0.25, 'c': 0.25, 'b': 0.25, 'd': 0.25}

BTW, dictionaries are much faster way to look things up then indexing two separate related lists:

python Syntax (Toggle Plain Text)
a = ['a', 'b', 'c', 'd']
w_a = [0.25, 0.25, 0.25, 0.25]
 
b = ['a', 'c']
w_b = [0.5, 0.5]
 
dict_a = dict(zip(a, w_a))
dict_b = dict(zip(b, w_b))
 
for k, v in dict_a.items():
    if k not in dict_b.keys():
        dict_b[k] = 0
 
print dict_b  # {'a': 0.5, 'c': 0.5, 'b': 0, 'd': 0}
a = ['a', 'b', 'c', 'd']
w_a = [0.25, 0.25, 0.25, 0.25]

b = ['a', 'c']
w_b = [0.5, 0.5]

dict_a = dict(zip(a, w_a))
dict_b = dict(zip(b, w_b))

for k, v in dict_a.items():
    if k not in dict_b.keys():
        dict_b[k] = 0

print dict_b  # {'a': 0.5, 'c': 0.5, 'b': 0, 'd': 0}

Last edited by bumsfeld; Aug 26th, 2008 at 11:56 am.

bumsfeld

Reputation Points: 404

Solved Threads: 180

Nearly a Posting Virtuoso

Offline

1,422 posts
since Jul 2005

Permalink

Aug 27th, 2008

Re: comparing lists

Thank you! This works so well...

I am using your first snippet of code, the one using enumerate. While I realise that dictionary would be faster, lists fit in better with how the rest of the script is programmed....

Thank you again!

sjvr767

Reputation Points: 10

Solved Threads: 1

Newbie Poster

Offline

7 posts
since Oct 2007

This thread is solved

Either the thread starter or a moderator has marked this thread as solved. You can most likely trust the responses and answers given. There is most likely no reason for any further responses to be posted here. If you have a related question, please start a new thread in this forum instead.

This thread is more than three months old

No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.

Previous Thread in Python Forum Timeline: Do we have a tool which converts python files to java

Next Thread in Python Forum Timeline: tkinter

DaniWeb Message

Cancel Changes

User Name
Password