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

  • Home
  • SEARCH
  • 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 6052131
In Process

The Archive Base Latest Questions

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

I am looking for a c++ std::bitset equivalent or a similar functionality implementation in

  • 0

I am looking for a c++ std::bitset equivalent or a similar functionality implementation in Java (1.6 specifically). I tried java.util.BitSet but I am finding that it is not quite similar.

The operations I need are the usual bitwise operations such as AND, OR, etc. If possible, I’d like to be able to set the length of the bitset dynamically (which is unsupported in std::bitset). Can anyone provide a recommendation? 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-23T07:53:40+00:00Added an answer on May 23, 2026 at 7:53 am

    I don’t see what problem you’d have with the normal Bitset class.

    The bitset is dynamically grown if necessary (with length() returning the pos of the higehst one bit), so that’s basically a fool proof solution.

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

Sidebar

Related Questions

I am looking at the implementation of an API that I am using. I
I'm looking for a bitset implementation with fast bit appending, where several bits can
I'm attempting to use std::find_if on a std::map, looking for a particular object that
I just realized that I've been using std::vector::data() out of similarity with std::string, but
I'm looking for a way that prevents std::vectors/std::strings from growing in a given range
I am looking for a data structure, optimized for search-operations (in the Java std-lib).
Looking for an example that: Launches an EXE Waits for the EXE to finish.
Looking for a Linux application (or Firefox extension) that will allow me to scrape
I'm looking for a C++ container-like class that wraps a typed array of objects
I was looking through the std::vector code and I found something I didn't quite

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.