🔒 unzip bin int

[chilly socket]

I want to unzip this https://discord.com/channels/267624335836053506/1343487448604475473

I end up using the second to the last code suggested there so keep in mind the inverted order

[drowsy geyser]

@chilly socket

Python help channel opened

Remember to:

• Ask your Python question, not if you can ask or if there's an expert who can help.
• Show a code sample as text (rather than a screenshot) and the error message, if you've got one.
• Explain what you expect to happen and what actually happens.

:warning: Do not pip install anything that isn't related to your question, especially if asked to over DMs.

Closes after a period of inactivity, or when you send !close.

[chilly socket]

@languid jacinth have an idea how to reverse it ._.?

I use the exact code you show

[languid jacinth]

depends on how you want to do it

you can just reverse the bitset list

or write your own object that works like a reverse enumerate

[chilly socket]

wha

[burnt blade]

you need to know how many bitsets there were

[languid jacinth]

oh yeah that too. you could add some metadata at the front

like the first byte is how many bits are interleaved

[languid jacinth]

oh wait you can also just reverse a range and index that way

[burnt blade]

!e

def pack(bitsets: list[int]) -> int:
  width = max(bitsets).bit_length() or 1
  binaries = [f"{bitset:0{width}b}" for bitset in bitsets]
  return int(''.join(binary[idx] for idx in range(width) for binary in binaries), 2)

from math import ceil
def unpack(count: int, packed: int) -> list[int]:
  binary = bin(packed)[2:]
  width = ceil(len(binary) / count)
  binary = binary.zfill(width * count)
  return [int(''.join(
    binary[(bit_idx * count) + bitset_idx]
    for bit_idx in range(width) 
  ), 2) for bitset_idx in range(count)]

from random import randint
for count in range(2, 10):
  for _ in range(100):
    bitsets = [randint(0, 2**randint(0, 16)) for _ in range(count)]
    packed = pack(bitsets)
    unpacked = unpack(count, packed)
    assert unpacked == bitsets 

binary math fans vs string enjoyers

[drowsy geyser]

:warning: Your 3.12 eval job has completed with return code 0.

[No output]

[languid jacinth]

strings are slower

[burnt blade]

dont care + developed faster + ratio + python slow
-# /hj

[languid jacinth]

[drowsy geyser]

Python help channel closed for inactivity

This help channel has been closed. Feel free to create a new post in #1035199133436354600. To maximize your chances of getting a response, check out this guide on asking good questions.