Daan MeijerandClaude Opus 5.5
9ae15ed26f
The 6,000-file test took 29 s and failed CI; 120 files in chunks of 50 cover the same path. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
83 lines
3.4 KiB
TypeScript
83 lines
3.4 KiB
TypeScript
import db from '@adonisjs/lucid/services/db'
|
|
import type { QueryClientContract } from '@adonisjs/lucid/types/database'
|
|
import { packSegments, unpackSegments, type Segment } from '#lib/nzb/segments'
|
|
|
|
/**
|
|
* The only code that knows how `files` keeps its segment lists (CONCEPT.md
|
|
* D31): compressed in `files.segments`, with the first segment's message-id
|
|
* in the indexed `first_message_id` for lookups. Read them with
|
|
* `segmentsOf(file)`; write new files with `FileStore.insert`.
|
|
*/
|
|
|
|
/** A new `files` row, with its segments as a list. */
|
|
export type NewFile = Record<string, unknown> & { segments: Segment[] }
|
|
|
|
const unpacked = new WeakMap<object, Segment[]>()
|
|
|
|
/** The segments of a `files` row (a row from `db.from('files')`), in order. */
|
|
export function segmentsOf(file: { segments?: Buffer | Segment[] | null }): Segment[] {
|
|
const { segments } = file
|
|
if (!segments) return []
|
|
if (Array.isArray(segments)) return segments
|
|
let list = unpacked.get(file)
|
|
if (!list) {
|
|
list = unpackSegments(segments)
|
|
unpacked.set(file, list)
|
|
}
|
|
return list
|
|
}
|
|
|
|
/** Stored form of a segment list, for the File model's column. */
|
|
export function storedSegments(segments: Segment[]) {
|
|
return packSegments(segments)
|
|
}
|
|
|
|
export function loadedSegments(stored: Buffer | null): Segment[] {
|
|
return stored ? unpackSegments(stored) : []
|
|
}
|
|
|
|
/** Rows per INSERT, well below Postgres' 65,535 bind parameters (tests lower it). */
|
|
export const insertLimits = { rows: 2000 }
|
|
|
|
class FileStore {
|
|
/**
|
|
* Inserts files, skipping those whose `file_key` exists. Returns the rows
|
|
* that were inserted (id and filename). `files` is partitioned by id
|
|
* (CONCEPT.md D39) and each partition has its own unique file_key index:
|
|
* keys already in any partition are looked up first; two writers adding
|
|
* the same new key at once meet in the newest partition's index.
|
|
*/
|
|
async insert(files: NewFile[], client: Pick<QueryClientContract, 'knexQuery'> = db): Promise<{ id: number; filename: string }[]> {
|
|
if (files.length === 0) return []
|
|
const keys = [...new Set(files.map((file) => file.file_key).filter((key): key is string => typeof key === 'string'))]
|
|
const known = new Set<string>()
|
|
for (let i = 0; i < keys.length; i += 5000) {
|
|
const found = await client.knexQuery().from('files').whereIn('file_key', keys.slice(i, i + 5000)).select('file_key')
|
|
for (const row of found) known.add(row.file_key)
|
|
}
|
|
const seen = new Set<string>()
|
|
const rows = files
|
|
.filter((file) => {
|
|
const key = file.file_key as string | null | undefined
|
|
if (!key) return true
|
|
if (known.has(key) || seen.has(key)) return false
|
|
seen.add(key)
|
|
return true
|
|
})
|
|
.map(({ segments, ...file }) => {
|
|
const sorted = [...segments].sort((a, b) => a.number - b.number)
|
|
return { ...file, segments: packSegments(sorted), first_message_id: sorted[0]?.id ?? null }
|
|
})
|
|
if (rows.length === 0) return []
|
|
// A statement takes at most 65,535 parameters: ~5,400 rows of 12 columns.
|
|
const inserted: { id: number; filename: string }[] = []
|
|
for (let i = 0; i < rows.length; i += insertLimits.rows) {
|
|
const chunk = await client.knexQuery().table('files').insert(rows.slice(i, i + insertLimits.rows)).onConflict().ignore().returning(['id', 'filename'])
|
|
for (const row of chunk) inserted.push({ id: Number(row.id), filename: row.filename })
|
|
}
|
|
return inserted
|
|
}
|
|
}
|
|
|
|
export default new FileStore()
|