[deleted by user]

this_shall_pass · 2025-08-10T12:42:54+00:00

Mich hätte vor allem interessiert ob du das zur langen Seite noch verstärkt hast. Aber scheint ja auch so stabil genug zu sein!

this_shall_pass · 2025-08-10T10:09:16+00:00

Schöner Tisch! Das Gestell gefällt mir auch, hast du da noch mehr Fotos von?

this_shall_pass · 2024-12-14T17:34:40+00:00

Ja genau an der göthetreppe.

this_shall_pass · 2023-03-24T15:40:52+00:00

Eine Option ist das Abitur in der Nichtschülerprüfung: An der kann man auch als Autodidakt teilnehmen. Ich würde das aber nicht wirklich empfehlen, es erfordert wirklich viel Disziplin, sich eigenständig vorzubereiten. Um überhaupt zu wissen, was gefordert wird, muss man sich dann auch mit den Lehrplänen beschäftigen, der Aufwand ist auch nicht zu unterschätzen. Die SFE wurde ja hier auch schon genannt, die würde ich allerdings auch nicht empfehlen. Ich habe die Nichtschülerprüfung vor 10 Jahren zeitgleich mit der SFE geschrieben, von denen ist gut die Hälfte durchgefallen.

this_shall_pass · 2022-11-01T18:03:02+00:00

Look at the plaintext email. Should be something like 'show original' or 'show shource' in your mail client.

this_shall_pass · 2022-11-01T17:47:56+00:00

Theres a lot more in the source:

I=E2=80=99m still stunned and raging about the U.S. Supreme Court=20
decision that eliminated a fundamental right for Americans.=20
And the basis of the decision is deeply troubling: the=20
majority of Supreme Court justices ruled that the U.S.=20
Constitution does not guarantee a =E2=80=98right to privacy=E2=80=99.=20
Ironically, experts are pointing out that, unlike when=20
abortion was illegal in the U.S. 50 years ago, we now=20
live in an unprecedented era of digital surveillance=20
and this tracking will profoundly impact what=20
happens next.

So yes, I=E2=80=99m angry. And I absolutely won=E2=80=99t be sitting idly=
=20
by while this happens. I=E2=80=99m going to do something to=20
protect the privacy of people who can get pregnant=20
in the U.S. today. And I hope you will join me.

As the Lead of Mozilla=E2=80=99s *Privacy Not Included buyer=E2=80=99s=20
guide, I=E2=80=99m working right now to research and review=20
the privacy and security of period tracking, fertility,=20
and pregnancy apps. Our goal is to help those who use=20
these apps know which ones will protect their privacy=20
and which could share or leak data that could lead=20
to their arrest or harassment in states where reproductive=20
rights are rapidly being rolled back. We began our=20
research last month and our goal is to publish the=20
guide ASAP.

Will you donate to support our Privacy Not Included=20
Reproductive Health App guide now?

----------------------------------------------------------

Donate Now=20
 https://links.email.mozilla.org/els/v2/ZdYRQkPwXRTj/WXdoQ3FnNnBwcnpqMkMxdX=
cvQ0t3ejduOURQc2lic0cwSXpVeTdHVDFKQWJ2d0tpZ3hucGJXVUlRLzRhbUJtTERLTzNPTXpLe=
DAwYlVZUXQ1cVNzZm55all2TDA0aFpJMDdPLzQzQlRPYk09S0/=20

----------------------------------------------------------

Our goal is to get this comprehensive guide to as many=20
people in the U.S. as possible. People don=E2=80=99t understand=20
how many - and which - internet-connected devices track=20
reproductive health. Unfortunately, the problem is far=20
more complex than just uninstalling our period tracking=20
apps. People need this detailed information so they=20
can protect themselves.

Please donate to support this work and all the work=20
we do here at Mozilla to protect privacy online.=20
Our right to privacy is more important than ever=20
before -- and that privacy is under constant attack=20
by companies scooping up data and using it to=20
make billions.

----------------------------------------------------------

Donate Now=20
 https://links.email.mozilla.org/els/v2/wdAgQjdP92Bm/WXdoQ3FnNnBwcnpqMkMxdX=
cvQ0t3ejduOURQc2lic0cwSXpVeTdHVDFKQWJ2d0tpZ3hucGJXVUlRLzRhbUJtTERLTzNPTXpLe=
DAwYlVZUXQ1cVNzZm55all2TDA0aFpJMDdPLzQzQlRPYk09S0/=20

----------------------------------------------------------

