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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 21, 20262026-05-21T16:03:08+00:00 2026-05-21T16:03:08+00:00

I need to have my integer counter have values from 1 to 6 inclusive

  • 0

I need to have my integer counter have values from 1 to 6 inclusive in wrap around fashion. Namely starting from 1, I count to 6 and go back to 1. I wonder if it’s possible to achieve using some sort of bitwise logic. Of course it’s trivial with if statement as below but I am wondering about one liner 🙂

int counter = 1;

for...
    do something
    if (counter++ == 7) counter = 1;

Addition:
Here is why I want 1 liner:

byte output = (byte)((inputByte & 0xF8) | counter++);
  • 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-21T16:03:09+00:00Added an answer on May 21, 2026 at 4:03 pm

    Use the modulo operator.

    do something;    
    ++counter; counter %= 7; ++counter;
    

    To use real bitwise operations your modulo must be a power-of-2 which is not the case here.

    PS: If your counter started at 0 instead of 1, you wouldn’t need the second ++counter and would write something like :

    for (int counter = 0; (somecondition); ++counter, counter %= 7)
    {
        do something;
    }
    

    PPS: Note that generally an if performs faster than a modulo, tho.

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

Sidebar

Related Questions

I have three integer values. I need to represent these data as a chart.
I have two integer values a and b , but I need their ratio
I have an integer field in a ClientDataSet and I need to compare to
Let's say I have an integer that I need to convert to a string
I need to have a string, based on an integer, which should always have
I have the following List<int> collection and I need to find the highest integer
I have need to select a number of 'master' rows from a table, also
I have need to return multiple results from a subquery and have been unable
i have this problem: starting from an empty list (0 elements) i want check
I have an integer and need to find out how many digits are in

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.