aboutsummaryrefslogtreecommitdiff
path: root/azalea-core/src/bitset.rs
blob: 6f0a27cabcf88e1e6119bd02cd272780aebd46fe (plain)
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
101
102
103
104
105
106
107
108
use azalea_buf::{BufReadError, McBufReadable, McBufWritable};
use std::io::{Read, Write};

/// Represents Java's BitSet, a list of bits.
#[derive(Debug, Clone, PartialEq, Eq, Hash, Default)]
pub struct BitSet {
    data: Vec<u64>,
}

const ADDRESS_BITS_PER_WORD: usize = 6;

// the Index trait requires us to return a reference, but we can't do that
impl BitSet {
    pub fn new(size: usize) -> Self {
        BitSet {
            data: vec![0; size.div_ceil(64)],
        }
    }

    pub fn index(&self, index: usize) -> bool {
        (self.data[index / 64] & (1u64 << (index % 64))) != 0
    }

    // private static int wordIndex(int bitIndex) {
    //     return bitIndex >> ADDRESS_BITS_PER_WORD;
    // }
    pub fn word_index(bit_index: usize) -> usize {
        bit_index >> ADDRESS_BITS_PER_WORD
    }

    pub fn clear_from_to(&mut self, from: usize, to: usize) {
        assert!(from <= to);
        assert!(to <= self.data.len() * 64);
        assert!(to > 0);

        if from == to {
            return;
        }

        // int startWordIndex = wordIndex(fromIndex);
        // if (startWordIndex >= wordsInUse)
        //     return;

        // int endWordIndex = wordIndex(toIndex - 1);
        // if (endWordIndex >= wordsInUse) {
        //     toIndex = length();
        //     endWordIndex = wordsInUse - 1;
        // }

        // long firstWordMask = WORD_MASK << fromIndex;
        // long lastWordMask  = WORD_MASK >>> -toIndex;
        // if (startWordIndex == endWordIndex) {
        //     // Case 1: One word
        //     words[startWordIndex] &= ~(firstWordMask & lastWordMask);
        // } else {
        //     // Case 2: Multiple words
        //     // Handle first word
        //     words[startWordIndex] &= ~firstWordMask;

        //     // Handle intermediate words, if any
        //     for (int i = startWordIndex+1; i < endWordIndex; i++)
        //         words[i] = 0;

        //     // Handle last word
        //     words[endWordIndex] &= ~lastWordMask;
        // }

        // recalculateWordsInUse();
        // checkInvariants();
    }
}

impl McBufReadable for BitSet {
    fn read_from(buf: &mut impl Read) -> Result<Self, BufReadError> {
        Ok(Self {
            data: Vec::<u64>::read_from(buf)?,
        })
    }
}

impl McBufWritable for BitSet {
    fn write_into(&self, buf: &mut impl Write) -> Result<(), std::io::Error> {
        self.data.write_into(buf)
    }
}

impl BitSet {
    pub fn set(&mut self, bit_index: usize) {
        self.data[bit_index / 64] |= 1u64 << (bit_index % 64);
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_bitset() {
        let mut bitset = BitSet::new(64);
        assert_eq!(bitset.index(0), false);
        assert_eq!(bitset.index(1), false);
        assert_eq!(bitset.index(2), false);
        bitset.set(1);
        assert_eq!(bitset.index(0), false);
        assert_eq!(bitset.index(1), true);
        assert_eq!(bitset.index(2), false);
    }
}