<dependency>
    <groupId>org.eclipse.collections</groupId>
    <artifactId>eclipse-collections</artifactId>
    <version>11.1.0</version>
</dependency>

import org.eclipse.collections.impl.bitset.ConcurrentBitSet;

public class ConcurrentBitSetDemo {
    public static void main(String[] args) {
        // 創(chuàng)建并發(fā)BitSet實例
        ConcurrentBitSet bits = new ConcurrentBitSet(100);

        // 多線程操作示例
        ExecutorService executor = Executors.newFixedThreadPool(4);
        for (int i = 0; i < 4; i++) {
            executor.execute(() -> {
                for (int j = 0; j < 1000; j++) {
                    // 線程安全地設(shè)置位
                    bits.set(j % 100);
                    // 線程安全地清除位
                    if (j % 50 == 0) {
                        bits.clear(j % 100);
                    }
                }
            });
        }
        executor.shutdown();
        while (!executor.isTerminated()) {
            // 等待所有任務(wù)完成
        }
        System.out.println("Final state: " + bits);
    }
}

// 原子操作：檢查并設(shè)置位（CAS）
boolean success = bits.compareAndSwap(index, expectedValue, newValue);

// 并發(fā)統(tǒng)計：計算true位的數(shù)量
int count = bits.cardinality();

// 并發(fā)位運算：與另一個BitSet執(zhí)行AND操作
ConcurrentBitSet other = new ConcurrentBitSet(100);
bits.and(other);

BitSet bits = new BitSet();
Lock lock = new ReentrantLock();

// 寫操作
lock.lock();
try {
    bits.set(10);
} finally {
    lock.unlock();
}

// 讀操作
lock.lock();
try {
    boolean value = bits.get(10);
} finally {
    lock.unlock();
}

AtomicLongArray array = new AtomicLongArray(100);

// 設(shè)置第50位
int index = 50 / 64;
int bit = 50 % 64;
long mask = 1L << bit;

boolean success = array.compareAndSwap(index, array.get(index), array.get(index) | mask);