Skip Navigation

InitialsDiceBearhttps://github.com/dicebear/dicebearhttps://creativecommons.org/publicdomain/zero/1.0/„Initials” (https://github.com/dicebear/dicebear) by „DiceBear”, licensed under „CC0 1.0” (https://creativecommons.org/publicdomain/zero/1.0/)S
Posts
16
Comments
44
Joined
3 yr. ago

  • Did you figure out if a bug report was created?

  • Might be the one with the stroller.

  • [Meta] !movies@lemmy.world mod removing comment suggesting consolidation of that community with this one as their moderation community is spread too thin, thankfully modlog is public

    Jump
  • That's fair. So no one wants to close their community, let's just move on then.

  • [Meta] !movies@lemmy.world mod removing comment suggesting consolidation of that community with this one as their moderation community is spread too thin, thankfully modlog is public

    Jump
  • Why not close this one and merge to LW?

  • Have you measured the power consumption with a kill-a-watt (or similar)?

  • Second best season after season 2.

    I really liked the cast for the characters, espilecially Jon Hamm and Jennifer Jason Leigh.

    I felt it was back to basics (Fargo wise) after season 4 which I found a bit out of order.

  • My Python solution for part 1 and part 2. I really practice my regex skills.

     
        
    #!/usr/bin/python3
    
    import re
    
    value_re = '(\d+)'
    symbol_re = '[^\d.]'
    gear_re = '(\*)'
    
    def main():
        input = list()
        with open("input.txt", 'r') as in_file:
            for line in in_file:
                input.append(line.strip('\n'))
        length = len(input)
        width = len(input[0])
        value_sum = 0
        for idx, line in enumerate(input):
            for match in re.finditer(value_re, line):
                for line_mask in input[max(idx - 1, 0):min(idx + 2, length)]:
                    valid_chars = line_mask[max(match.span()[0] - 1, 0):min(match.span()[1] + 1, width)]
                    if re.search(symbol_re, valid_chars):
                        value_sum += int(match[0])
                        break
        print(f"Value sum = {value_sum}")
    
        gear_ratio = 0
        for idx, line in enumerate(input):
            for match in re.finditer(gear_re, line):
                valid_lines = input[max(idx - 1, 0):min(idx + 2, length)]
                min_range = max(match.span()[0] - 1, 0)
                max_range = min(match.span()[1], width)
                num_of_adjacent = 0
                temp_gear_ratio = 1
                for valid_line in valid_lines:
                    for match in re.finditer(value_re, valid_line):
                        if match.span()[0] in range(min_range,max_range + 1) or match.span()[1] - 1 in range(min_range,max_range + 1):
                            num_of_adjacent += 1
                            temp_gear_ratio *= int(match[0])
                if num_of_adjacent == 2:
                    gear_ratio += temp_gear_ratio
        print(f"Gear ratio = {gear_ratio}")
    
    if __name__ == '__main__':
        main()
    
      
  • Because that is how Bluetooth is specified. Bluetooth is primarily used for audio, where high throughput is not the most important parameter. Expected Bluetooth throughput is less than 2 Mbps, see more here https://www.bluetooth.com/blog/exploring-bluetooth-5-how-fast-can-it-be/

    WiFi on the other hand, has peak throughput above 1 Gbps. So your observations are as expected.

  • Are recurring tasks an option? And it it possible to repeat them x days after last completion?

  • OK, that makes sense.

  • A sad guide... Surprised it is topped by the Philippines.

  • In South Korea you are not allowed to work more than 52 hours a week. Generally, you work approximately 40 hours a week.

  • Does as advertised, and I don't really know any alternatives.

  • Cool, I'll give it a try.