[-] Vulwsztyn@programming.dev 3 points 1 month ago* (last edited 1 month ago)

you don't have to rebase.

create a new branch from main

push it

go to main

git reset --hard origin/main

[-] Vulwsztyn@programming.dev 2 points 1 month ago

why medium?

7

I need to boast a bit and ask for "code review". I'm sorry if this doesn't constitute a good post.

I browse local communities more often than I should for my mental health.

I was checking out https://nim-lang.org/ and when I googled it one of the links was to rosettacode.org and I decided to check out the implementation of 2048.

I noticed that zig's implementation was a non-working auto translation of rust's, so I decided to rewrite it.

My repo: https://codeberg.org/Vulwsztyn/2048_zig

With the reader, writer, and arraylist api changes in 0.15 most of the sources were usless and if I hadn't found https://github.com/xyaman/mibu I guess I would have surrendered.

Feel free to roast the hell out of my code.

[-] Vulwsztyn@programming.dev 6 points 2 months ago

coming from a language with consistent pronunciation I pronounce it "aur" like other comments said, like "aurum" or like in Portuguese - how it is written)

[-] Vulwsztyn@programming.dev 2 points 2 months ago* (last edited 2 months ago)

I know it's not the point of this comment, but I'll check harlequin out

[-] Vulwsztyn@programming.dev 1 points 3 months ago* (last edited 3 months ago)

Stop using ~~floats and cents for money~~ medium ffs

[-] Vulwsztyn@programming.dev 1 points 3 months ago

"stop using medium"

[-] Vulwsztyn@programming.dev 4 points 3 months ago

my boring python solution:

from pathlib import Path


def main():
    input = Path('input.txt').read_text().split('\n')
    names = input[0].split(',')
    instructions = input[-1].split(',')
    print(names,instructions)
    index = 0
    for instruction in instructions:
        dir = instruction[0]
        number = int(instruction[1:])
        if dir == 'L':
            index -= number
            if index < 0:
                index = 0
        else:
            index += number
            if index > len(names) - 1:
                index = len(names) - 1
    print(names[index])
    index = 0
    for instruction in instructions:
        dir = instruction[0]
        number = int(instruction[1:])
        if dir == 'L':
            index -= number
        else:
            index += number
    print(names[index%(len(names))])
    indexes = list(range(len(names)))
    for instruction in instructions:
        dir = instruction[0]
        number = (int(instruction[1:]) if dir == 'R' else -int(instruction[1:])) % len(names)
        indexes[0], indexes[number] = indexes[number], indexes[0]
    print(names[indexes[0]])

if __name__ == "__main__":
    main()

I probably should read all 3 files though. I'll hone it out later.

[-] Vulwsztyn@programming.dev 2 points 4 months ago

it has more sane syntax than python and is great for e. g. webscrapping

[-] Vulwsztyn@programming.dev 3 points 6 months ago

This is only a Draft for now though

19

Hi, I recently realised one can use immutable default arguments to avoid a chain of:

def append_to(element, to=None):
    if to is None:
        to = []

at the beginning of each function with default argument for set, list, or dict.

5
[-] Vulwsztyn@programming.dev 2 points 11 months ago* (last edited 11 months ago)

sick fun, but I learned a fair bit

3
[-] Vulwsztyn@programming.dev 3 points 2 years ago* (last edited 2 years ago)

Read the 1st comment under 1st link, 2nd link os about something different, 4th links is about something absolutely different. **

view more: next ›

Vulwsztyn

0 post score
0 comment score
joined 2 years ago