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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 17, 20262026-06-17T13:09:40+00:00 2026-06-17T13:09:40+00:00

Dealing with very large bool data set, try to use bit-wise operation to handle

  • 0

Dealing with very large bool data set, try to use bit-wise operation to handle it, looking for some library that dealing with bit-set that can:

  1. Dynamic set, and can be passed by pointers or references.
  2. Read and write bitwisely.
  3. Count set bits and fast.

Obviously std::bitset‘s functionalities are too limited for that, any recommendations?

  • 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-06-17T13:09:41+00:00Added an answer on June 17, 2026 at 1:09 pm

    GMP provides low level bit functions on arbitrarily sized natural numbers. These are “low-level GMP functions, used to implement the high-level GMP functions, but also intended for time-critical user code.”

    These include mpn_popcount to count 1 bits, and mpn_copyi to extract sub-sequences.

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

Sidebar

Related Questions

I have a very large data set that contains multiple groups. They all contain
I am trying to do some html parsing. I am dealing with some very
I'm dealing with very large memory mapped files (200+ GB) which can not be
I am dealing with very large numbers. One of my algorithms requires a number
I have an application that reads a set of data files and performs some
I am dealing with very primitive HTML construction that goes like this: <a NAME=header1></a><b><font
I am dealing with a very big database ~ 6 Million records. I've added
When dealing with events, people are usually taking examples of very simple values object
Dealing with some legacy code and in trying to get a poorly designed database
When dealing with a series of numbers, and wanting to use hash results for

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.