amqplib
Version:
An AMQP 0-9-1 (e.g., RabbitMQ) library and client.
66 lines (55 loc) • 1.63 kB
JavaScript
const { describe, it } = require('node:test');
const claire = require('claire');
const { BitSet } = require('../lib/bitset');
const { forAll, data: arb, label, choice, transform } = claire;
const PosInt = transform(Math.floor, arb.Positive);
const EmptyBitSet = label('bitset', transform((size) => new BitSet(size), choice(arb.Nothing, PosInt)));
describe('BitSet', () => {
it('get bit', forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
b.set(bit);
return b.get(bit);
})
.asTest());
it('clear bit', forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
b.set(bit);
b.clear(bit);
return !b.get(bit);
})
.asTest());
it('next set of empty', forAll(EmptyBitSet)
.satisfy((b) => {
return b.nextSetBit(0) === -1;
})
.asTest());
it('next set of one bit', forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
b.set(bit);
return b.nextSetBit(0) === bit;
})
.asTest());
it('next set same bit', forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
b.set(bit);
return b.nextSetBit(bit) === bit;
})
.asTest());
it('next set following bit', forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
b.set(bit);
return b.nextSetBit(bit + 1) === -1;
})
.asTest());
it('next clear of empty', forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
return b.nextClearBit(bit) === bit;
})
.asTest());
it('next clear of one set', forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
b.set(bit);
return b.nextClearBit(bit) === bit + 1;
})
.asTest());
});