Skip Navigation

Posts
34
Comments
217
Joined
2 yr. ago

  • A horse is a horse of course of courseAnd no one can talk to a horse of course.That is of course unless the horseIs the famous Mister Ed!

    Go right to the source and ask the horse.He'll give you the answer that you'll endorseHe's always on a steady course.Talk to Mister Ed!

    People yakkity-yak a streakAnd waste your time of day,but Mister Ed will never speakUnless he has something to say!

    A horse is a horse of course of courseAnd this one'll talk 'til his voice is hoarse.You've never heard of a talking horse?Well, listen to this...

    "I am Mister Ed!"

  • BAD IS GOOD

    WAR IS PEACE

    FREEDOM IS SLAVERY

  • RTFF? What's a fanual?

  • I am not the person who said "C++ has rotted their brain". I have not expressed a similar sentiment. I have never said that "borrow checker fixes all", in fact I said that it will not magically fix everything.

    And if I want a bug-free code, I will use same tool as ever: my brain

    Is your brain infallible?

    The strategy is not to 100% eliminate every bug in existence or theory, bugs are inevitable. The strategy is Swiss cheese security.

    Something is better than nothing. Therefore (brain + something) > (brain + nothing). As long as "something" works to prevent bugs, to any extent, it will result in fewer bugs.

  • It's not a "magic pill", it's another tool. We're not saying that it will magically fix everything, it will just make certain types of errors less probable.

    If you want bug-free code, will you (A) use a tool that makes it easier, or (B) use the same tool as before?

    "Skill issue" is not an answer.

  • Like the fox?

  • Does that really have the same results as the example scenario I described? How would you even access the unnamed struct, since it is unnamed?

  • What's the point of this? If you have a struct within a struct, you probably want them to nest. The -fms-extensions will un-nest them, which is not what you mean.

     
        
    // If I type this:
    struct test {
            int a;
            struct test2 {
                    char b;
                    float c;
            };
            double d;
    };
    
    struct test my_test;
    
    // I want this to happen:
    my_test.test2.b = 'x'; //assigning the members of the nested struct
    my_test.test2.c = 3.141; //this will work
    printf("%f", my_test.c); //this will NOT work since c is a property of test2
    
      
  • I sense a fork coming

  • From security agencies, presumably...

    Got me? No!

    Security agencies create encryption for their own usage. This means they want it to be mathematically as strong as possible, to protect their secrets from enemy security agencies. Why would they backdoor their own protection system?

    They'll just go through the side door instead.

  • I used to like them because of the sandboxing.

    Now I don't like them, because of the sandboxing. And the slow updates.

    (I still use them because some programs are not available in my distro's repository)

  • That butterfly looks so miffed

  • You're in luck, it's a designated neutral editor

  • This is primitive, the US Military has advanced beyond this!

  • Pasta

    Jump
  • Manicotti too

  • They use a hardware memory interposer to pull off the attack.

    If the attacker (A) has physical access, and (B) is using lab equipment on the target machines, then you're already pwned.

  • 2.1 is the most common version, but it's way out of date. The current standardized version is 9.6.0.

  • Polynomial works fine.

    Exponential, runs into problem 2 that I brought up.

    The digit in the ones place will always equal 1

    So 01, 02, 03, 04, 05... 09, 0A, 0B, 0C, 0D, 0E, 0F... will never exceed 1.

    (I thought that the polynomial problem (1 in any place will always equal 1) would be worse, but it turns out the opposite is true.)

    Fixed exponential count:1, 10, 11, 20, 21, 111, 120, 30, 200, 201

    Or, in the trivial^^2 case for exponential, you could just put a 1 in the highest place and put a bunch of 0s after it.1, 10, 100, 1000, 10000...

  • Bro!

    Jump