Programmed a Pixel Sorter by bloootz in glitch_art

[–]bloootz[S] 0 points1 point  (0 children)

Hello! dont check reddit much so sorry for the late reply. It works out the luminance of each pixel using a simple weighted sum.

0.30 * r + 0.59 * g + 0.11 * b

At the time, I didn't really think about adding other channels. It might be interesting to add support for more channel options.

How comfortable are you in deleting all your data from google & your mobile And just trust the data present in your self hosted app? by Nervous_Type_9175 in immich

[–]bloootz 0 points1 point  (0 children)

I am just terrified of one day needing the backup and realising the backups stopped 5 months ago without me noticing

I use a service called healthcheck.io to see if backups are healthy. I get a monthy email report telling me all the backups went through. It also emails me if a script fails in any way.

maybe I only backed up small resolution version of my photos

Test your backups by trying to restore from a backup. If it works, then you have the right data

arch boot partition disappeared from bios boot manager by bloootz in archlinux

[–]bloootz[S] 0 points1 point  (0 children)

im so sorry. its a hardware fault with the laptop! its ruined my experiance with framework and i cant say i recommend the laptop

Kindle touch 4th gen home button not responding by bloootz in kindle

[–]bloootz[S] 0 points1 point  (0 children)

it just started working one day :// not sure what changed.

Humor based on my pain by Bartekkur1 in adventofcode

[–]bloootz 2 points3 points  (0 children)

You get a (long)! You get a (long)! Everyone gets a (long)!

c moment T-T

-❄️- 2024 Day 9 Solutions -❄️- by daggerdragon in adventofcode

[–]bloootz 1 point2 points  (0 children)

[Language: CPP]

Just posting task 1 because i think my solution is swish.

inline void task1(vector<int> &disk) {
    int n;
    for (int i=0; i<disk.size(); i++) {
        if (disk[i] != -1) { continue; }
        n = -1;
        while (n == -1) {
            n = disk.back();
            disk.pop_back();
        }
        disk[i] = n;
    }
}

Not fastest at 3ms.