chore: latest prettier
This commit is contained in:
parent
5d99fd5252
commit
edcfec1eae
|
@ -11750,9 +11750,9 @@
|
||||||
"dev": true
|
"dev": true
|
||||||
},
|
},
|
||||||
"prettier": {
|
"prettier": {
|
||||||
"version": "2.0.2",
|
"version": "2.1.2",
|
||||||
"resolved": "https://registry.npmjs.org/prettier/-/prettier-2.0.2.tgz",
|
"resolved": "https://registry.npmjs.org/prettier/-/prettier-2.1.2.tgz",
|
||||||
"integrity": "sha512-5xJQIPT8BraI7ZnaDwSbu5zLrB6vvi8hVV58yHQ+QK64qrY40dULy0HSRlQ2/2IdzeBpjhDkqdcFBnFeDEMVdg==",
|
"integrity": "sha512-16c7K+x4qVlJg9rEbXl7HEGmQyZlG4R9AgP+oHKRMsMsuk8s+ATStlf1NpDqyBI1HpVyfjLOeMhH2LvuNvV5Vg==",
|
||||||
"dev": true
|
"dev": true
|
||||||
},
|
},
|
||||||
"pretty-format": {
|
"pretty-format": {
|
||||||
|
|
|
@ -38,7 +38,7 @@
|
||||||
"@typescript-eslint/parser": "^4.2.0",
|
"@typescript-eslint/parser": "^4.2.0",
|
||||||
"eslint": "^7.9.0",
|
"eslint": "^7.9.0",
|
||||||
"jest": "^26.4.2",
|
"jest": "^26.4.2",
|
||||||
"prettier": "^2.0.2",
|
"prettier": "^2.1.2",
|
||||||
"semantic-release": "^17.1.2",
|
"semantic-release": "^17.1.2",
|
||||||
"ts-jest": "^26.4.0",
|
"ts-jest": "^26.4.0",
|
||||||
"typescript": "^4.0.3"
|
"typescript": "^4.0.3"
|
||||||
|
|
|
@ -1,5 +1,5 @@
|
||||||
import { Context, Recogniser } from '.';
|
import { Context, Recogniser } from '.';
|
||||||
import match, { Match } from '../match'
|
import match, { Match } from '../match';
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* This is a superclass for the individual detectors for
|
* This is a superclass for the individual detectors for
|
||||||
|
|
|
@ -1,5 +1,5 @@
|
||||||
import { Context, Recogniser } from '.';
|
import { Context, Recogniser } from '.';
|
||||||
import match, { Match } from '../match'
|
import match, { Match } from '../match';
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Binary search implementation (recursive)
|
* Binary search implementation (recursive)
|
||||||
|
@ -108,7 +108,7 @@ class mbcs implements Recogniser {
|
||||||
const iter = new IteratedChar();
|
const iter = new IteratedChar();
|
||||||
|
|
||||||
detectBlock: {
|
detectBlock: {
|
||||||
for (iter.reset(); this.nextChar(iter, det);) {
|
for (iter.reset(); this.nextChar(iter, det); ) {
|
||||||
totalCharCount++;
|
totalCharCount++;
|
||||||
if (iter.error) {
|
if (iter.error) {
|
||||||
badCharCount++;
|
badCharCount++;
|
||||||
|
@ -275,7 +275,7 @@ export class sjis extends mbcs {
|
||||||
iter.index = iter.nextIndex;
|
iter.index = iter.nextIndex;
|
||||||
iter.error = false;
|
iter.error = false;
|
||||||
|
|
||||||
const firstByte = iter.charValue = iter.nextByte(det);
|
const firstByte = (iter.charValue = iter.nextByte(det));
|
||||||
if (firstByte < 0) return false;
|
if (firstByte < 0) return false;
|
||||||
|
|
||||||
if (firstByte <= 0x7f || (firstByte > 0xa0 && firstByte <= 0xdf))
|
if (firstByte <= 0x7f || (firstByte > 0xa0 && firstByte <= 0xdf))
|
||||||
|
|
|
@ -69,7 +69,7 @@ class UTF_32 implements Recogniser, WithGetChar {
|
||||||
numInvalid = 0,
|
numInvalid = 0,
|
||||||
hasBOM = false,
|
hasBOM = false,
|
||||||
confidence = 0;
|
confidence = 0;
|
||||||
const limit = (det.fRawLength / 4) * 4
|
const limit = (det.fRawLength / 4) * 4;
|
||||||
const input = det.fRawInput;
|
const input = det.fRawInput;
|
||||||
|
|
||||||
if (limit == 0) {
|
if (limit == 0) {
|
||||||
|
|
|
@ -12,7 +12,7 @@ export default class Utf8 implements Recogniser {
|
||||||
numInvalid = 0,
|
numInvalid = 0,
|
||||||
trailBytes = 0,
|
trailBytes = 0,
|
||||||
confidence;
|
confidence;
|
||||||
const input = det.fRawInput
|
const input = det.fRawInput;
|
||||||
|
|
||||||
if (
|
if (
|
||||||
det.fRawLength >= 3 &&
|
det.fRawLength >= 3 &&
|
||||||
|
@ -42,7 +42,7 @@ export default class Utf8 implements Recogniser {
|
||||||
}
|
}
|
||||||
|
|
||||||
// Verify that we've got the right number of trail bytes in the sequence
|
// Verify that we've got the right number of trail bytes in the sequence
|
||||||
for (; ;) {
|
for (;;) {
|
||||||
i++;
|
i++;
|
||||||
if (i >= det.fRawLength) break;
|
if (i >= det.fRawLength) break;
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue