@konstit/dne 0.2.0 → 0.3.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +42 -35
- package/dist/address-search-index.d.ts +34 -0
- package/dist/address-search-index.js +326 -0
- package/dist/address-search-index.js.map +1 -0
- package/dist/address-search-pool-errors.d.ts +15 -0
- package/dist/address-search-pool-errors.js +25 -0
- package/dist/address-search-pool-errors.js.map +1 -0
- package/dist/address-search-pool.d.ts +40 -0
- package/dist/address-search-pool.js +215 -0
- package/dist/address-search-pool.js.map +1 -0
- package/dist/address-search-rank.d.ts +5 -0
- package/dist/address-search-rank.js +89 -0
- package/dist/address-search-rank.js.map +1 -0
- package/dist/address-search-text.d.ts +6 -0
- package/dist/address-search-text.js +16 -0
- package/dist/address-search-text.js.map +1 -0
- package/dist/address-search-worker-runtime.d.ts +41 -0
- package/dist/address-search-worker-runtime.js +38 -0
- package/dist/address-search-worker-runtime.js.map +1 -0
- package/dist/address-search-worker-source.d.ts +2 -0
- package/dist/address-search-worker-source.js +5 -0
- package/dist/address-search-worker-source.js.map +1 -0
- package/dist/address-search.d.ts +31 -0
- package/dist/address-search.js +152 -0
- package/dist/address-search.js.map +1 -0
- package/dist/binary-db-errors.d.ts +1 -1
- package/dist/binary-db-errors.js +1 -1
- package/dist/binary-db-errors.js.map +1 -1
- package/dist/binary-db-reader.d.ts +18 -12
- package/dist/binary-db-reader.js +64 -43
- package/dist/binary-db-reader.js.map +1 -1
- package/dist/binary-db-validator.js +3 -6
- package/dist/binary-db-validator.js.map +1 -1
- package/dist/chunks/dynamic-completion-wbp85hh9-cytdw6ns.js +7 -0
- package/dist/chunks/dynamic-completion-wbp85hh9-cytdw6ns.js.map +10 -0
- package/dist/chunks/index-338dn00y.js +18 -0
- package/dist/chunks/index-338dn00y.js.map +10 -0
- package/dist/expand.d.ts +8 -0
- package/dist/expand.js +1484 -0
- package/dist/expand.js.map +1 -0
- package/dist/fsst.d.ts +1 -1
- package/dist/index.js +48 -48
- package/dist/index.js.map +25 -20
- package/dist/library.d.ts +9 -2
- package/dist/library.js +9 -2
- package/dist/library.js.map +1 -1
- package/dist/settings.d.ts +0 -2
- package/dist/settings.js +0 -2
- package/dist/settings.js.map +1 -1
- package/dist/shared-file.d.ts +2 -0
- package/dist/shared-file.js +35 -0
- package/dist/shared-file.js.map +1 -0
- package/dist/sqlite-db-reader.d.ts +13 -4
- package/dist/sqlite-db-reader.js +39 -17
- package/dist/sqlite-db-reader.js.map +1 -1
- package/dist/types.d.ts +29 -4
- package/dist/types.js +73 -4
- package/dist/types.js.map +1 -1
- package/package.json +13 -10
- package/data/dne.bin +0 -0
- package/dist/chunks/dynamic-completion-403da357-4jc4w04x.js +0 -7
- package/dist/chunks/dynamic-completion-403da357-4jc4w04x.js.map +0 -10
- package/dist/chunks/index-s0h4vdva.js +0 -17
- package/dist/chunks/index-s0h4vdva.js.map +0 -10
package/README.md
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
# @konstit/dne: CEPs do Brasil
|
|
2
2
|
|
|
3
|
-
|
|
3
|
+
Crie e consulte bases locais de CEPs do Brasil em aplicações Bun a partir de dados do e-DNE dos Correios. Informe um diretório, arquivo ZIP ou URL com `--source` para gerar uma base SQLite ou binária. As consultas funcionam offline, sem servidor.
|
|
4
4
|
|
|
5
5
|
Consulte os [benchmarks de leitura e importação](https://github.com/Konstit-Engenharia/konstit-dne/blob/main/docs/performance.md) para os resultados medidos em cada formato.
|
|
6
6
|
|
|
@@ -9,12 +9,13 @@ Consulte os [benchmarks de leitura e importação](https://github.com/Konstit-En
|
|
|
9
9
|
- Bun 1.4 ou mais recente
|
|
10
10
|
- macOS ou Linux
|
|
11
11
|
|
|
12
|
-
## Início rápido
|
|
12
|
+
## Início rápido
|
|
13
13
|
|
|
14
14
|
Instale o pacote:
|
|
15
15
|
|
|
16
16
|
```sh
|
|
17
17
|
bun add @konstit/dne
|
|
18
|
+
bunx @konstit/dne build --format binary --db ./dne.bin --source ./eDNE_Basico.zip
|
|
18
19
|
```
|
|
19
20
|
|
|
20
21
|
Salve como `consulta.ts`:
|
|
@@ -22,32 +23,31 @@ Salve como `consulta.ts`:
|
|
|
22
23
|
```typescript
|
|
23
24
|
import { DneBinaryDatabaseReader } from '@konstit/dne';
|
|
24
25
|
|
|
25
|
-
const db = new DneBinaryDatabaseReader();
|
|
26
|
-
|
|
27
|
-
|
|
28
|
-
} finally {
|
|
29
|
-
db.close();
|
|
30
|
-
}
|
|
26
|
+
const db = new DneBinaryDatabaseReader('./dne.bin');
|
|
27
|
+
console.log(db.queryCep('01141-000'));
|
|
28
|
+
db.close();
|
|
31
29
|
```
|
|
32
30
|
|
|
33
31
|
Execute com `bun consulta.ts`. Saída para a base usada neste exemplo:
|
|
34
32
|
|
|
35
|
-
```
|
|
33
|
+
```text
|
|
36
34
|
{
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
43
|
-
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
35
|
+
bairro: "Várzea da Barra Funda",
|
|
36
|
+
cep: "01141000",
|
|
37
|
+
complemento: null,
|
|
38
|
+
localidade_situacao: "codificada_por_logradouro",
|
|
39
|
+
localidade_tipo: "municipio",
|
|
40
|
+
logradouro: "Rua Rubens Meireles",
|
|
41
|
+
municipio: "São Paulo",
|
|
42
|
+
municipio_cod_ibge: 3550308,
|
|
43
|
+
nome: null,
|
|
44
|
+
uf: "SP",
|
|
47
45
|
}
|
|
48
46
|
```
|
|
49
47
|
|
|
50
|
-
O leitor
|
|
48
|
+
O leitor exige o caminho de uma base existente. Caminhos relativos usam o diretório de trabalho. Para atualizar os dados, execute novamente `build` com a fonte desejada e abra outro leitor.
|
|
49
|
+
|
|
50
|
+
Arquivos físicos e assets importados pela aplicação são lidos integralmente em memória. As consultas usam essa cópia até o leitor ser fechado. Para distribuir seus dados com um bundle ou executável Bun, consulte o [guia de distribuição](docs/address-search.md#bundles-e-executáveis-do-bun).
|
|
51
51
|
|
|
52
52
|
`queryCep()` aceita `01141000` ou `01141-000` e retorna `undefined` para CEPs inválidos ou ausentes. Consulte a [referência da API](https://github.com/Konstit-Engenharia/konstit-dne/blob/main/docs/api.md) para consultas de bairros e faixas de CEP, tipos e tratamento de erros.
|
|
53
53
|
|
|
@@ -55,48 +55,54 @@ O leitor abre a base incluída no pacote, independentemente do diretório de tra
|
|
|
55
55
|
|
|
56
56
|
| Necessidade | Formato | Como usar |
|
|
57
57
|
| ---------------------------------------------- | ------- | ------------------------------- |
|
|
58
|
-
| Consultar
|
|
59
|
-
| Gerar uma base compacta para consultas por CEP | Binário | `build --format binary`
|
|
60
|
-
| Executar SQL ou integrar ferramentas SQLite | SQLite | `build --db ./dne.db`
|
|
58
|
+
| Consultar uma base compacta | Binário | `new DneBinaryDatabaseReader('./dne.bin')` |
|
|
59
|
+
| Gerar uma base compacta para consultas por CEP | Binário | `build --format binary --source ./eDNE_Basico.zip` |
|
|
60
|
+
| Executar SQL ou integrar ferramentas SQLite | SQLite | `build --db ./dne.db --source ./eDNE_Basico.zip` |
|
|
61
61
|
|
|
62
62
|
Os dois leitores oferecem consultas por CEP, bairro e faixas de CEP. O leitor binário também oferece `queryMunicipality(municipioCodIbge)`, que retorna `{ municipio, uf }` a partir do código IBGE, e `queryMunicipalityCodesByUf(uf)`, que lista os códigos IBGE de uma UF. Para abrir arquivos próprios na API, use `new DneBinaryDatabaseReader('/dados/dne.bin')` ou `new DneDatabaseReader('/dados/dne.db')`, importados de `@konstit/dne`.
|
|
63
63
|
|
|
64
64
|
Na geração do banco binário, o processo valida integralmente os bytes serializados antes de calcular o hash. Cada arquivo termina com um rodapé SHA-256 sobre todos os bytes anteriores, incluindo o cabeçalho e o preenchimento de alinhamento.
|
|
65
65
|
|
|
66
|
-
O fluxo pressupõe uma base gerada por um processo confiável e mantida imutável durante o
|
|
66
|
+
O fluxo pressupõe uma base gerada por um processo confiável e mantida imutável durante o carregamento. A abertura verifica cabeçalho, versão, tamanho e checksum antes de usar o layout validado. As consultas verificam a entrada e o estado de `close()` e decodificam diretamente da cópia em memória. Os erros de E/S, versão, tamanho, checksum e leitor fechado continuam tipados. O SHA-256 verifica a integridade do arquivo, mas não autentica a origem do produtor. A especificação do layout está em [Formato binário](docs/binary-layout.md).
|
|
67
|
+
|
|
68
|
+
## Autocomplete de endereços
|
|
69
|
+
|
|
70
|
+
A API `DneAddressSearch` pesquisa endereços por palavras e prefixo, com filtros por UF e código IBGE. Um CEP completo no texto pode determinar o município da busca. Gere o índice opcional com `bunx @konstit/dne build-search-index --db ./dne.bin`; veja [autocomplete de endereços](docs/address-search.md) para exemplos e regras.
|
|
71
|
+
|
|
72
|
+
Para endpoints, `DneAddressSearchPool` oferece a mesma busca de forma assíncrona em workers nativos persistentes do Bun, compartilhando os bytes da base e do índice via `SharedArrayBuffer`, com fila limitada e cancelamento por `AbortSignal`. O código dos workers acompanha a biblioteca e é iniciado por Blob URL, permitindo [bundles e executáveis do Bun](docs/address-search.md#bundles-e-executáveis-do-bun). Veja a [API do pool](docs/address-search.md#pool-assíncrono-de-workers) e o [exemplo documentado com `Bun.serve`](examples/README.md).
|
|
67
73
|
|
|
68
74
|
## CLI: criar e consultar sua própria base
|
|
69
75
|
|
|
70
|
-
Execute sem instalação global.
|
|
76
|
+
Execute sem instalação global. Forneça o arquivo e-DNE para criar uma base SQLite e consultar um CEP.
|
|
71
77
|
|
|
72
78
|
```sh
|
|
73
|
-
bunx @konstit/dne build --db ./dne.db
|
|
79
|
+
bunx @konstit/dne build --db ./dne.db --source ./eDNE_Basico.zip
|
|
74
80
|
bunx @konstit/dne get 01001-000 --db ./dne.db --json
|
|
75
81
|
```
|
|
76
82
|
|
|
77
83
|
Para gerar e consultar uma base binária:
|
|
78
84
|
|
|
79
85
|
```sh
|
|
80
|
-
bunx @konstit/dne build --format binary --db ./dne.bin
|
|
86
|
+
bunx @konstit/dne build --format binary --db ./dne.bin --source ./eDNE_Basico.zip
|
|
81
87
|
bunx @konstit/dne get 01001-000 --db ./dne.bin --json
|
|
82
88
|
```
|
|
83
89
|
|
|
84
|
-
A CLI usa `./dne.db` por padrão
|
|
90
|
+
A CLI usa `./dne.db` por padrão. `build --format binary` gera `./dne.bin` por padrão. Informe `--db` para consultar outro arquivo. `get`, `status` e `schema` detectam o formato do arquivo informado. O comando `sql` exige SQLite.
|
|
85
91
|
|
|
86
92
|
### Criar e atualizar
|
|
87
93
|
|
|
88
|
-
`build`
|
|
94
|
+
`build` exige `--source` com uma URL, um ZIP local ou um diretório com os arquivos do e-DNE. Ao usar uma fonte remota, repetir o comando atualiza a base somente quando necessário. `--check` verifica a fonte sem alterar a base.
|
|
89
95
|
|
|
90
96
|
```sh
|
|
91
97
|
bunx @konstit/dne build --db ./dne.db --source ./eDNE_Basico.zip
|
|
92
|
-
bunx @konstit/dne build --db ./dne.db --check --json
|
|
98
|
+
bunx @konstit/dne build --db ./dne.db --source ./eDNE_Basico.zip --check --json
|
|
93
99
|
bunx @konstit/dne status --db ./dne.db --json
|
|
94
100
|
```
|
|
95
101
|
|
|
96
102
|
Para agendar a atualização semanal de uma base SQLite no Linux ou macOS:
|
|
97
103
|
|
|
98
104
|
```sh
|
|
99
|
-
bunx @konstit/dne cron install --db ./dne.db
|
|
105
|
+
bunx @konstit/dne cron install --db ./dne.db --source https://example.com/eDNE_Basico.zip
|
|
100
106
|
```
|
|
101
107
|
|
|
102
108
|
O agendamento padrão executa à meia-noite de sexta-feira e fixa a versão atual do pacote. Consulte [atualização automática](https://github.com/Konstit-Engenharia/konstit-dne/blob/main/docs/cli.md#atualização-automática) para alterar a agenda, verificar o job ou removê-lo.
|
|
@@ -113,15 +119,15 @@ As consultas abrem a base somente para leitura. `--json` grava os dados em stdou
|
|
|
113
119
|
|
|
114
120
|
## Desempenho
|
|
115
121
|
|
|
116
|
-
No benchmark de **
|
|
122
|
+
No benchmark de **02/10/2026**, em um **Apple M4 com Bun 1.4.2**, o leitor binário v5 foi **19,2× mais rápido que o leitor SQLite de esquema 4** da biblioteca na mesma carga:
|
|
117
123
|
|
|
118
124
|
| Métrica | Binário | SQLite |
|
|
119
125
|
| ---------------------------------------------- | ---------------: | --------: |
|
|
120
|
-
| Mediana por 100 mil consultas | **27,
|
|
121
|
-
| Consultas por segundo, calculadas pela mediana | **3,
|
|
126
|
+
| Mediana por 100 mil consultas | **27,63 ms** | 531,46 ms |
|
|
127
|
+
| Consultas por segundo, calculadas pela mediana | **3,62 milhões** | 188,2 mil |
|
|
122
128
|
| Tamanho da base | **19,12 MB** | 109,22 MB |
|
|
123
129
|
|
|
124
|
-
A base continha 1.611.629 CEPs. Cada formato foi medido em três processos, com duas rodadas de aquecimento e nove medições de 50 mil CEPs existentes e 50 mil ausentes. A tabela usa a mediana das três medianas. Os tempos excluem a abertura da base; os tamanhos estão em MB decimais.
|
|
130
|
+
A base continha 1.611.629 CEPs. O leitor binário atual carrega o arquivo integralmente em memória com `readFileSync()`. Cada formato foi medido em três processos, com duas rodadas de aquecimento e nove medições de 50 mil CEPs existentes e 50 mil ausentes. A tabela usa a mediana das três medianas. Os tempos excluem a abertura da base; os tamanhos estão em MB decimais.
|
|
125
131
|
|
|
126
132
|
Veja a [metodologia, os comandos de reprodução e os tempos de geração dos bancos](https://github.com/Konstit-Engenharia/konstit-dne/blob/main/docs/performance.md).
|
|
127
133
|
|
|
@@ -130,6 +136,7 @@ Veja a [metodologia, os comandos de reprodução e os tempos de geração dos ba
|
|
|
130
136
|
| Referência | Conteúdo |
|
|
131
137
|
| ---------------------------------------------------------------------------------------------------- | ---------------------------------------------------------------------- |
|
|
132
138
|
| [API](https://github.com/Konstit-Engenharia/konstit-dne/blob/main/docs/api.md) | Leitores, bairros, faixas de CEP, tipos e exceções. |
|
|
139
|
+
| [Exemplos executáveis](examples/README.md) | Todas as APIs públicas: leitores, busca, pool, helpers, tipos e erros. |
|
|
133
140
|
| [CLI](https://github.com/Konstit-Engenharia/konstit-dne/blob/main/docs/cli.md) | Comandos, fontes, atualização automática, JSON e concorrência. |
|
|
134
141
|
| [SQLite e Drizzle](https://github.com/Konstit-Engenharia/konstit-dne/blob/main/docs/sqlite.md) | Tabelas, views, indicadores de localidade e migração de bases. |
|
|
135
142
|
| [Formato binário](https://github.com/Konstit-Engenharia/konstit-dne/blob/main/docs/binary-layout.md) | Especificação para implementar leitores em outras linguagens. |
|
|
@@ -0,0 +1,34 @@
|
|
|
1
|
+
import { type ByteWidth } from './binary-db-format.ts';
|
|
2
|
+
import type { DneBinaryDatabaseReader } from './binary-db-reader.ts';
|
|
3
|
+
import { type UF } from './types.ts';
|
|
4
|
+
/** Numeric field sequences retain word positions; geography uses dense municipality IDs. */
|
|
5
|
+
export type AddressSearchIndex = {
|
|
6
|
+
data: DataView;
|
|
7
|
+
terms: string[];
|
|
8
|
+
offsets: number;
|
|
9
|
+
postings: Uint8Array;
|
|
10
|
+
rowCount: number;
|
|
11
|
+
rowMunicipalities: number;
|
|
12
|
+
rowFields: number;
|
|
13
|
+
fieldOffsets: number;
|
|
14
|
+
fieldCount: number;
|
|
15
|
+
fieldTokens: number;
|
|
16
|
+
fieldWidth: ByteWidth;
|
|
17
|
+
tokenWidth: ByteWidth;
|
|
18
|
+
municipalityWidth: ByteWidth;
|
|
19
|
+
municipalityCodes: number[];
|
|
20
|
+
municipalityUfs: UF[];
|
|
21
|
+
municipalityByCode: Map<number, number>;
|
|
22
|
+
};
|
|
23
|
+
/** Builds an optional, versioned search index bound to the reader's exact database snapshot. */
|
|
24
|
+
export declare function buildAddressSearchIndex(database: DneBinaryDatabaseReader): Uint8Array;
|
|
25
|
+
/** Validates integrity, source identity, and every range before queries can use the index. */
|
|
26
|
+
export declare function parseAddressSearchIndex(bytes: Uint8Array, checksum: string, rowCount: number): AddressSearchIndex;
|
|
27
|
+
/** Visits an ordered posting without materializing it, checking delta and range invariants. */
|
|
28
|
+
export declare function visitSearchPosting(index: AddressSearchIndex, id: number, visit?: (row: number) => void): void;
|
|
29
|
+
/** Resolves an index row ID to the eight-digit CEP used by the database reader. */
|
|
30
|
+
export declare function searchRowCep(index: AddressSearchIndex, id: number): string;
|
|
31
|
+
/** Reads geographic membership directly, without enumerating any geographic posting list. */
|
|
32
|
+
export declare function searchRowMunicipality(index: AddressSearchIndex, id: number): number;
|
|
33
|
+
/** Finds a CEP anchor using the search index, without decoding an address. */
|
|
34
|
+
export declare function findSearchCep(index: AddressSearchIndex, cep: string): number;
|
|
@@ -0,0 +1,326 @@
|
|
|
1
|
+
import { createHash } from 'node:crypto';
|
|
2
|
+
import { addressTokens } from "./address-search-text.js";
|
|
3
|
+
import { integerByteWidth, readByteWidth, readPackedInteger, writePackedInteger, } from "./binary-db-format.js";
|
|
4
|
+
import { ALL_UFS, } from "./types.js";
|
|
5
|
+
const MAGIC = 'DNESRCH1';
|
|
6
|
+
const VERSION = 2;
|
|
7
|
+
const HEADER_SIZE = 80;
|
|
8
|
+
const DIGEST_SIZE = 32;
|
|
9
|
+
/** Builds an optional, versioned search index bound to the reader's exact database snapshot. */
|
|
10
|
+
export function buildAddressSearchIndex(database) {
|
|
11
|
+
const checksum = database.checksum();
|
|
12
|
+
const rowCount = database.rowCount();
|
|
13
|
+
const ceps = new Uint32Array(rowCount);
|
|
14
|
+
const rowMunicipalities = new Uint32Array(rowCount);
|
|
15
|
+
const rowFields = new Uint32Array(rowCount * 4);
|
|
16
|
+
const municipalities = [];
|
|
17
|
+
const municipalityIds = new Map();
|
|
18
|
+
const terms = [];
|
|
19
|
+
const termIds = new Map();
|
|
20
|
+
const lists = [];
|
|
21
|
+
const fields = [[]];
|
|
22
|
+
const fieldIds = new Map([['', 0]]);
|
|
23
|
+
const localityTokens = new Map();
|
|
24
|
+
const tokenizeLocality = (text) => {
|
|
25
|
+
let tokens = localityTokens.get(text);
|
|
26
|
+
if (!tokens) {
|
|
27
|
+
tokens = addressTokens(text);
|
|
28
|
+
localityTokens.set(text, tokens);
|
|
29
|
+
}
|
|
30
|
+
return tokens;
|
|
31
|
+
};
|
|
32
|
+
let rowId = 0;
|
|
33
|
+
for (const row of database.entries()) {
|
|
34
|
+
ceps[rowId] = Number(row.cep);
|
|
35
|
+
let municipality = municipalityIds.get(row.municipio_cod_ibge);
|
|
36
|
+
if (municipality === undefined) {
|
|
37
|
+
municipality = municipalities.length;
|
|
38
|
+
municipalityIds.set(row.municipio_cod_ibge, municipality);
|
|
39
|
+
municipalities.push({ code: row.municipio_cod_ibge, uf: row.uf });
|
|
40
|
+
}
|
|
41
|
+
rowMunicipalities[rowId] = municipality;
|
|
42
|
+
const rowTerms = new Set();
|
|
43
|
+
const texts = [
|
|
44
|
+
addressTokens(row.logradouro ?? ''),
|
|
45
|
+
addressTokens(row.nome ?? ''),
|
|
46
|
+
tokenizeLocality(row.bairro ?? ''),
|
|
47
|
+
tokenizeLocality(row.municipio),
|
|
48
|
+
];
|
|
49
|
+
for (const [column, words,] of texts.entries()) {
|
|
50
|
+
const text = words.join(' ');
|
|
51
|
+
let field = fieldIds.get(text);
|
|
52
|
+
if (field === undefined) {
|
|
53
|
+
field = fields.length;
|
|
54
|
+
fieldIds.set(text, field);
|
|
55
|
+
fields.push(words.map((word) => {
|
|
56
|
+
let term = termIds.get(word);
|
|
57
|
+
if (term === undefined) {
|
|
58
|
+
term = terms.length;
|
|
59
|
+
termIds.set(word, term);
|
|
60
|
+
terms.push(word);
|
|
61
|
+
lists.push([]);
|
|
62
|
+
}
|
|
63
|
+
return term;
|
|
64
|
+
}));
|
|
65
|
+
}
|
|
66
|
+
rowFields[rowId * 4 + column] = field;
|
|
67
|
+
for (const term of fields[field]) {
|
|
68
|
+
rowTerms.add(term);
|
|
69
|
+
}
|
|
70
|
+
}
|
|
71
|
+
for (const term of rowTerms) {
|
|
72
|
+
lists[term].push(rowId);
|
|
73
|
+
}
|
|
74
|
+
rowId++;
|
|
75
|
+
}
|
|
76
|
+
const sorted = [...terms.keys()].sort((a, b) => terms[a] < terms[b] ? -1 : 1);
|
|
77
|
+
const remap = new Uint32Array(terms.length);
|
|
78
|
+
for (const [id, original,] of sorted.entries()) {
|
|
79
|
+
remap[original] = id;
|
|
80
|
+
}
|
|
81
|
+
const lexicon = new TextEncoder().encode(JSON.stringify(sorted.map((id) => terms[id])));
|
|
82
|
+
const offsets = [0];
|
|
83
|
+
const chunks = sorted.map((id) => {
|
|
84
|
+
const chunk = encodePosting(lists[id]);
|
|
85
|
+
offsets.push(offsets[offsets.length - 1] + chunk.length);
|
|
86
|
+
return chunk;
|
|
87
|
+
});
|
|
88
|
+
const postingsLength = offsets[offsets.length - 1];
|
|
89
|
+
const fieldWidth = integerByteWidth(fields.length - 1);
|
|
90
|
+
const tokenWidth = integerByteWidth(terms.length - 1);
|
|
91
|
+
const municipalityWidth = integerByteWidth(municipalities.length - 1);
|
|
92
|
+
const tokenCount = fields.reduce((sum, field) => sum + field.length, 0);
|
|
93
|
+
const rowMunicipalitiesOffset = HEADER_SIZE + rowCount * 4;
|
|
94
|
+
const rowFieldsOffset = rowMunicipalitiesOffset + rowCount * municipalityWidth;
|
|
95
|
+
const municipalitiesOffset = rowFieldsOffset + rowCount * 4 * fieldWidth;
|
|
96
|
+
const fieldOffsets = municipalitiesOffset + municipalities.length * 6;
|
|
97
|
+
const fieldTokens = fieldOffsets + (fields.length + 1) * 4;
|
|
98
|
+
const postingOffsets = fieldTokens + tokenCount * tokenWidth;
|
|
99
|
+
const lexiconOffset = postingOffsets + offsets.length * 4;
|
|
100
|
+
const bytes = new Uint8Array(lexiconOffset + lexicon.length + postingsLength + DIGEST_SIZE);
|
|
101
|
+
const data = new DataView(bytes.buffer);
|
|
102
|
+
bytes.set(new TextEncoder().encode(MAGIC));
|
|
103
|
+
for (const [offset, value,] of [
|
|
104
|
+
[8, VERSION],
|
|
105
|
+
[12, rowCount],
|
|
106
|
+
[16, lexicon.length],
|
|
107
|
+
[20, terms.length],
|
|
108
|
+
[24, postingsLength],
|
|
109
|
+
[28, fields.length],
|
|
110
|
+
[64, tokenCount],
|
|
111
|
+
[68, municipalities.length],
|
|
112
|
+
]) {
|
|
113
|
+
data.setUint32(offset, value, true);
|
|
114
|
+
}
|
|
115
|
+
bytes.set(Buffer.from(checksum, 'hex'), 32);
|
|
116
|
+
bytes.set([fieldWidth, tokenWidth, municipalityWidth], 72);
|
|
117
|
+
for (let id = 0; id < rowCount; id++) {
|
|
118
|
+
data.setUint32(HEADER_SIZE + id * 4, ceps[id], true);
|
|
119
|
+
writePackedInteger(bytes, rowMunicipalitiesOffset + id * municipalityWidth, rowMunicipalities[id], municipalityWidth);
|
|
120
|
+
for (let column = 0; column < 4; column++) {
|
|
121
|
+
writePackedInteger(bytes, rowFieldsOffset + (id * 4 + column) * fieldWidth, rowFields[id * 4 + column], fieldWidth);
|
|
122
|
+
}
|
|
123
|
+
}
|
|
124
|
+
for (const [id, { code, uf },] of municipalities.entries()) {
|
|
125
|
+
data.setUint32(municipalitiesOffset + id * 6, code, true);
|
|
126
|
+
bytes.set([uf.charCodeAt(0), uf.charCodeAt(1)], municipalitiesOffset + id * 6 + 4);
|
|
127
|
+
}
|
|
128
|
+
let position = 0;
|
|
129
|
+
for (const [id, field,] of fields.entries()) {
|
|
130
|
+
data.setUint32(fieldOffsets + id * 4, position, true);
|
|
131
|
+
for (const term of field) {
|
|
132
|
+
writePackedInteger(bytes, fieldTokens + position++ * tokenWidth, remap[term], tokenWidth);
|
|
133
|
+
}
|
|
134
|
+
}
|
|
135
|
+
data.setUint32(fieldOffsets + fields.length * 4, position, true);
|
|
136
|
+
for (const [id, offset,] of offsets.entries()) {
|
|
137
|
+
data.setUint32(postingOffsets + id * 4, offset, true);
|
|
138
|
+
}
|
|
139
|
+
bytes.set(lexicon, lexiconOffset);
|
|
140
|
+
let offset = lexiconOffset + lexicon.length;
|
|
141
|
+
for (const chunk of chunks) {
|
|
142
|
+
bytes.set(chunk, offset);
|
|
143
|
+
offset += chunk.length;
|
|
144
|
+
}
|
|
145
|
+
bytes.set(digest(bytes.subarray(0, -DIGEST_SIZE)), offset);
|
|
146
|
+
parseAddressSearchIndex(bytes, checksum, rowCount);
|
|
147
|
+
return bytes;
|
|
148
|
+
}
|
|
149
|
+
/** Validates integrity, source identity, and every range before queries can use the index. */
|
|
150
|
+
export function parseAddressSearchIndex(bytes, checksum, rowCount) {
|
|
151
|
+
if (bytes.length < HEADER_SIZE + DIGEST_SIZE || new TextDecoder().decode(bytes.subarray(0, 8)) !== MAGIC) {
|
|
152
|
+
throw new Error('Invalid address search index header');
|
|
153
|
+
}
|
|
154
|
+
const data = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);
|
|
155
|
+
if (data.getUint32(8, true) !== VERSION) {
|
|
156
|
+
throw new Error('Unsupported address search index version; rebuild the search index');
|
|
157
|
+
}
|
|
158
|
+
if (!digest(bytes.subarray(0, -DIGEST_SIZE)).equals(bytes.subarray(-DIGEST_SIZE))) {
|
|
159
|
+
throw new Error('Invalid address search index checksum');
|
|
160
|
+
}
|
|
161
|
+
if (Buffer.from(bytes.subarray(32, 64)).toString('hex') !== checksum || data.getUint32(12, true) !== rowCount) {
|
|
162
|
+
throw new Error('Address search index belongs to a different database');
|
|
163
|
+
}
|
|
164
|
+
const lexiconLength = data.getUint32(16, true);
|
|
165
|
+
const count = data.getUint32(20, true);
|
|
166
|
+
const postingsLength = data.getUint32(24, true);
|
|
167
|
+
const fieldCount = data.getUint32(28, true);
|
|
168
|
+
const tokenCount = data.getUint32(64, true);
|
|
169
|
+
const municipalityCount = data.getUint32(68, true);
|
|
170
|
+
const fieldWidth = readByteWidth(data.getUint8(72), 'search field');
|
|
171
|
+
const tokenWidth = readByteWidth(data.getUint8(73), 'search token');
|
|
172
|
+
const municipalityWidth = readByteWidth(data.getUint8(74), 'search municipality');
|
|
173
|
+
const rowMunicipalities = HEADER_SIZE + rowCount * 4;
|
|
174
|
+
const rowFields = rowMunicipalities + rowCount * municipalityWidth;
|
|
175
|
+
const municipalities = rowFields + rowCount * 4 * fieldWidth;
|
|
176
|
+
const fieldOffsets = municipalities + municipalityCount * 6;
|
|
177
|
+
const fieldTokens = fieldOffsets + (fieldCount + 1) * 4;
|
|
178
|
+
const offsets = fieldTokens + tokenCount * tokenWidth;
|
|
179
|
+
const lexiconOffset = offsets + (count + 1) * 4;
|
|
180
|
+
const postingsOffset = lexiconOffset + lexiconLength;
|
|
181
|
+
if (!fieldCount || !municipalityCount || data.getUint8(75) !== 0 || data.getUint32(76, true) !== 0
|
|
182
|
+
|| postingsOffset + postingsLength + DIGEST_SIZE !== bytes.length) {
|
|
183
|
+
throw new Error('Invalid address search index size');
|
|
184
|
+
}
|
|
185
|
+
const terms = JSON.parse(new TextDecoder('utf-8', { fatal: true }).decode(bytes.subarray(lexiconOffset, postingsOffset)));
|
|
186
|
+
if (!Array.isArray(terms) || terms.length !== count
|
|
187
|
+
|| terms.some((term, id) => typeof term !== 'string' || !/^[a-z0-9]+$/.test(term) || (id > 0 && terms[id - 1] >= term))) {
|
|
188
|
+
throw new Error('Invalid address search vocabulary');
|
|
189
|
+
}
|
|
190
|
+
const index = {
|
|
191
|
+
data,
|
|
192
|
+
terms,
|
|
193
|
+
offsets,
|
|
194
|
+
postings: bytes.subarray(postingsOffset, -DIGEST_SIZE),
|
|
195
|
+
rowCount,
|
|
196
|
+
rowMunicipalities,
|
|
197
|
+
rowFields,
|
|
198
|
+
fieldOffsets,
|
|
199
|
+
fieldCount,
|
|
200
|
+
fieldTokens,
|
|
201
|
+
fieldWidth,
|
|
202
|
+
tokenWidth,
|
|
203
|
+
municipalityWidth,
|
|
204
|
+
municipalityCodes: [],
|
|
205
|
+
municipalityUfs: [],
|
|
206
|
+
municipalityByCode: new Map(),
|
|
207
|
+
};
|
|
208
|
+
for (let id = 0; id < municipalityCount; id++) {
|
|
209
|
+
const code = data.getUint32(municipalities + id * 6, true);
|
|
210
|
+
const uf = String.fromCharCode(data.getUint8(municipalities + id * 6 + 4), data.getUint8(municipalities + id * 6 + 5));
|
|
211
|
+
if (code < 1_000_000 || code > 9_999_999 || !ALL_UFS.includes(uf) || index.municipalityByCode.has(code)) {
|
|
212
|
+
throw new Error('Invalid address search municipality');
|
|
213
|
+
}
|
|
214
|
+
index.municipalityCodes.push(code);
|
|
215
|
+
index.municipalityUfs.push(uf);
|
|
216
|
+
index.municipalityByCode.set(code, id);
|
|
217
|
+
}
|
|
218
|
+
let previous = -1;
|
|
219
|
+
for (let id = 0; id < rowCount; id++) {
|
|
220
|
+
const cep = data.getUint32(HEADER_SIZE + id * 4, true);
|
|
221
|
+
if (cep <= previous || cep > 99_999_999) {
|
|
222
|
+
throw new Error('Invalid address search CEP');
|
|
223
|
+
}
|
|
224
|
+
previous = cep;
|
|
225
|
+
if (searchRowMunicipality(index, id) >= municipalityCount) {
|
|
226
|
+
throw new Error('Invalid address search municipality reference');
|
|
227
|
+
}
|
|
228
|
+
for (let column = 0; column < 4; column++) {
|
|
229
|
+
if (readPackedInteger(data, rowFields + (id * 4 + column) * fieldWidth, fieldWidth) >= fieldCount) {
|
|
230
|
+
throw new Error('Invalid address search field reference');
|
|
231
|
+
}
|
|
232
|
+
}
|
|
233
|
+
}
|
|
234
|
+
if (data.getUint32(fieldOffsets, true) !== 0 || data.getUint32(fieldOffsets + fieldCount * 4, true) !== tokenCount) {
|
|
235
|
+
throw new Error('Invalid address search field offsets');
|
|
236
|
+
}
|
|
237
|
+
for (let id = 0; id < fieldCount; id++) {
|
|
238
|
+
const start = data.getUint32(fieldOffsets + id * 4, true);
|
|
239
|
+
const end = data.getUint32(fieldOffsets + (id + 1) * 4, true);
|
|
240
|
+
if (end < start || end > tokenCount) {
|
|
241
|
+
throw new Error('Invalid address search field range');
|
|
242
|
+
}
|
|
243
|
+
}
|
|
244
|
+
for (let id = 0; id < tokenCount; id++) {
|
|
245
|
+
if (readPackedInteger(data, fieldTokens + id * tokenWidth, tokenWidth) >= count) {
|
|
246
|
+
throw new Error('Invalid address search field token');
|
|
247
|
+
}
|
|
248
|
+
}
|
|
249
|
+
if (data.getUint32(offsets, true) !== 0 || data.getUint32(offsets + count * 4, true) !== postingsLength) {
|
|
250
|
+
throw new Error('Invalid address search posting offsets');
|
|
251
|
+
}
|
|
252
|
+
for (let id = 0; id < count; id++) {
|
|
253
|
+
visitSearchPosting(index, id);
|
|
254
|
+
}
|
|
255
|
+
return index;
|
|
256
|
+
}
|
|
257
|
+
/** Visits an ordered posting without materializing it, checking delta and range invariants. */
|
|
258
|
+
export function visitSearchPosting(index, id, visit) {
|
|
259
|
+
let offset = index.data.getUint32(index.offsets + id * 4, true);
|
|
260
|
+
const end = index.data.getUint32(index.offsets + (id + 1) * 4, true);
|
|
261
|
+
if (end <= offset || end > index.postings.length) {
|
|
262
|
+
throw new Error('Invalid address search posting range');
|
|
263
|
+
}
|
|
264
|
+
let previous = -1;
|
|
265
|
+
while (offset < end) {
|
|
266
|
+
let delta = 0;
|
|
267
|
+
let factor = 1;
|
|
268
|
+
let byte;
|
|
269
|
+
do {
|
|
270
|
+
if (offset >= end || factor > 2 ** 28) {
|
|
271
|
+
throw new Error('Invalid address search posting encoding');
|
|
272
|
+
}
|
|
273
|
+
byte = index.postings[offset++];
|
|
274
|
+
delta += (byte & 127) * factor;
|
|
275
|
+
factor *= 128;
|
|
276
|
+
} while (byte & 128);
|
|
277
|
+
const row = previous + delta;
|
|
278
|
+
if (delta === 0 || row >= index.rowCount) {
|
|
279
|
+
throw new Error('Invalid address search posting row');
|
|
280
|
+
}
|
|
281
|
+
visit?.(row);
|
|
282
|
+
previous = row;
|
|
283
|
+
}
|
|
284
|
+
}
|
|
285
|
+
/** Resolves an index row ID to the eight-digit CEP used by the database reader. */
|
|
286
|
+
export function searchRowCep(index, id) {
|
|
287
|
+
return String(index.data.getUint32(HEADER_SIZE + id * 4, true)).padStart(8, '0');
|
|
288
|
+
}
|
|
289
|
+
/** Reads geographic membership directly, without enumerating any geographic posting list. */
|
|
290
|
+
export function searchRowMunicipality(index, id) {
|
|
291
|
+
return readPackedInteger(index.data, index.rowMunicipalities + id * index.municipalityWidth, index.municipalityWidth);
|
|
292
|
+
}
|
|
293
|
+
/** Finds a CEP anchor using the search index, without decoding an address. */
|
|
294
|
+
export function findSearchCep(index, cep) {
|
|
295
|
+
const wanted = Number(cep.replace('-', ''));
|
|
296
|
+
let low = 0;
|
|
297
|
+
let high = index.rowCount;
|
|
298
|
+
while (low < high) {
|
|
299
|
+
const middle = low + ((high - low) >>> 1);
|
|
300
|
+
if (index.data.getUint32(HEADER_SIZE + middle * 4, true) < wanted) {
|
|
301
|
+
low = middle + 1;
|
|
302
|
+
}
|
|
303
|
+
else {
|
|
304
|
+
high = middle;
|
|
305
|
+
}
|
|
306
|
+
}
|
|
307
|
+
return low < index.rowCount && index.data.getUint32(HEADER_SIZE + low * 4, true) === wanted ? low : -1;
|
|
308
|
+
}
|
|
309
|
+
function encodePosting(rows) {
|
|
310
|
+
const bytes = [];
|
|
311
|
+
let previous = -1;
|
|
312
|
+
for (const row of rows) {
|
|
313
|
+
let delta = row - previous;
|
|
314
|
+
while (delta >= 128) {
|
|
315
|
+
bytes.push((delta % 128) | 128);
|
|
316
|
+
delta = Math.floor(delta / 128);
|
|
317
|
+
}
|
|
318
|
+
bytes.push(delta);
|
|
319
|
+
previous = row;
|
|
320
|
+
}
|
|
321
|
+
return new Uint8Array(bytes);
|
|
322
|
+
}
|
|
323
|
+
function digest(bytes) {
|
|
324
|
+
return createHash('sha256').update(bytes).digest();
|
|
325
|
+
}
|
|
326
|
+
//# sourceMappingURL=address-search-index.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"address-search-index.js","sourceRoot":"","sources":["../src/address-search-index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACzD,OAAO,EACL,gBAAgB,EAChB,aAAa,EACb,iBAAiB,EACjB,kBAAkB,GAEnB,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EACL,OAAO,GAER,MAAM,YAAY,CAAC;AAEpB,MAAM,KAAK,GAAG,UAAU,CAAC;AACzB,MAAM,OAAO,GAAG,CAAC,CAAC;AAClB,MAAM,WAAW,GAAG,EAAE,CAAC;AACvB,MAAM,WAAW,GAAG,EAAE,CAAC;AAsBvB,gGAAgG;AAChG,MAAM,UAAU,uBAAuB,CAAC,QAAiC;IACvE,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC;IACrC,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC;IACrC,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;IACvC,MAAM,iBAAiB,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;IACpD,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;IAChD,MAAM,cAAc,GAAgC,EAAE,CAAC;IACvD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;IAClD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,MAAM,MAAM,GAAe,CAAC,EAAE,CAAC,CAAC;IAChC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAiB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAoB,CAAC;IACnD,MAAM,gBAAgB,GAAG,CAAC,IAAY,EAAY,EAAE;QAClD,IAAI,MAAM,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;YAC7B,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC;IACF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;QACrC,IAAI,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,YAAY,GAAG,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;QAC/D,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC/B,YAAY,GAAG,cAAc,CAAC,MAAM,CAAC;YACrC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,kBAAkB,EAAE,YAAY,CAAC,CAAC;YAC1D,cAAc,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,kBAAkB,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;QACpE,CAAC;QACD,iBAAiB,CAAC,KAAK,CAAC,GAAG,YAAY,CAAC;QACxC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,MAAM,KAAK,GAAG;YACZ,aAAa,CAAC,GAAG,CAAC,UAAU,IAAI,EAAE,CAAC;YACnC,aAAa,CAAC,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;YAC7B,gBAAgB,CAAC,GAAG,CAAC,MAAM,IAAI,EAAE,CAAC;YAClC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC;SAChC,CAAC;QACF,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC7B,IAAI,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC;gBACtB,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;gBAC1B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;oBAC7B,IAAI,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAC7B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;wBACvB,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC;wBACpB,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;wBACxB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;wBACjB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACjB,CAAC;oBACD,OAAO,IAAI,CAAC;gBACd,CAAC,CAAC,CAAC,CAAC;YACN,CAAC;YACD,SAAS,CAAC,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,KAAK,CAAC;YACtC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,CAAa,EAAE,CAAC;gBAC7C,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxC,CAAC;QACD,KAAK,EAAE,CAAC;IACV,CAAC;IAED,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAE,KAAK,CAAC,CAAC,CAAY,GAAI,KAAK,CAAC,CAAC,CAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtG,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC5C,KAAK,MAAM,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;QAC/C,KAAK,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;IACvB,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxF,MAAM,OAAO,GAAa,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;QAC/B,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,EAAE,CAAa,CAAC,CAAC;QACnD,OAAO,CAAC,IAAI,CAAE,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAY,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QACrE,OAAO,KAAK,CAAC;IACf,CAAC,CAAC,CAAC;IACH,MAAM,cAAc,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAW,CAAC;IAC7D,MAAM,UAAU,GAAG,gBAAgB,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACvD,MAAM,UAAU,GAAG,gBAAgB,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtD,MAAM,iBAAiB,GAAG,gBAAgB,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtE,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACxE,MAAM,uBAAuB,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,CAAC;IAC3D,MAAM,eAAe,GAAG,uBAAuB,GAAG,QAAQ,GAAG,iBAAiB,CAAC;IAC/E,MAAM,oBAAoB,GAAG,eAAe,GAAG,QAAQ,GAAG,CAAC,GAAG,UAAU,CAAC;IACzE,MAAM,YAAY,GAAG,oBAAoB,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;IACtE,MAAM,WAAW,GAAG,YAAY,GAAG,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC3D,MAAM,cAAc,GAAG,WAAW,GAAG,UAAU,GAAG,UAAU,CAAC;IAC7D,MAAM,aAAa,GAAG,cAAc,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1D,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,aAAa,GAAG,OAAO,CAAC,MAAM,GAAG,cAAc,GAAG,WAAW,CAAC,CAAC;IAC5F,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACxC,KAAK,CAAC,GAAG,CAAC,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IAC3C,KACE,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI;QACxB,CAAC,CAAC,EAAE,OAAO,CAAC;QACZ,CAAC,EAAE,EAAE,QAAQ,CAAC;QACd,CAAC,EAAE,EAAE,OAAO,CAAC,MAAM,CAAC;QACpB,CAAC,EAAE,EAAE,KAAK,CAAC,MAAM,CAAC;QAClB,CAAC,EAAE,EAAE,cAAc,CAAC;QACpB,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC;QACnB,CAAC,EAAE,EAAE,UAAU,CAAC;QAChB,CAAC,EAAE,EAAE,cAAc,CAAC,MAAM,CAAC;KAC5B,EACD,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,MAAgB,EAAE,KAAe,EAAE,IAAI,CAAC,CAAC;IAC1D,CAAC;IACD,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;IAC5C,KAAK,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,UAAU,EAAE,iBAAiB,CAAC,EAAE,EAAE,CAAC,CAAC;IAC3D,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC;QACrC,IAAI,CAAC,SAAS,CAAC,WAAW,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,CAAW,EAAE,IAAI,CAAC,CAAC;QAC/D,kBAAkB,CAAC,KAAK,EAAE,uBAAuB,GAAG,EAAE,GAAG,iBAAiB,EAAE,iBAAiB,CAAC,EAAE,CAAW,EAAE,iBAAiB,CAAC,CAAC;QAChI,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;YAC1C,kBAAkB,CAAC,KAAK,EAAE,eAAe,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,EAAE,GAAG,CAAC,GAAG,MAAM,CAAW,EAAE,UAAU,CAAC,CAAC;QAChI,CAAC;IACH,CAAC;IACD,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,IAAI,cAAc,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3D,IAAI,CAAC,SAAS,CAAC,oBAAoB,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC1D,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,oBAAoB,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACrF,CAAC;IACD,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;QAC5C,IAAI,CAAC,SAAS,CAAC,YAAY,GAAG,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;QACtD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,kBAAkB,CAAC,KAAK,EAAE,WAAW,GAAG,QAAQ,EAAE,GAAG,UAAU,EAAE,KAAK,CAAC,IAAI,CAAW,EAAE,UAAU,CAAC,CAAC;QACtG,CAAC;IACH,CAAC;IACD,IAAI,CAAC,SAAS,CAAC,YAAY,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;IACjE,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QAC9C,IAAI,CAAC,SAAS,CAAC,cAAc,GAAG,EAAE,GAAG,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IACxD,CAAC;IACD,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;IAClC,IAAI,MAAM,GAAG,aAAa,GAAG,OAAO,CAAC,MAAM,CAAC;IAC5C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC;IACzB,CAAC;IACD,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC3D,uBAAuB,CAAC,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACnD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,8FAA8F;AAC9F,MAAM,UAAU,uBAAuB,CAAC,KAAiB,EAAE,QAAgB,EAAE,QAAgB;IAC3F,IAAI,KAAK,CAAC,MAAM,GAAG,WAAW,GAAG,WAAW,IAAI,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;QACzG,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;IACzD,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IAC5E,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,OAAO,EAAE,CAAC;QACxC,MAAM,IAAI,KAAK,CAAC,oEAAoE,CAAC,CAAC;IACxF,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC;QAClF,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;IAC3D,CAAC;IACD,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;QAC9G,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAC;IAC1E,CAAC;IACD,MAAM,aAAa,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACvC,MAAM,cAAc,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAChD,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IAC5C,MAAM,iBAAiB,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;IACnD,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACpE,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACpE,MAAM,iBAAiB,GAAG,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,qBAAqB,CAAC,CAAC;IAClF,MAAM,iBAAiB,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,CAAC;IACrD,MAAM,SAAS,GAAG,iBAAiB,GAAG,QAAQ,GAAG,iBAAiB,CAAC;IACnE,MAAM,cAAc,GAAG,SAAS,GAAG,QAAQ,GAAG,CAAC,GAAG,UAAU,CAAC;IAC7D,MAAM,YAAY,GAAG,cAAc,GAAG,iBAAiB,GAAG,CAAC,CAAC;IAC5D,MAAM,WAAW,GAAG,YAAY,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACxD,MAAM,OAAO,GAAG,WAAW,GAAG,UAAU,GAAG,UAAU,CAAC;IACtD,MAAM,aAAa,GAAG,OAAO,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAChD,MAAM,cAAc,GAAG,aAAa,GAAG,aAAa,CAAC;IACrD,IACE,CAAC,UAAU,IAAI,CAAC,iBAAiB,IAAI,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC;WAC3F,cAAc,GAAG,cAAc,GAAG,WAAW,KAAK,KAAK,CAAC,MAAM,EACjE,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACvD,CAAC;IACD,MAAM,KAAK,GAAY,IAAI,CAAC,KAAK,CAAC,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;IACnI,IACE,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,KAAK;WAC5C,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,IAAI,KAAK,QAAQ,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EACvH,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACvD,CAAC;IACD,MAAM,KAAK,GAAuB;QAChC,IAAI;QACJ,KAAK;QACL,OAAO;QACP,QAAQ,EAAE,KAAK,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,WAAW,CAAC;QACtD,QAAQ;QACR,iBAAiB;QACjB,SAAS;QACT,YAAY;QACZ,UAAU;QACV,WAAW;QACX,UAAU;QACV,UAAU;QACV,iBAAiB;QACjB,iBAAiB,EAAE,EAAE;QACrB,eAAe,EAAE,EAAE;QACnB,kBAAkB,EAAE,IAAI,GAAG,EAAE;KAC9B,CAAC;IACF,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,iBAAiB,EAAE,EAAE,EAAE,EAAE,CAAC;QAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QAC3D,MAAM,EAAE,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,cAAc,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,cAAc,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAO,CAAC;QAC7H,IAAI,IAAI,GAAG,SAAS,IAAI,IAAI,GAAG,SAAS,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACxG,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;QACzD,CAAC;QACD,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/B,KAAK,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACzC,CAAC;IACD,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;IAClB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC;QACrC,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QACvD,IAAI,GAAG,IAAI,QAAQ,IAAI,GAAG,GAAG,UAAU,EAAE,CAAC;YACxC,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;QAChD,CAAC;QACD,QAAQ,GAAG,GAAG,CAAC;QACf,IAAI,qBAAqB,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,iBAAiB,EAAE,CAAC;YAC1D,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;QACnE,CAAC;QACD,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;YAC1C,IAAI,iBAAiB,CAAC,IAAI,EAAE,SAAS,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,UAAU,EAAE,UAAU,CAAC,IAAI,UAAU,EAAE,CAAC;gBAClG,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,YAAY,GAAG,UAAU,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,UAAU,EAAE,CAAC;QACnH,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;IAC1D,CAAC;IACD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,UAAU,EAAE,EAAE,EAAE,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,YAAY,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QAC1D,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,YAAY,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QAC9D,IAAI,GAAG,GAAG,KAAK,IAAI,GAAG,GAAG,UAAU,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,UAAU,EAAE,EAAE,EAAE,EAAE,CAAC;QACvC,IAAI,iBAAiB,CAAC,IAAI,EAAE,WAAW,GAAG,EAAE,GAAG,UAAU,EAAE,UAAU,CAAC,IAAI,KAAK,EAAE,CAAC;YAChF,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,GAAG,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,cAAc,EAAE,CAAC;QACxG,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;IAC5D,CAAC;IACD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC;QAClC,kBAAkB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,+FAA+F;AAC/F,MAAM,UAAU,kBAAkB,CAAC,KAAyB,EAAE,EAAU,EAAE,KAA6B;IACrG,IAAI,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;IAChE,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;IACrE,IAAI,GAAG,IAAI,MAAM,IAAI,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;QACjD,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;IAC1D,CAAC;IACD,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;IAClB,OAAO,MAAM,GAAG,GAAG,EAAE,CAAC;QACpB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,IAAY,CAAC;QACjB,GAAG,CAAC;YACF,IAAI,MAAM,IAAI,GAAG,IAAI,MAAM,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;gBACtC,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;YAC7D,CAAC;YACD,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAW,CAAC;YAC1C,KAAK,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC;YAC/B,MAAM,IAAI,GAAG,CAAC;QAChB,CAAC,QAAQ,IAAI,GAAG,GAAG,EAAE;QACrB,MAAM,GAAG,GAAG,QAAQ,GAAG,KAAK,CAAC;QAC7B,IAAI,KAAK,KAAK,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;QACxD,CAAC;QACD,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;QACb,QAAQ,GAAG,GAAG,CAAC;IACjB,CAAC;AACH,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,YAAY,CAAC,KAAyB,EAAE,EAAU;IAChE,OAAO,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AACnF,CAAC;AAED,6FAA6F;AAC7F,MAAM,UAAU,qBAAqB,CAAC,KAAyB,EAAE,EAAU;IACzE,OAAO,iBAAiB,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,iBAAiB,GAAG,EAAE,GAAG,KAAK,CAAC,iBAAiB,EAAE,KAAK,CAAC,iBAAiB,CAAC,CAAC;AACxH,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,aAAa,CAAC,KAAyB,EAAE,GAAW;IAClE,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;IAC5C,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC;IAC1B,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;QAClB,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAC1C,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,GAAG,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC;YAClE,GAAG,GAAG,MAAM,GAAG,CAAC,CAAC;QACnB,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,MAAM,CAAC;QAChB,CAAC;IACH,CAAC;IACD,OAAO,GAAG,GAAG,KAAK,CAAC,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,WAAW,GAAG,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACzG,CAAC;AAED,SAAS,aAAa,CAAC,IAAuB;IAC5C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;IAClB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,KAAK,GAAG,GAAG,GAAG,QAAQ,CAAC;QAC3B,OAAO,KAAK,IAAI,GAAG,EAAE,CAAC;YACpB,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;YAChC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC;QAClC,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClB,QAAQ,GAAG,GAAG,CAAC;IACjB,CAAC;IACD,OAAO,IAAI,UAAU,CAAC,KAAK,CAAC,CAAC;AAC/B,CAAC;AAED,SAAS,MAAM,CAAC,KAAiB;IAC/B,OAAO,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;AACrD,CAAC"}
|
|
@@ -0,0 +1,15 @@
|
|
|
1
|
+
/** All workers are busy and the bounded waiting queue is full. */
|
|
2
|
+
export declare class DneAddressSearchQueueFullError extends Error {
|
|
3
|
+
readonly code = "SEARCH_QUEUE_FULL";
|
|
4
|
+
constructor();
|
|
5
|
+
}
|
|
6
|
+
/** The pool no longer accepts new searches. */
|
|
7
|
+
export declare class DneAddressSearchPoolClosedError extends Error {
|
|
8
|
+
readonly code = "SEARCH_POOL_CLOSED";
|
|
9
|
+
constructor();
|
|
10
|
+
}
|
|
11
|
+
/** A worker could not start or stopped unexpectedly. The entire pool is closed. */
|
|
12
|
+
export declare class DneAddressSearchWorkerError extends Error {
|
|
13
|
+
readonly code = "SEARCH_WORKER_FAILED";
|
|
14
|
+
constructor(cause: unknown);
|
|
15
|
+
}
|
|
@@ -0,0 +1,25 @@
|
|
|
1
|
+
/** All workers are busy and the bounded waiting queue is full. */
|
|
2
|
+
export class DneAddressSearchQueueFullError extends Error {
|
|
3
|
+
code = 'SEARCH_QUEUE_FULL';
|
|
4
|
+
constructor() {
|
|
5
|
+
super('Address search queue is full');
|
|
6
|
+
this.name = 'DneAddressSearchQueueFullError';
|
|
7
|
+
}
|
|
8
|
+
}
|
|
9
|
+
/** The pool no longer accepts new searches. */
|
|
10
|
+
export class DneAddressSearchPoolClosedError extends Error {
|
|
11
|
+
code = 'SEARCH_POOL_CLOSED';
|
|
12
|
+
constructor() {
|
|
13
|
+
super('Address search pool is closed');
|
|
14
|
+
this.name = 'DneAddressSearchPoolClosedError';
|
|
15
|
+
}
|
|
16
|
+
}
|
|
17
|
+
/** A worker could not start or stopped unexpectedly. The entire pool is closed. */
|
|
18
|
+
export class DneAddressSearchWorkerError extends Error {
|
|
19
|
+
code = 'SEARCH_WORKER_FAILED';
|
|
20
|
+
constructor(cause) {
|
|
21
|
+
super('Address search worker failed', { cause });
|
|
22
|
+
this.name = 'DneAddressSearchWorkerError';
|
|
23
|
+
}
|
|
24
|
+
}
|
|
25
|
+
//# sourceMappingURL=address-search-pool-errors.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"address-search-pool-errors.js","sourceRoot":"","sources":["../src/address-search-pool-errors.ts"],"names":[],"mappings":"AAAA,kEAAkE;AAClE,MAAM,OAAO,8BAA+B,SAAQ,KAAK;IAC9C,IAAI,GAAG,mBAAmB,CAAC;IAEpC;QACE,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI,GAAG,gCAAgC,CAAC;IAC/C,CAAC;CACF;AAED,+CAA+C;AAC/C,MAAM,OAAO,+BAAgC,SAAQ,KAAK;IAC/C,IAAI,GAAG,oBAAoB,CAAC;IAErC;QACE,KAAK,CAAC,+BAA+B,CAAC,CAAC;QACvC,IAAI,CAAC,IAAI,GAAG,iCAAiC,CAAC;IAChD,CAAC;CACF;AAED,mFAAmF;AACnF,MAAM,OAAO,2BAA4B,SAAQ,KAAK;IAC3C,IAAI,GAAG,sBAAsB,CAAC;IAEvC,YAAY,KAAc;QACxB,KAAK,CAAC,8BAA8B,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;QACjD,IAAI,CAAC,IAAI,GAAG,6BAA6B,CAAC;IAC5C,CAAC;CACF"}
|