Change elements of array based on position of input data

[Cola_Reb]

Hey everyone, hope you are doing great these days. I have a difficult problem with my data processing and hope you could help me:

I have some input data of the following form: Number of entries to come, Entries...

Example:

(...)

4 1 3 4 5

2 2 5

1 6

(...)

At the same time I have an array with only zero/false entries and now I always need a true/1 entry at the position corresponding to the entries of the first array. Example:

array([[True, False, True, True, True, False],

[False, True, False, False, True, False],

[False, False, False, False, False, True]])

Is there a smooth way to iterate over my input data and add a True/1 to the second array at the corresponding position in the array below?

[ibreeden]

That is easy.
From your examples I guess it is all about the numbers 1 to 6. Is it a dice-game? The easyest way is as follows.

1. Let's call your input string "input_string". Turn it to a list with split. (input_list = input_string.split())
   
2. Create a list of 6 booleans, initial False. (boolean_list = [False] * (6+1). "+ 1" is because lists count from 0 and you count from 1. The zeroth item will be unused. That is a cosmetic flaw. We can discard it later.)
   
3. Iterate over the input_list but make a slice of it to start with item 1. (for input_item in input_list[1:]:)
   
4. Set the corresponding item in boolean_list to True. (boolean_list[int(input_item)] = True])
   
5. Append the resulting boolean list to your array. Make a slice of it to discard the zeroth item. (boolean_list[1:])
   

Try to write the code for this and please let us know if it works.

[deanhystad]

def bit_flags(bits, on=True, off=False):
    return [on if bit in bits else off for bit in range(1, max(bits)+1)]


bits = list(map(int, input("Enter values preceeded by count: ").split()))
print(bits[1:], bit_flags(bits[1:]))
print(bits[1:], bit_flags(bits[1:], 1, 0))

Output:
>>> 4 1 3 4 5
[1, 3, 4, 5] [True, False, True, True, True]
[1, 3, 4, 5] [1, 0, 1, 1, 1]
>>> 1 6
[6] [False, False, False, False, False, True]
[6] [0, 0, 0, 0, 0, 1]

[Cola_Reb]

That is easy.
From your examples I guess it is all about the numbers 1 to 6. Is it a dice-game? The easyest way is as follows.

Thank you very much for your solution approach! Unfortunately it is not a dice game but a little more complex dataset with up to 3000 values but for my example I wanted to keep it as simple as possible.

1. Let's call your input string "input_string". Turn it to a list with split. (input_list = input_string.split())
   
2. Create a list of 6 booleans, initial False. (boolean_list = [False] * (6+1). "+ 1" is because lists count from 0 and you count from 1. The zeroth item will be unused. That is a cosmetic flaw. We can discard it later.)
   
3. Iterate over the input_list but make a slice of it to start with item 1. (for input_item in input_list[1:]:)
   
4. Set the corresponding item in boolean_list to True. (boolean_list[int(input_item)] = True])
   
5. Append the resulting boolean list to your array. Make a slice of it to discard the zeroth item. (boolean_list[1:])
   

The method basically works for me . In the end, however, I get a long list of true/false entries. The problem is that I didn't explain very well what my input data looks like: I'm reading a *.txt file where each line should be a separate element in the boolean array at the end:

with open("input.txt", "r") as f:
data = f.readlines()

data= [' Headline \n',
' 4 1 3 4 5 \n',
' 2 2 5 \n',
' 1 6 \n',
....]

So basically I need to differentiate between the rows in the input data in a way that they could be found in the results separately:

array([[ True, False, True, True, True, False],

[False, True, False, False, True[/color], False],

[False, False, False, False, False, True]])

[Cola_Reb]

def bit_flags(bits, on=True, off=False):
    return [on if bit in bits else off for bit in range(1, max(bits)+1)]


bits = list(map(int, input("Enter values preceeded by count: ").split()))
print(bits[1:], bit_flags(bits[1:]))
print(bits[1:], bit_flags(bits[1:], 1, 0))

Output:
>>> 4 1 3 4 5
[1, 3, 4, 5] [True, False, True, True, True]
[1, 3, 4, 5] [1, 0, 1, 1, 1]
>>> 1 6

[6] [False, False, False, False, False, True]
[6] [0, 0, 0, 0, 0, 1]

Thank you, quite an elegant solution. My only problem is that I have to read in multiple inputs at once like:

data= [
4 1 3 4 5
2 2 5
1 6
....]

Is there a way to get this in an easy way?

array([[ True, False, True, True, True, False],

[False, True, False, False, True[/color], False],

[False, False, False, False, False, True]])

Thank you again!

[deanhystad]

So what does your file look like? You've posted two very different formats.

I made a file that looks like this
data.txt

Output:
data= [
4 1 3 4 5
2 2 5
1 6
]

And processed it using this code.

def bit_flags(bits, on=True, off=False):
    return [on if bit in bits else off for bit in range(1, max(bits)+1)]

with open("data.txt", "r") as file:
    next(file)  # Skip data[
    for line in file:
        if len(line) > 1:  # Skip ]
            numbers = list(map(int, line.split()))
            print(numbers, bit_flags(numbers[1:]))

Output:
[4, 1, 3, 4, 5] [True, False, True, True, True]
[2, 2, 5] [False, True, False, False, True]
[1, 6] [False, False, False, False, False, True]

[Cola_Reb]

Ah now I got it. Thanks!