import java.util.BitSet;
public class DataFilterAndCount {
public static void main(String[] args) {
BitSet bitSet = new BitSet();
int[] data = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
for (int i = 0; i < data.length; i++) {
if (i % 2 != 0) {
bitSet.set(data[i]);
}
}
int count = bitSet.cardinality();
System.out.println("Filtered data count: " + count);
}
}
import java.util.BitSet;
public class DuplicateRemovalAndDeduplication {
public static void main(String[] args) {
BitSet bitSet = new BitSet();
int[] data = {1, 2, 3, 4, 5, 4, 3, 6, 7, 8, 9, 10};
for (int i = 0; i < data.length; i++) {
bitSet.set(data[i]);
}
System.out.print("Deduplicated data: ");
for (int i = 0; i < bitSet.size(); i++) {
if (bitSet.get(i)) {
System.out.print(i + " ");
}
}
}
}
import java.util.BitSet;
public class SetOperations {
public static void main(String[] args) {
BitSet bitSet1 = new BitSet();
BitSet bitSet2 = new BitSet();
int[] data1 = {1, 2, 3, 4, 5};
int[] data2 = {4, 5, 6, 7, 8};
for (int i = 0; i < data1.length; i++) {
bitSet1.set(data1[i]);
}
for (int i = 0; i < data2.length; i++) {
bitSet2.set(data2[i]);
}
bitSet1.or(bitSet2);
System.out.print("Union set: ");
for (int i = 0; i < bitSet1.size(); i++) {
if (bitSet1.get(i)) {
System.out.print(i + " ");
}
}
bitSet1.and(bitSet2);
System.out.print("
Intersection set: ");
for (int i = 0; i < bitSet1.size(); i++) {
if (bitSet1.get(i)) {
System.out.print(i + " ");
}
}
bitSet1.xor(bitSet2);
System.out.print("
Difference set: ");
for (int i = 0; i < bitSet1.size(); i++) {
if (bitSet1.get(i)) {
System.out.print(i + " ");
}
}
}
}