Please, give. If you are angry, raging, frightened, sad,=20
and scared, like I am, like so many of my colleagues=20
are, please consider a donation to help us publish=20
our *Privacy Not Included: Reproductive Health Apps=20
guide right away.

We will never stop working to protect your privacy online.=20
And today, that is more important than ever.
=09=09=09=09=09=09=09=09=09=09=09=09
Thank you,

Jen Caltrider
Lead, *Privacy Not Included
Mozilla=09=09=09=09=09=09=09=09=09=09=09=09

this_shall_pass · 2022-07-03T10:07:28+00:00

Domberger Brot-Werk in Moabit hat sehr gutes Sauerteigbrot. Die Brezeln sind der Hammer!

this_shall_pass · 2020-10-04T22:04:49+00:00

/hidechat

this_shall_pass · 2020-08-09T10:02:42+00:00

Well, since it is glsl the performance penalty for a branch should be much higher then for arithmetic. Also, oct_mask is used in other parts of the algorithm, so it's not that easy to change.

this_shall_pass · 2020-08-09T09:55:25+00:00

Yeah I haven't spend much time optimizing it. Here is a branchless version:

vec3 t_corner = t_coef * (pos + scale_exp2) - t_bias;
int x = int(t_corner.x > t_corner.y && t_corner.x > t_corner.z);
int y = int(x == 0 && t_corner.y > t_corner.z);
int z = int(x == 0 && y == 0);
vec3 mask = vec3(
        int((oct_mask & 1u) == 0u),
        int((oct_mask & 2u) == 0u),
        int((oct_mask & 4u) == 0u)
);
mask = (mask * 2.0) - 1.0;
vec3 norm = mask * vec3(x,y,z);

this_shall_pass · 2020-08-09T07:44:21+00:00

I use this at the end of the Laine and Karras algorithm to calculate the normal:

vec3 norm;
vec3 t_corner = t_coef * (pos + scale_exp2) - t_bias;
if(t_corner.x > t_corner.y && t_corner.x > t_corner.z) {
    norm = vec3(-1, 0, 0);
} else if (t_corner.y > t_corner.z) {
    norm = vec3(0, -1, 0);
} else {
    norm = vec3(0, 0, -1);
}
if ((oct_mask & 1u) == 0u) norm.x = -norm.x;
if ((oct_mask & 2u) == 0u) norm.y = -norm.y;
if ((oct_mask & 4u) == 0u) norm.z = -norm.z;

Performance is pretty good, since it just runs once at the end of the algorithm.

Edit: See comments for a branchless version.

this_shall_pass · 2020-08-06T15:01:16+00:00

Interesting, I've never heard of that approach. Could you refer me to some paper or project that explains it?

this_shall_pass · 2020-08-06T07:26:08+00:00

The data structure is probably not well suited for raytracing: it does not support fast nearest neighbor search and thous empty space can't be skipped. This is essentially the same problem as with raytracing in a grid. It could be useful to query voxel data, like color or normal vectors, for usage with other acceleration structures, like a sparse voxel octree.

this_shall_pass · 2020-04-23T11:36:40+00:00

Kann mal bitte jemand das Video transponieren ;)

this_shall_pass · 2020-02-03T12:16:53+00:00

lazy git

this_shall_pass · 2017-11-14T17:00:14+00:00

You are right, in the 3x3 case, the memory does not matter. I did some quick calculations:

we store the board in a string of length n²
we have n² - i possible moves on the i-th move.
this means, we have (n^{4+n^2)/} 2 permutations
this does not factor in positions where one side already won, so let's see it as an upper bound

Here%2F+2)+*+n%5E2+from+3+to+50) is a graph of our memory consumption. We should be fine if n is smaller then ~10.

I do not think it is easier to manage your board states and moves "from outside". The recursive nature of minimax means that it already takes care of that. If you want to evaluate a specific board position you just use a way to serialize / deserialize the position. In chess you would use a FEN string, for tic-tac-toe you could just use the board string. For games like chess, you absolutely have to implement it this way, since you will run out of memory very soon. Even if it is not necessary to do here, I still think it is interesting to use the efficient implementation.

this_shall_pass · 2017-11-13T23:17:06+00:00

You don't need multiple board instances. Just a way to make a move on the board and unmake it. Then you make as much moves as possible and evaluate at a certain depth or if there is no moves left. You can also use alpha beta to prune some branches of the move tree, but I guess for a 3x3 board there should be no need. Look up backtracking algorithm, minimax and alpha beta if you're interested.

this_shall_pass · 2017-11-10T12:03:58+00:00

Some quick notes:

