| /libcore/benchmarks/src/benchmarks/regression/ |
| H A D | BitSetBenchmark.java | 27 private BitSet bs; field in class:BitSetBenchmark
30 bs = new BitSet(size);
35 if (!bs.isEmpty()) throw new RuntimeException();
40 bs.set(bs.size() - 1);
42 if (bs.isEmpty()) throw new RuntimeException();
48 bs.get(i % size);
54 bs.clear(i % size);
60 bs.set(i % size);
66 bs
[all...] |
| /libcore/luni/src/test/java/libcore/java/util/ |
| H A D | BitSetTest.java | 27 BitSet bs = new BitSet();
28 assertEquals("{}", bs.toString());
29 bs.set(2);
30 assertEquals("{2}", bs.toString());
31 bs.set(4);
32 bs.set(10);
33 assertEquals("{2, 4, 10}", bs.toString());
36 private static void assertBitSet(BitSet bs, long[] longs, String s) { argument
38 assertEquals(bs.toString(), ((longs[i / 64] & (1L << (i % 64))) != 0), bs
80 assertBitSet(BitSet bs, byte[] bytes, String s) argument
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| H A D | BitSet.java | 447 * Returns true if {@code this.and(bs)} is non-empty, but may be faster than computing that.
449 public boolean intersects(BitSet bs) { argument
450 long[] bsBits = bs.bits;
451 int length = Math.min(this.longCount, bs.longCount);
461 * Logically ands the bits of this {@code BitSet} with {@code bs}.
463 public void and(BitSet bs) { argument
464 int minSize = Math.min(this.longCount, bs.longCount);
466 bits[i] &= bs.bits[i];
473 * Clears all bits in this {@code BitSet} which are also set in {@code bs}.
475 public void andNot(BitSet bs) { argument
486 or(BitSet bs) argument
502 xor(BitSet bs) argument
[all...] |
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| H A D | ConcurrentSkipListSetTest.java | 670 BitSet bs = new BitSet(setSize);
672 populate(set, setSize, bs);
673 check(set, 0, setSize - 1, true, bs);
674 check(set.descendingSet(), 0, setSize - 1, false, bs);
676 mutateSet(set, 0, setSize - 1, bs);
677 check(set, 0, setSize - 1, true, bs);
678 check(set.descendingSet(), 0, setSize - 1, false, bs);
681 0, setSize - 1, true, bs);
702 void populate(NavigableSet<Integer> set, int limit, BitSet bs) { argument
705 put(set, element, bs);
709 mutateSet(NavigableSet<Integer> set, int min, int max, BitSet bs) argument
734 mutateSubSet(NavigableSet<Integer> set, int min, int max, BitSet bs) argument
766 put(NavigableSet<Integer> set, int element, BitSet bs) argument
771 remove(NavigableSet<Integer> set, int element, BitSet bs) argument
776 bashSubSet(NavigableSet<Integer> set, int min, int max, boolean ascending, BitSet bs) argument
858 check(NavigableSet<Integer> set, final int min, final int max, final boolean ascending, final BitSet bs) argument
[all...] |
| H A D | TreeMapTest.java | 764 BitSet bs; field in class:TreeMapTest
773 bs = new BitSet(mapSize);
814 bs.clear(it.next());
839 bs.clear(it.next());
860 bs.set(key);
865 bs.clear(key);
981 if (bs.get(key))
992 int result = bs.nextSetBit(key);
1012 boolean bsContainsI = bs.get(i);
1023 assertTrue(bs
[all...] |
| H A D | TreeSetTest.java | 666 BitSet bs; field in class:TreeSetTest
676 bs = new BitSet(setSize);
727 bs.clear(it.next());
752 bs.clear(it.next());
773 bs.set(element);
778 bs.clear(element);
898 if (bs.get(element))
909 int result = bs.nextSetBit(element);
929 boolean bsContainsI = bs.get(i);
940 assertTrue(bs
[all...] |
| H A D | ConcurrentSkipListMapTest.java | 959 BitSet bs; field in class:ConcurrentSkipListMapTest
968 bs = new BitSet(mapSize);
1009 bs.clear(it.next());
1034 bs.clear(it.next());
1055 bs.set(key);
1060 bs.clear(key);
1176 if (bs.get(key))
1187 int result = bs.nextSetBit(key);
1207 boolean bsContainsI = bs.get(i);
1218 assertTrue(bs
[all...] |