| /libcore/benchmarks/src/benchmarks/regression/ |
| H A D | BitSetBenchmark.java | 27 private BitSet bs; field in class:BitSetBenchmark
31 bs = new BitSet(size);
36 if (!bs.isEmpty()) throw new RuntimeException();
41 bs.set(bs.size() - 1);
43 if (bs.isEmpty()) throw new RuntimeException();
49 bs.get(i % size);
55 bs.clear(i % size);
61 bs.set(i % size);
67 bs
[all...] |
| /libcore/ojluni/src/main/java/sun/nio/ch/ |
| H A D | ChannelInputStream.java | 79 private byte[] bs = null; // Invoker's previous array field in class:ChannelInputStream
95 public synchronized int read(byte[] bs, int off, int len) argument
98 if ((off < 0) || (off > bs.length) || (len < 0) ||
99 ((off + len) > bs.length) || ((off + len) < 0)) {
104 ByteBuffer bb = ((this.bs == bs)
106 : ByteBuffer.wrap(bs));
110 this.bs = bs;
|
| H A D | Util.java | 288 static ByteBuffer[] subsequence(ByteBuffer[] bs, int offset, int length) { argument
289 if ((offset == 0) && (length == bs.length))
290 return bs;
294 bs2[i] = bs[offset + i];
|
| /libcore/luni/src/test/java/libcore/java/util/ |
| H A D | BitSetTest.java | 28 BitSet bs = new BitSet();
29 assertEquals("{}", bs.toString());
30 bs.set(2);
31 assertEquals("{2}", bs.toString());
32 bs.set(4);
33 bs.set(10);
34 assertEquals("{2, 4, 10}", bs.toString());
37 private static void assertBitSet(BitSet bs, long[] longs, String s) { argument
39 assertEquals(bs.toString(), ((longs[i / 64] & (1L << (i % 64))) != 0), bs
81 assertBitSet(BitSet bs, byte[] bytes, String s) argument
[all...] |
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| H A D | ConcurrentSkipListSetTest.java | 673 BitSet bs = new BitSet(setSize);
675 populate(set, setSize, bs);
676 check(set, 0, setSize - 1, true, bs);
677 check(set.descendingSet(), 0, setSize - 1, false, bs);
679 mutateSet(set, 0, setSize - 1, bs);
680 check(set, 0, setSize - 1, true, bs);
681 check(set.descendingSet(), 0, setSize - 1, false, bs);
684 0, setSize - 1, true, bs);
705 void populate(NavigableSet<Integer> set, int limit, BitSet bs) { argument
708 put(set, element, bs);
712 mutateSet(NavigableSet<Integer> set, int min, int max, BitSet bs) argument
737 mutateSubSet(NavigableSet<Integer> set, int min, int max, BitSet bs) argument
769 put(NavigableSet<Integer> set, int element, BitSet bs) argument
774 remove(NavigableSet<Integer> set, int element, BitSet bs) argument
779 bashSubSet(NavigableSet<Integer> set, int min, int max, boolean ascending, BitSet bs) argument
861 check(NavigableSet<Integer> set, final int min, final int max, final boolean ascending, final BitSet bs) argument
[all...] |
| H A D | TreeMapTest.java | 785 BitSet bs; field in class:TreeMapTest
794 bs = new BitSet(mapSize);
835 bs.clear(it.next());
860 bs.clear(it.next());
881 bs.set(key);
886 bs.clear(key);
1002 if (bs.get(key))
1013 int result = bs.nextSetBit(key);
1033 boolean bsContainsI = bs.get(i);
1044 assertTrue(bs
[all...] |
| H A D | TreeSetTest.java | 667 BitSet bs; field in class:TreeSetTest
677 bs = new BitSet(setSize);
728 bs.clear(it.next());
753 bs.clear(it.next());
774 bs.set(element);
779 bs.clear(element);
899 if (bs.get(element))
910 int result = bs.nextSetBit(element);
930 boolean bsContainsI = bs.get(i);
941 assertTrue(bs
[all...] |
| H A D | ConcurrentSkipListMapTest.java | 980 BitSet bs; field in class:ConcurrentSkipListMapTest
989 bs = new BitSet(mapSize);
1030 bs.clear(it.next());
1055 bs.clear(it.next());
1076 bs.set(key);
1081 bs.clear(key);
1197 if (bs.get(key))
1208 int result = bs.nextSetBit(key);
1228 boolean bsContainsI = bs.get(i);
1239 assertTrue(bs
[all...] |