Watching a counter, tally total and counting missed counts - python
I am attempting to create a piece of code that will watch a counter with an output something like:
a1 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30]
I want the code to be able to tally the total and tell me how many counts are missed for example if this happened:
a1 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24, 25, 26, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,1,2]
I would get a total of 92 still, but get feedback that 8 are missing.
I have gotten very close with the following code:
Blk_Tot = 0
CBN = 0
LBN = 0
x = 0
y = 0
z = 0
MissedBlocks = 0
for i in range(len(a1)):
CBN = a1[i]
if CBN - LBN <= 0:
if LBN == 30:
y = 30 - abs(CBN - LBN)
elif LBN < 30:
z = 30 - LBN
y = 30 - abs(CBN - LBN) + z
print(z)
Blk_Tot = Blk_Tot + y
else:
x = CBN - LBN
Blk_Tot = Blk_Tot + x
if x > 1:
MissedBlocks = MissedBlocks - 1 + x
LBN = CBN
print(Blk_Tot)
print(MissedBlocks)
If I delete anywhere between 1 and 30 it works perfectly, however if I delete across 30, say 29,30,1,2 it breaks.I don't expect it to be able to miss 30 in a row and still be able to come up with a proper total however.
Anyone have any ideas on how this might be achieved? I feel like I am missing an obvious answer :D
Sorry I think I was unclear, a1 is a counter coming from an external device that counts from 1 to 30 and then wraps around to 1 again. Each count is actually part of a message to show that the message was received; so say 1 2 4, I know that the 3rd message is missing. What I am trying to do is found out the total that should have been recieved and how many are missing from the count.
Update after an idea from the posts below, another method of doing this maybe:
Input:
123456
List[1,2,3,4,5,6]
1.Check first input to see which part of the list it is in and start from there (in case we don't start from zero)
2.every time an input is received check if that matches the next value in the array
3.if not then how many steps does it take to find that value
You don't need to keep track if you past the 30 line.
Just compare with the ideal sequence and count the missing numbers.
No knowledge if parts missing at the end.
No knowledge if more than 30 parts are missing in a block.
from itertools import cycle
def idealSeqGen():
for i in cycle(range(1,31)):
yield(i)
def receivedSeqGen():
a1 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,
5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,
1,2]
for i in a1:
yield(i)
receivedSeq = receivedSeqGen()
idealSeq = idealSeqGen()
missing = 0
ideal = next(idealSeq)
try:
while True:
received = next(receivedSeq)
while received != ideal:
missing += 1
ideal = next(idealSeq)
ideal = next(idealSeq)
except StopIteration:
pass
print (f'There are {missing} items missing')
Edit
The loop part can be a little bit simpler
missing = 0
try:
while True:
ideal = next(idealSeq)
received = next(receivedSeq)
while received != ideal:
missing += 1
ideal = next(idealSeq)
except StopIteration:
pass
print (f'There are {missing} items missing')
In general, if you want to count the number of differences between two lists, you can easily use a dictionary. The other answer would also work, but it is highly inefficient for even slightly larger lists.
def counter(lst):
# create a dictionary with count of each element
d = {}
for i in lst:
if d.get(i, None):
d[i] += 1
else:
d[i] = 1
return d
def compare(d1, d2):
# d1 and d2 are dictionaries
ans = 0
for i in d1.values():
if d2.get(i, None):
# comapares the common values in both lists
ans += abs(d1[i]-d2[i])
d2[i] = 0
else:
#for elements only in the first list
ans += d1[i]
for i in d2.values():
# for elements only in the second list
if d2[i]>0:
ans += d2[i]
return ans
l1 = [...]
l2 = [...]
print(compare(counter(l1), counter(l2)))
New code to check for missing elements from a repeating sequence pattern
Now that I have understood your question more clearly, here's the code. The assumption in this code is the list will always be in ascending order from 1 thru 30 and then repeats again from 1. There can be missing elements between 1 and 30 but the order will always be in ascending order between 1 and 30.
If the source data is as shown in list a1, then the code will result in 8 missing elements.
a1 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,
5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,
1,2]
a2 = a1.copy()
c = 1
missing = 0
while a2:
if a2[0] == c:
c+=1
a2.pop(0)
elif a2[0] > c:
missing +=1
c+=1
elif a2[0] < c:
missing += 31-c
c = 1
if c == 31: c=1
print (f'There are {missing} items missing in the list')
The output of this will be:
There are 8 items missing in the list
Let me know if this addresses your question
earlier code to compare two lists
You cannot use set as the items are repeated. So you need to sort them and find out how many times each element is in both lists. The difference will give you the missing counts. You may have an element in a1 but not in a2 or vice versa. So finding out the absolute count of missing items will give you the results.
I will update the response with better variables in my next update.
Here's how I did it:
code with comments:
a1 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30]
a2 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,
5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,1,2]
#step 1: Find out which list is longer. We will use that as the master list
if len(a1) > len(a2):
master_list = a1.copy()
second_list = a2.copy()
else:
master_list = a2.copy()
second_list = a1.copy()
#step 2: We must sort both master and second list
# so we can compare against each other
master_list.sort()
second_list.sort()
#set the counter to zero
missing = 0
#iterate through the master list and find all values in master against second list
#for each iteration, remove the value in master[0] from both master and second list
#when you have iterated through the full list, you will get an empty master_list
#this will help you to use while statement to iterate until master_list is empty
while master_list:
#pick the first element of master list to search for
x = master_list[0]
#count the number of times master_list[0] is found in both master and second list
a_count = master_list.count(x)
b_count = second_list.count(x)
#absolute difference of both gives you how many are missing from each other
#master may have 4 occurrences and second may have 2 occurrences. abs diff is 2
#master may have 2 occurrences and second may have 5 occurrences. abs diff is 3
missing += abs(a_count - b_count)
#now remove all occurrences of master_list[0] from both master and second list
master_list = [i for i in master_list if i != x]
second_list = [i for i in second_list if i != x]
#iterate until master_list is empty
#you may end up with a few items in second_list that are not found in master list
#add them to the missing items list
#thats your absolute total of all missing items between lists a1 and a2
#if you want to know the difference between the bigger list and shorter one,
#then don't add the missing items from second list
missing += len(second_list)
#now print the count of missig elements between the two lists
print ('Total number of missing elements are:', missing)
The output from this is:
Total number of missing elements are: 7
If you want to find out which elements are missing, then you need to add a few more lines of code.
In the above example, elements 27,28,29,30, 4, 5 are missing from a2 and 31 from a1. So total number of missing elements is 7.
code without comments:
a1 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30]
a2 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,
5, 6, 7, 8, 9, 10, 11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,1,2]
if len(a1) > len(a2):
master_list = a1.copy()
second_list = a2.copy()
else:
master_list = a2.copy()
second_list = a1.copy()
master_list.sort()
second_list.sort()
missing = 0
while master_list:
x = master_list[0]
a_count = master_list.count(x)
b_count = second_list.count(x)
missing += abs(a_count - b_count)
master_list = [i for i in master_list if i != x]
second_list = [i for i in second_list if i != x]
missing += len(second_list)
print ('Total number of missing elements are:', missing)
Related
Reversing array without reverse function but loop isn't working
So I am trying to reverse an array from a .txt file without using the reverse function. here is what I have. numbers = read() #creates numbers array out of the txt file numbersrev = numbers #blank array for reverse numLength = len(numbers) #measures the length of the array print(numbers) print("Array length of numbers: ", numLength) i = numLength i = i-1 #since the array starts at 0 instead of 1 k = 0 for k in range(8): numbersrev[k] = numbers[i] print ("The ", i," element of numbers is the ", k," element of numbersrev") i -= 1 k += 1 print(numbersrev) This is what I get after debugging on vscode: [2, 4, 9, 11, 8, 3, 2, 5, 10] Array length of numbers: 9 The 8 element of numbers is the 0 element of numbersrev The 7 element of numbers is the 1 element of numbersrev The 6 element of numbers is the 2 element of numbersrev The 5 element of numbers is the 3 element of numbersrev The 4 element of numbers is the 4 element of numbersrev The 3 element of numbers is the 5 element of numbersrev The 2 element of numbers is the 6 element of numbersrev The 1 element of numbers is the 7 element of numbersrev [10, 5, 2, 3, 8, 3, 2, 5, 10] The top array is the original and the bottom array is the supposed reversal array I cannot for the life of me find out why it stops changing the numbersrev array halfway through. Anybody know what the cause could be?
Okay, a few things... First for loops increment their variables automatically in python. so: for k in range(8): ... i -= 1 k += 1 should be: for k in range(8): ... i -= 1 No need to manually increment k. Next lists are NOT arrays. Lists in python are very different from arrays in a language like C. Lists are mutable, and are passed by reference by default. so when you try to make an empty array: numbersrev = numbers #blank array for reverse you are actually referencing the same 'list' from both numbers AND numbersrev What you should have done is numbersrev = [] Then in your for loop, simply append to numbersrev rather than assign. for k in range(numLength): numbersrev.append(numbers[i]) print ("The ", i," element of numbers is the ", k," element of numbersrev") i -= 1 Lastly you could/should reference the length of numbers rather than a hardcoded value in your for loop, but how you have it will still work (assuming you ONLY ever get 8 numbers) for k in range(numLength): ... All together numbers = read() #creates numbers array out of the txt file numbersrev = [] #blank array for reverse numLength = len(numbers) #measures the length of the array print(numbers) print("Array length of numbers: ", numLength) i = numLength i = i-1 #since the array starts at 0 instead of 1 for k in range(numLength): numbersrev.append(numbers[i]) print ("The ", i," element of numbers is the ", k," element of numbersrev") i -= 1 print(numbersrev)
numbersrev = numbers sets numbersrev to point to the same list as numbers, meaning when you modify numbers or numbersrev you're modifying the other at the same time. To make an actual copy of the object, you instead need to call numbersrev = numbers.copy(). Also, #sahasrara62's comment is correct, you need to call for k in range(numLength) instead of for k in range(8)
What you've done here is assign the reversed array as the normal array with this line: numbersrev = numbers #blank array for reverse What you're actually doing with that loop is this: numbers[0] = numbers[9] # [10, 2, 3, 4, 5, 6, 7, 8, 9, 10] numbers[1] = numbers[8] # [10, 9, 3, 4, 5, 6, 7, 8, 9, 10] numbers[2] = numbers[7] # [10, 9, 8, 4, 5, 6, 7, 8, 9, 10] numbers[3] = numbers[6] # [10, 9, 8, 7, 5, 6, 7, 8, 9, 10] numbers[4] = numbers[5] # [10, 9, 8, 7, 6, 6, 7, 8, 9, 10] numbers[5] = numbers[4] # [10, 9, 8, 7, 6, 6, 7, 8, 9, 10] numbers[6] = numbers[3] # [10, 9, 8, 7, 6, 6, 7, 8, 9, 10] numbers[7] = numbers[2] # [10, 9, 8, 7, 6, 6, 7, 8, 9, 10] numbers[8] = numbers[1] # [10, 9, 8, 7, 6, 6, 7, 8, 9, 10] numbers[9] = numbers[0] # [10, 9, 8, 7, 6, 6, 7, 8, 9, 10] ... If you assign the variable like this: numLength = len(numbers) #measures the length of the array numbersrev = [0]*numLength #blank array for reverse You'll get the correct answer since the reverse list is no longer pointing to the normal list.
the problem you are facing is because of this line numbersrev = numbers #blank array for reverse In this line you are not creating an empty array, you are saving the reference of numbers array in a new variable named numbersrev. This means that when you make an operation in array numbersrev you are changing also the values of numbers. To avoid this kind of problems you have two options: Make a copy of the array with slices In this way you copy the values of the array, not the reference of the array. This means the changes you make to the new array will not change the original array. numbersrev = numbers[:] Create an empty array and use append instead of assignation This change is a little different from what you did, but basically instead of creating a copy of the array, you create a new array which will be filled in the for loop, something like: numbers.rev = [] ... for k in range(8): numbersrev.append(numbers[i]) So with the first option and also changing some things in the k index we have a code like this: numbers = [2, 4, 9, 11, 8, 3, 2, 5, 10] # you can change for read numbersrev = numbers[:] #copy array elements numLength = len(numbers) #array length print(numbers) print("Array length of numbers: ", numLength) i = numLength - 1 # you don't need to initialize k because it's initialized and incremented with range in the loop for k in range(numLength): numbersrev[k] = numbers[i] print ("The ", i," element of numbers is the ", k," element of numbersrev") i -= 1 print(numbersrev) Hope this would help you solve the problem, just like a note you could solve this problem in many ways: slicing (numbers[::-1]), list comprehension and some others. All the ways are valid so just in case you want to explore more.
Add 1 for odd numbers on list Python
So this is my code: numbers = []#1 for i in range(10): i += 1 numbers.append(i) print (numbers) numbers2 = [n + 2 for n in numbers]#2 print (numbers2) numbers3 = []#3 for x in numbers2: if (x % 2 == 1) : x += 1 numbers3 = x print (numbers3) I'm using Google Colab and run those codes on 3 separate code cells(hashtag numbers comment). The #1 program output is [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]. And the #2 output is [3, 4, 5, 6, 7, 8, 9, 10, 11, 12]. So at #3 cell I want program to add 1 on each odd numbers in numbers2 list. The output I want is [4, 4, 6, 6, 8, 8, 10, 10, 12, 12]. But what I get is : 4 6 8 10 12 Also I'm trying to not use function(just for these codes). And for loop on #1 code I intend to do that. Additional question : Is it possible to modify elements on list without append the result to another list(like #2 code)? Like just add 2 on each numbers on list
Try the following: second_list = [3, 4, 5, 6, 7, 8, 9, 10, 11, 12] third_list = second_list for i in range(len(second_list)): if (second_list[i] % 2 == 1): make_even = second_list[i] + 1 third_list[i] = make_even else: third_list[i] = second_list[i] print (third_list) You'll have to tweak it for the Google Colab project you're doing, but the logic here should be right. Right now this answer works in regular Python 3.
your third cell should look like this, you were close to the solution all you need to do is to add x values in numbers3 list numbers3 = []#3 for x in numbers2: if (x % 2 == 1) : x += 1 numbers3.append(x) print(numbers3)
In order to fill the list instead of just printing the value you must use the append function instead of = numbers3 = x #becomes numbers3.append(x) To get the list in the format you want, you also have to drop the append out of the if statement, and drop the print out of the for loop, like so: numbers3 = []#3 for x in numbers2: if (x % 2 == 1) : x += 1 numbers3.append(x) # Here print (numbers3) # and here
Single line chunk re-assignment
As shown in the following code, I have a chunk list x and the full list h. I want to reassign back the values stored in x in the correct positions of h. index = 0 for t1 in range(lbp, ubp): h[4 + t1] = x[index] index = index + 1 Does anyone know how to write it in a single line/expression? Disclaimer: This is part of a bigger project and I simplified the questions as much as possible. You can expect the matrix sizes to be correct but if you think I am missing something please ask for it. For testing you can use the following variable values: h = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10] x = [20, 21] lbp = 2 ubp = 4
You can use slice assignment to expand on the left-hand side and assign your x list directly to the indices of h, e.g.: h = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10] x = [20, 21] lbp = 2 ubp = 4 h[4 + lbp:4 + ubp] = x # or better yet h[4 + lbp:4 + lbp + len(x)] = x print(h) # [1, 2, 3, 4, 5, 6, 20, 21, 9, 10] I'm not really sure why are you adding 4 to the indexes in your loop nor what lbp and ubp are supposed to mean, tho. Keep in mind that when you select a range like this, the list you're assigning to the range has to be of the same length as the range.
Edited aug 24 9pm - number game isn't working as I would like
I have a number guessing game working but I would like it to count without pick numbers without having them have any with a single increment. What I am trying to say is 2 4 17 27 not 2 3 4 17 27 I would like it to go through all the possibilities from low to high like it is, just not with any in a single increment IE 1 2 3 or 5 6. I would also like it to be able to do from 1 to 100 and the count length to go to 10. If I try and put anymore than 6 in it will not work. It gives me a result like this now Please enter the lower limit: 2 Please enter the upper limit: 9 Please enter the number of values in sequences: 6 Possible sequences. Spot the missing one! [2, 3, 4, 5, 6, 7] #I do not want it to have them all 1 digit up at a time [2, 3, 4, 5, 6, 8] #like this [2, 3, 4, 5, 6, 9] [2, 3, 4, 5, 7, 8] [2, 3, 4, 5, 7, 9] [2, 3, 4, 5, 8, 9] [2, 3, 4, 6, 7, 8] [2, 3, 4, 6, 7, 9] [2, 3, 4, 6, 8, 9] [2, 3, 4, 7, 8, 9] [2, 3, 5, 6, 7, 8] [2, 3, 5, 6, 7, 9] [2, 3, 5, 6, 8, 9] [2, 3, 5, 7, 8, 9] [2, 3, 6, 7, 8, 9] Please enter the lower limit: 2 Please enter the upper limit: 13 Please enter the number of values in sequences: 6 [2, 4, 6, 8, 10] #I would like it more like this [2, 4, 7, 9, 11] #so it go's through low to high but with out 1 digit [2, 5, 7, 9, 11] #increments [2, 5, 9, 11, 13] [2, 6, 9, 11, 13] [2, 7, 9, 11, 13,] If anyone has any suggestions please let me know. import itertools import random DEBUG = False ALLOWED_GUESSES = 3 def get_game_parameters(): while True: try: lower_limit = int(input("Please enter the lower limit: ")) upper_limit = int(input("Please enter the upper limit: ")) consecutive_length = int(input("Enter The Number Limit For Consecutive Increments: ")) if lower_limit > upper_limit: raise ValueError("Lower limit must not exceed upper limit") sequence_length = int(input("Please enter the number of values in sequences: ")) if upper_limit - lower_limit < sequence_length: raise ValueError("Difference in limits must be greater than sequence length") except ValueError as e: print("Invalid value entered:", e) continue else: sequence_range = range(lower_limit, upper_limit + 2) return sequence_range, sequence_length ###input ("Enter The Number Limit For Consecutive Increments: ") def prompt_user_to_guess(chosen_sequence, required_sequence_length): guesses_made = 0 while True: try: user_input = input( "Please enter your guess for the hidden sequence, " +\ "separating terms by commas (e.g. '1, 2, 3, 4'): ") guessed_sequence = [int(x) for x in user_input.split(",")] if len(guessed_sequence) != required_sequence_length: raise ValueError("Incorrect number of arguments") except ValueError as e: print("Invalid guess:", e) continue else: guesses_made += 1 if guessed_sequence == chosen_sequence: print("You guessed the correct sequence. Well done!") return elif guesses_made < ALLOWED_GUESSES: remaining_guesses = ALLOWED_GUESSES - guesses_made print("Incorrect guess! {} attempt(s) remaining.".format(remaining_guesses)) continue else: print("I'm sorry, you're out of guesses. The correct sequence was {}".format(chosen_sequence)) return def generate_possible_sequences(sequence_range, sequence_length): def is_monotonic_increasing(l): return all(x < y for x, y in zip(l, l[1:])) for permutation in itertools.permutations(sequence_range, sequence_length): if is_monotonic_increasing(permutation): yield list(permutation) def main(): sequence_range, sequence_length = get_game_parameters() possible_sequences = list(generate_possible_sequences(sequence_range, sequence_length)) chosen_sequence = possible_sequences.pop(random.randrange(len(possible_sequences))) assert chosen_sequence not in possible_sequences if DEBUG: print("\nChosen sequence: {}".format(chosen_sequence)) print("\nPossible sequences. Spot the missing one!\n") for sequence in possible_sequences: print(sequence) prompt_user_to_guess(chosen_sequence, sequence_length) if __name__ == '__main__': main()
I'm not clear on what exactly you are answering, and we need a better explanation of "it will not work". However, it looks like you generate far too many options in generate_possible_sequences() which probably results in either memory filling up or far too long an execution time. A better approach is to just shuffle numbers in range, then sort a sub-sequence, like so: sequence_range, sequence_length = get_game_parameters() vals = range(1, sequence_range + 1) random.shuffle(vals) chosen_sequence = sorted(vals[:sequence_length]) This will work almost instantly for sequence_range values well into the thousands, and you can step through it interactively to see how the code it working. However, for millions of elements (or just shorter code overall), the random.sample() function does what you want in just one line and without shuffling the complete list: sequence_range, sequence_length = get_game_parameters() chosen_sequence = sorted(random.sample(xrange(1, sequence_range + 1), sequence_length)) The xrange() here avoids creating an actual list in memory; this line gives an out of memory error: random.sample(range(1, 999999999), 4) This line works: random.sample(xrange(1, 999999999), 4) You probably also want: guessed_sequence.sort() This allows the user to input in any order.
Split list into dictionary
I am trying to split my list into a dictionary and I wrote a function for it. It takes in a list and gets the list length. If the length of the list is 253 , it creates a dictionary with 26 keys - this is calculated by rounding up the number to a higher 10 (250 will create 25 keys, 251-259 will create 26 keys). Each key will store a chuck of the original list (as of now I am storing 10 elements per list). I feel def limit_files(file_list, at_a_time=10): l = file_list n = len(l) d, r = divmod(n, at_a_time) num_keys = d + 1 if r else d slice = n // num_keys vals = (l[i:i+slice] for i in range(0, n, slice+1)) dct = dict(zip(range(1,num_keys+1),vals)) return (dct) I just wanted to know if there is way to improve the code
You can use itertools.izip_longest to group items in your list as equally divided chunks. import itertools def limit_files(file_list, at_a_time=10): d, r = divmod(len(file_list), at_a_time) num_keys = d + 1 if r > 0 else d chunks = itertools.izip_longest(*([iter(x)] * at_a_time)) return dict((x, y) for x, y in enumerate(chunks)) Note that, it will be padding with None values to fill out the last chunk. >>> limit_files([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]) {0: (1, 2, 3, 4, 5, 6, 7, 8, 9, 10), 1: (11, 12, None, None, None, None, None, None, None, None)} Alternatively, without using padding values, you can just iterate through the range and call itertools.islice until the iterator exhausts as follows: def limit_files(file_list, at_a_time=10): d, r = divmod(len(file_list), at_a_time) num_keys = d + 1 if r > 0 else d iterator = iter(file_list) dictionary = {} for chunk_id in xrange(num_keys): chunk = list(itertools.islice(iterator, at_a_time)) if not chunk: break dictionary[chunk_id] = chunk return dictionary >>> limit_files([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]) {0: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10], 1: [11, 12]}