Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 4 additions & 5 deletions biome.json
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,8 @@
"indentWidth": 2,
"lineWidth": 140,
"lineEnding": "lf",
"attributePosition": "auto"
"attributePosition": "auto",
"includes": ["**/*.js", "!test"]
},
"linter": {
"enabled": true,
Expand All @@ -30,7 +31,8 @@
"style": {
"useSingleVarDeclarator": "error"
}
}
},
"includes": ["**/*.js", "!lib/defs.js"]
},
"javascript": {
"formatter": {
Expand All @@ -43,8 +45,5 @@
"semicolons": "always",
"trailingCommas": "all"
}
},
"files": {
"includes": ["**/*.js", "!lib/defs.js"]
}
}
8 changes: 7 additions & 1 deletion lefthook.yml
Original file line number Diff line number Diff line change
Expand Up @@ -2,5 +2,11 @@ pre-commit:
commands:
format:
glob: "**/*.js"
exclude:
- "test/*.js"
run: npx biome format {staged_files} --write
stage_fixed: true
stage_fixed: true
lint:
glob: "**/*.js"
run: npx biome lint {staged_files} --write
stage_fixed: true
129 changes: 48 additions & 81 deletions test/bitset.js
Original file line number Diff line number Diff line change
Expand Up @@ -4,94 +4,61 @@ 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) => {
return new BitSet(size);
},
choice(arb.Nothing, PosInt),
),
);
const EmptyBitSet = label('bitset', transform((size) => new BitSet(size), choice(arb.Nothing, PosInt)));

suite('BitSet', () => {
test(
'get bit',
forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
b.set(bit);
return b.get(bit);
})
.asTest(),
);
test('get bit', forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
b.set(bit);
return b.get(bit);
})
.asTest());

test(
'clear bit',
forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
b.set(bit);
b.clear(bit);
return !b.get(bit);
})
.asTest(),
);
test('clear bit', forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
b.set(bit);
b.clear(bit);
return !b.get(bit);
})
.asTest());

test(
'next set of empty',
forAll(EmptyBitSet)
.satisfy((b) => {
return b.nextSetBit(0) === -1;
})
.asTest(),
);
test('next set of empty', forAll(EmptyBitSet)
.satisfy((b) => {
return b.nextSetBit(0) === -1;
})
.asTest());

test(
'next set of one bit',
forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
b.set(bit);
return b.nextSetBit(0) === bit;
})
.asTest(),
);
test('next set of one bit', forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
b.set(bit);
return b.nextSetBit(0) === bit;
})
.asTest());

test(
'next set same bit',
forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
b.set(bit);
return b.nextSetBit(bit) === bit;
})
.asTest(),
);
test('next set same bit', forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
b.set(bit);
return b.nextSetBit(bit) === bit;
})
.asTest());

test(
'next set following bit',
forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
b.set(bit);
return b.nextSetBit(bit + 1) === -1;
})
.asTest(),
);
test('next set following bit', forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
b.set(bit);
return b.nextSetBit(bit + 1) === -1;
})
.asTest());

test(
'next clear of empty',
forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
return b.nextClearBit(bit) === bit;
})
.asTest(),
);
test('next clear of empty', forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
return b.nextClearBit(bit) === bit;
})
.asTest());

test(
'next clear of one set',
forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
b.set(bit);
return b.nextClearBit(bit) === bit + 1;
})
.asTest(),
);
test('next clear of one set', forAll(EmptyBitSet, PosInt)
.satisfy((b, bit) => {
b.set(bit);
return b.nextClearBit(bit) === bit + 1;
})
.asTest());
});
Loading