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 4620886
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 22, 20262026-05-22T02:37:17+00:00 2026-05-22T02:37:17+00:00

I think I need a utility method like this: public static short bitValue(int intNum,

  • 0

I think I need a utility method like this:

public static short bitValue(int intNum, short pos)
{
    short bitValue = 0;

    //check pos bit (from right to left) in the intNum integer to see its value is 0 or 1
    //And then update the bitValue for return

    return bitValue;
}

I am doing research to learn how to do it now. If anyone of you guy have code in hand, please share with me. thanks

  • 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-22T02:37:17+00:00Added an answer on May 22, 2026 at 2:37 am

    Just do a shift and mask:

    return (short) ((intNum >> pos) & 1);
    

    That’s assuming you want a return value of 1 or 0, of course. If you want bit itself, still with the same value, you’ll need to change your return type to int and use:

    return intNum & (1 << intNum);
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I think in this case there is no need to declare a public constructor
This SQL statement example is very close to what I think I need... update
Let's say, hypothetically (read: I don't think I actually need this, but I am
I need bit counter utility in C++ that is capable of counting number of
i have file like this a,205 b,214 c,223 ,13 and i need to parse
I think I need a way to perform a pivot or crosstab using C#
I'm confused regarding each() and .each()... I think I need to use both, but
I need to think about performance limitations of 100 mbps ethernet (including scenarios with
We need to think big and our applications need to scale in order to
I need a Regex I think to see if a string is only a

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.