Skip to content

Commit e0f8278

Browse files
author
Serhii Khoma
committed
fix: ci
1 parent a65fca5 commit e0f8278

File tree

4 files changed

+11
-32
lines changed

4 files changed

+11
-32
lines changed

.github/workflows/ci.yml

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -28,10 +28,10 @@ jobs:
2828
output
2929
3030
- name: Build source
31-
run: spago build --censor-stats --strict --pedantic-packages
31+
run: spago build --censor-stats --strict --ensure-ranges --pedantic-packages
3232

3333
- name: Run tests
34-
run: spago test --offline --censor-stats --strict --pedantic-packages -- --censor-codes=UserDefinedWarning
34+
run: spago test --offline --censor-stats --strict --pedantic-packages
3535

3636
- name: Verify formatting
3737
run: purs-tidy check src test

bower.json

Lines changed: 0 additions & 8 deletions
This file was deleted.

package.json

Lines changed: 0 additions & 12 deletions
This file was deleted.

src/JS/BigInt.js

Lines changed: 9 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -13,24 +13,24 @@ export const fromStringAsImpl = function (just) {
1313
return function (radix) {
1414
return function (_value) {
1515

16-
// Preprocess for potentially negative numbers. Since the toString
17-
// function simply prepends a '-' character for negative numbers,
16+
// Preprocess for potentially negative numbers. Since the toString
17+
// function simply prepends a '-' character for negative numbers,
1818
// we need this to make fromStringAs an inverse function.
1919
var value, op;
2020
if (_value[0] === "-") {
21-
op = function (v) {return BigInt(-1) * v};
21+
op = function (v) { return BigInt(-1) * v };
2222
value = _value.slice(1);
2323
} else {
24-
op = function (v) {return v};
24+
op = function (v) { return v };
2525
value = _value;
2626
}
2727

2828
value.replace(/^0+/, '')
2929

3030
var size = 6,
31-
factor = BigInt(radix ** size),
32-
i = value.length % size || size,
33-
parts = [value.slice(0, i)];
31+
factor = BigInt(radix ** size),
32+
i = value.length % size || size,
33+
parts = [value.slice(0, i)];
3434

3535
while (i < value.length) parts.push(value.slice(i, i += size));
3636

@@ -42,7 +42,7 @@ export const fromStringAsImpl = function (just) {
4242
return acc * factor + BigInt(n);
4343
}
4444
};
45-
45+
4646
try {
4747
return just(op(parts.reduce(f, 0n)));
4848
} catch (err) {
@@ -87,14 +87,13 @@ export const biDiv = (x) => (y) => {
8787

8888
export const biDegree = (x) => {
8989
return x < 0n ? -x : x;
90-
9190
}
9291

9392
export const biZero = 0n;
9493

9594
export const biOne = 1n;
9695

97-
export const pow = (x) => (y) => y >= 0n ? x ** y : 0n;
96+
export const pow = (x) => (y) => y >= 0n ? x ** y : 0n;
9897

9998
export const not = (x) => ~x;
10099

0 commit comments

Comments
 (0)