Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6148633
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 23, 20262026-05-23T19:18:53+00:00 2026-05-23T19:18:53+00:00

Whats the equivalent of this without ixor ~ if(~(i3 + -1) < -1) {

  • 0

Whats the equivalent of this without ixor ~

if(~(i3 + -1) < -1) { ... }

.

would it be this?

if((i3 + 1) > 0)  { ... }

or (doubt this?)

if((i3 + 0) > 0)  { ... }

or (doubt this?)

if(i3 < -1)  { ... }

Thanks I cannot really test it out myself well I can.. but I’m writing a deobfuscator and I want to be 100% sure.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-23T19:18:54+00:00Added an answer on May 23, 2026 at 7:18 pm

    ~x is the bitwise (not logical) inversion of x. In two’s complement, it is equal to -1 - x. Try it.

    ~0  = -1 -  0 = -1
    ~-1 = -1 - -1 = 0
    ~1  = -1 -  1 = -2
    

    Now, to apply this to your condition:

    -1 - (i3 - 1) < -1
    -1 - i3 + 1   < -1   # commutative property of multiplication
       - i3       < -1   # 1 + -1 == 0
         i3       >  1   # * -1 inverts everything, including the inequality
    

    Note, this only applies if the numbers are two’s complement — but almost all CPUs (and most programming languages) behave that way these days.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I'm looking for the equivalent of what in js would be 'this is a
What I really need is an equivalent of this from Eclipse with Netbeans: I
What I'm really looking for would be the equivalent of a lightweight database snapshot
I'm wondering what the PHP equivalent to this code is: require zlib foo =
What is the Boost::Regex equivalent of this Perl regex for words that end with
What is the c#.net equivalent for php's preg_replace function? php code is like this:
What is the boost equivalent of std::vector<T> v; // Assume this was initialized properly
How can I programmatically translate an arbitrary view without using an animation ( android.view.animation.*
In C++, I can do something like this: int i[10] = new int[10]; int
With all this new ARC stuff (which does not fall under NDA…) coming out,

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.