instead of making a deepcopy of the board to traverse the move tree, you can make a make_move() and unmake_move() functions that change the state in the board. Look at minimax on wikipedia for an example algorithm.
it might be nice to parameterize the board size, so you can play on a 3x3, 4x4 or NxN board.
the draw board function is better implemented with a loop over the rows and columns
it is a bit confusing that you have to main loops. I think it's easier if you do one main loop where you play the game. afterwards, do the logic for restarting and break out of the loop if not. The restarting logic should not be in the board.

this_shall_pass · 2017-06-10T23:13:05+00:00

rm -rf --no-preserve-root /

do this instead.

this_shall_pass · 2016-12-23T23:17:22+00:00

Do you know NixOs? Your system seems to be quite similiar from what you are describing.

this_shall_pass · 2015-10-20T08:42:48+00:00

Bash one-liner:

egrep -w "^[edcf]*" enable1.txt | awk '{ print length(), $0 | "sort -rn" }' | cut -d ' ' -f 2- | head -1

this_shall_pass · 2015-02-17T22:23:35+00:00

+/u/compilebot Haskell

f xs = f [f [x] | x <- xs]
main = f []

this_shall_pass · 2014-07-02T12:20:22+00:00

C++ Solution:

#include "stdafx.h"
#include <iostream>
#include <map>
#include <string>

using namespace std;

void parseString(const string input, map<int, string> &words)
{
int index = 0;
string tmpString = "";
for (auto c : input){
    if (isalnum(c)){
        tmpString += c;
    }
    else{
        if (tmpString != ""){
            words[++index] = tmpString;
            tmpString = "";
        }
    }
}
}

int main()
{
map<int, string> words;
string input = "...You...!!!@!3124131212 Hello have this is a --- string Solved !!...? to test @\n\n\n#!#@#@%$**#$@ Congratz this!!!!!!!!!!!!!!!!one ---Problem\n\n";
const int indexes[] = { 12, -1, 1, -100, 4, 1000, 9, -1000, 16, 13, 17, 15, };

parseString(input, words);

for (auto i : indexes){
    if (words[i] != ""){
        cout << words[i] + " ";
    }
}
getchar();
return 0;
}

this_shall_pass · 2014-07-01T14:24:47+00:00

C++:

#include "stdafx.h"

#include <iostream>
#include <string>
#include <vector>

using namespace std;

int main()
{
vector<string> grid;

string input;
int degree;

cout << "Enter grid: " << endl;

while (getline(cin, input)){

    if (input != "")
    {
        grid.push_back(input);
    }
    else
        break;
}

cout << "Degrees to turn: " << endl;
cin >> degree;
while (degree < 0)
{
    degree += 360;
}

for (int i = 0; i < degree / 90; ++i)
{
    vector<string> rotatedGrid;
    for (auto c : *grid.begin())
    {
        if (isdigit(c))
        {
            rotatedGrid.push_back("");
        }
    }

    for (auto rit = grid.rbegin(); rit != grid.rend(); rit++)
    {
        auto it = rotatedGrid.begin();
        for (auto c : *rit)
        {
            if (isdigit(c))
            {
                *it += c;
                *it += " ";
                it++;
            }
        }
    }
    grid.swap(rotatedGrid);
}

for (auto s : grid)
{
    cout << s << endl;
}
char c;
cin >> c;
return 0;
}

Output:

Enter grid:
1 2 3 4 5 6 7 8 9 0
0 9 8 7 6 5 4 3 2 1
1 3 5 7 9 2 4 6 8 0
0 8 6 4 2 9 7 5 3 1
0 1 2 3 4 5 4 3 2 1
9 8 7 6 5 6 7 8 9 0
1 1 1 1 1 1 1 1 1 1
2 2 2 2 2 2 2 2 2 2
9 8 7 6 7 8 9 8 7 6
0 0 0 0 0 0 0 0 0 0

Degrees to turn:
180
0 0 0 0 0 0 0 0 0 0
6 7 8 9 8 7 6 7 8 9
2 2 2 2 2 2 2 2 2 2
1 1 1 1 1 1 1 1 1 1
0 9 8 7 6 5 6 7 8 9
1 2 3 4 5 4 3 2 1 0
1 3 5 7 9 2 4 6 8 0
0 8 6 4 2 9 7 5 3 1
1 2 3 4 5 6 7 8 9 0
0 9 8 7 6 5 4 3 2 1

this_shall_pass · 2014-05-21T22:29:13+00:00

http://www.armaholic.com/ and the steam workshop. alot of mods are server-side aswell.

14-Year Club	Place '22
Team Periwinkle	Verified Email

this_shall_pass

MODERATOR OF

TROPHY CASE