File: ImmutableBitSet.java

package info (click to toggle)
openjdk-25 25~32ea-1
  • links: PTS, VCS
  • area: main
  • in suites: trixie
  • size: 825,280 kB
  • sloc: java: 5,584,902; cpp: 1,333,941; xml: 1,321,242; ansic: 487,993; asm: 404,003; objc: 21,088; sh: 15,102; javascript: 13,265; python: 8,319; makefile: 2,515; perl: 357; awk: 351; pascal: 103; exp: 83; sed: 72; jsp: 24
file content (100 lines) | stat: -rw-r--r-- 3,244 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
/*
 * Copyright (c) 2023, Oracle and/or its affiliates. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
 * or visit www.oracle.com if you need additional information or have any
 * questions.
 */

/**
 * @test
 * @summary Basic tests of immutable BitSets
 * @modules java.base/jdk.internal.util
 * @run junit ImmutableBitSet
 */

import jdk.internal.util.ImmutableBitSetPredicate;
import org.junit.jupiter.api.Test;

import java.util.BitSet;
import java.util.Random;
import java.util.function.IntPredicate;
import java.util.stream.IntStream;

import static org.junit.jupiter.api.Assertions.*;

public class ImmutableBitSet {

    @Test
    void empty() {
        BitSet bs = new BitSet();
        IntPredicate ibs = ImmutableBitSetPredicate.of(bs);
        test(bs, ibs);
    }

    @Test
    void negativeIndex() {
        IntStream.of(0, 127, 128, 129, 143, 4711).forEach(k -> {
                    BitSet bs = new BitSet(k);
                    IntPredicate ibs = ImmutableBitSetPredicate.of(bs);
                    assertFalse(ibs.test(-1));
                    assertFalse(ibs.test(Integer.MIN_VALUE));
                });
    }

    @Test
    void basic() {
        IntStream.of(0, 16, 127, 128, 129, 143, 4711).forEach(k -> basic(k));
    }

    void basic(int length) {
        BitSet bs = createReference(length);
        IntPredicate ibs = ImmutableBitSetPredicate.of(bs);
        test(bs, ibs);
    }

    @Test
    void clearedAtTheTail() {
        IntStream.of(0, 16, 127, 128, 129, 143, 4711).forEach(k -> {
            for (int i = Long.BYTES - 1; i < Long.BYTES + 2; i++) {
                BitSet bs = createReference(k + i);
                for (int j = bs.length() - 1; j > Long.BYTES - 1; j--) {
                    bs.clear(j);
                }
                IntPredicate ibs = ImmutableBitSetPredicate.of(bs);
                test(bs, ibs);
            }
        });
    }

    static void test(BitSet expected, IntPredicate actual) {
        for (int i = 0; i < expected.length() + 17; i++) {
            assertEquals(expected.get(i), actual.test(i), "at index " + i);
        }
    }

    private static BitSet createReference(int length) {
        BitSet result = new BitSet(length);
        Random random = new Random(length);
        for (int i = 0; i < length; i++) {
            result.set(i, random.nextBoolean());
        }
        return result;
    }

}