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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 25, 20262026-05-25T11:04:24+00:00 2026-05-25T11:04:24+00:00

I’m looking for a way to represent a set of integers with a bit

  • 0

I’m looking for a way to represent a set of integers with a bit vector (which would be the characteristic function of that set of integers) and be able to perform bitwise operations on this set.

Initially I thought scala’s BitSet would be the ideal candidate. However, it seems BitSet doesn’t support shifting operations according to the documentation 1. Upon further investigation I also found that the related Java BitSet implementation doesn’t support shift operations either 2.

Am I left with the only option of implementing my own BitSet class which supports shift operations? Moreover, according to the description given in 3 it doesn’t sound that difficult to support shift operations on the Scala’s BitSet implementation, or have I misunderstood something here?

Thanks in advance.

  • 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-25T11:04:24+00:00Added an answer on May 25, 2026 at 11:04 am

    The usual trick when faced with a need for retrofitting new functionality is the “Pimp My Library” pattern. Implicitly convert the BitSet to a dedicated type intended to perform the added operation:

    class ShiftableBitSet(bs: BitSet) {
      def shiftLeft(n: Int): BitSet = ... //impl goes here
    }
    
    implicit def bitsetIsShiftable(bs: BitSet) = new ShiftableBitSet(bs)
    
    val sample = BitSet(1,2,3,5,7,9)
    val shifted = sample.shiftLeft(2)
    

    Alter shiftLeft to whatever name and with whatever arguments you prefer.

    UPDATE

    If you know for certain that you’ll have an immutable BitSet, then a (slightly hacky) approach to access the raw underlying array is to pattern match. Not too painful either, as there are only 3 possible concrete subclasses for an immutable BitSet:

    import collection.immutable.BitSet
    val bitSet = BitSet(1,2,3)
    bitSet match {
      case bs: BitSet.BitSet1 => Array(bs.elems)
      case bs: BitSet.BitSetN => bs.elems 
      case _ => error("unusable BitSet")
    }
    

    Annoyingly, the elems1 param to BitSet2 isn’t a val, and the elems param to a mutable BitSet is marked protected. So it’s not perfect, but should do the trick if your set is non-trivial and immutable. For the trivial cases, “normal” access to the set won’t be too expensive.

    And yes, this technique would be used within the wrapper as described above.

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

Sidebar

Related Questions

I have a string like this: La Torre Eiffel paragonata all’Everest What PHP function
I would like to run a str_replace or preg_replace which looks for certain words
I'm parsing an RSS feed that has an ’ in it. SimpleXML turns this
I need a function that will clean a strings' special characters. I do NOT
I have a jquery bug and I've been looking for hours now, I can't
link Im having trouble converting the html entites into html characters, (&# 8217;) i
That's pretty much it. I'm using Nokogiri to scrape a web page what has
I am trying to understand how to use SyndicationItem to display feed which is
I used javascript for loading a picture on my website depending on which small
I've got a string that has curly quotes in it. I'd like to replace

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.