Link Details

Link 887759 thumbnail
User 716703 avatar

By clochard
Submitted: Dec 06 2012 / 09:49

A compressed bitset solution providing the usual intersection (and), union (or) and difference (and-not) operations with two different approaches. It uses a memory efficient persistent data structure (effectively immutable with copy-on-write semantics) allowing multiple reading threads and one updating thread. It has a constant time complexity O(1) for set and clear for the typical case.
  • 3
  • 0
  • 316
  • 14

Add your comment

Html tags not supported. Reply is editable for 5 minutes. Use [code lang="java|ruby|sql|css|xml"][/code] to post code snippets.

Upvoters (3)

Downvoters (0)

    Apache Hadoop
    Written by: Piotr Krewski
    Featured Refcardz: Top Refcardz:
    1. Play
    2. Akka
    3. Design Patterns
    4. OO JS
    5. Cont. Delivery
    1. Play
    2. Java Performance
    3. Akka
    4. REST
    5. Java