feat(categorize): Tier 1 candidate gathering + the proposal route (#1781)
The auto-booking cascade end to end (retrieval → selector), minus the write. - lib/agent/categorize/candidates.ts (Tier 1): assembles the deterministic candidate slate for a transaction — the learned counterparty template (strongest, carries its own VAT) plus mapping rules / patterns / per-merchant history via the same engine gnubok_suggest_categories uses. No model call. Deduped by account (highest confidence wins), capped; suggestions get the category's default VAT treatment derived. - POST /api/agent/categorize: loads the transaction + company VAT context, runs Tier 1 → Tier 2 selectAccount, returns the proposed account + VAT + confidence + reasoning + the candidate slate. Never posts anything — the caller renders an approval card. Gated on configured (any provider incl. local), same gates as /api/agent/ask. 12 tests: candidate merge/dedupe/VAT-derivation, and the route (401/429/400/ 403/404/503 + happy path threading entity type, VAT, underlag, samples). Co-authored-by: Jakob Wennberg <311770904+jakobwennberg-oss@users.noreply.github.com> Co-authored-by: Claude Opus 4.8 <noreply@anthropic.com>
This commit is contained in:
co-authored by
Jakob Wennberg
Claude Opus 4.8
parent
b17878e58f
commit
e7a5e65ecf
@@ -0,0 +1,107 @@
|
||||
import { describe, it, expect, vi, beforeEach } from 'vitest'
|
||||
import type { SupabaseClient } from '@supabase/supabase-js'
|
||||
import type { Transaction } from '@/types'
|
||||
|
||||
const getSuggestedCategories = vi.fn()
|
||||
vi.mock('@/lib/transactions/category-suggestions', () => ({
|
||||
getSuggestedCategories: (...a: unknown[]) => getSuggestedCategories(...a),
|
||||
buildMerchantHistory: () => new Map(),
|
||||
merchantHistoryFor: () => ({}),
|
||||
}))
|
||||
const findCounterpartyTemplate = vi.fn()
|
||||
vi.mock('@/lib/bookkeeping/counterparty-templates', () => ({
|
||||
findCounterpartyTemplate: (...a: unknown[]) => findCounterpartyTemplate(...a),
|
||||
formatCounterpartyName: (n: string) => n,
|
||||
}))
|
||||
|
||||
import { gatherCandidates } from '../candidates'
|
||||
|
||||
// Permissive chainable supabase: every builder method returns the chain, and
|
||||
// the chain is awaitable (resolves {data: []}) so the two list queries settle.
|
||||
function mockSupabase(): SupabaseClient {
|
||||
const chain: Record<string, unknown> = {}
|
||||
for (const m of ['from', 'select', 'or', 'eq', 'is', 'not', 'neq', 'order', 'limit']) {
|
||||
chain[m] = () => chain
|
||||
}
|
||||
chain.then = (resolve: (v: { data: unknown[] }) => unknown) => resolve({ data: [] })
|
||||
return chain as unknown as SupabaseClient
|
||||
}
|
||||
|
||||
const TX = { id: 't1', merchant_name: 'Biltema', description: 'Kortköp', original_description: 'BILTEMA' } as unknown as Transaction
|
||||
|
||||
function cpMatch(over: Record<string, unknown> = {}) {
|
||||
return {
|
||||
template: {
|
||||
debit_account: '5410',
|
||||
counterparty_name: 'Biltema',
|
||||
vat_treatment: 'standard_25',
|
||||
occurrence_count: 4,
|
||||
category: 'expense_consumables',
|
||||
...over,
|
||||
},
|
||||
matchMethod: 'exact_normalized',
|
||||
confidence: 0.9,
|
||||
}
|
||||
}
|
||||
|
||||
beforeEach(() => {
|
||||
vi.clearAllMocks()
|
||||
findCounterpartyTemplate.mockResolvedValue(null)
|
||||
getSuggestedCategories.mockReturnValue([])
|
||||
})
|
||||
|
||||
describe('gatherCandidates', () => {
|
||||
it('puts the counterparty template first, carrying its own VAT', async () => {
|
||||
findCounterpartyTemplate.mockResolvedValue(cpMatch())
|
||||
const out = await gatherCandidates(mockSupabase(), 'c1', TX)
|
||||
expect(out[0]).toMatchObject({
|
||||
account: '5410',
|
||||
source: 'counterparty_template',
|
||||
vatTreatment: 'standard_25',
|
||||
confidence: 0.9,
|
||||
})
|
||||
expect(out[0].matchReason).toContain('4 tidigare')
|
||||
})
|
||||
|
||||
it('derives VAT for rule/pattern/history suggestions from their category', async () => {
|
||||
getSuggestedCategories.mockReturnValue([
|
||||
{ category: 'expense_bank_fees', label: 'Bankavgift', account: '6570', confidence: 0.8, source: 'mapping_rule' },
|
||||
{ category: 'expense_software', label: 'Programvara', account: '5420', confidence: 0.6, source: 'pattern' },
|
||||
])
|
||||
const out = await gatherCandidates(mockSupabase(), 'c1', TX)
|
||||
const bank = out.find((c) => c.account === '6570')!
|
||||
const soft = out.find((c) => c.account === '5420')!
|
||||
expect(bank.vatTreatment).toBeNull() // bank fees are VAT-exempt
|
||||
expect(soft.vatTreatment).toBe('standard_25')
|
||||
})
|
||||
|
||||
it('de-duplicates by account, keeping the highest confidence', async () => {
|
||||
findCounterpartyTemplate.mockResolvedValue(cpMatch({ debit_account: '5410' }))
|
||||
getSuggestedCategories.mockReturnValue([
|
||||
{ category: 'expense_consumables', label: 'Material', account: '5410', confidence: 0.56, source: 'history' },
|
||||
])
|
||||
const out = await gatherCandidates(mockSupabase(), 'c1', TX)
|
||||
const fivefour = out.filter((c) => c.account === '5410')
|
||||
expect(fivefour).toHaveLength(1)
|
||||
expect(fivefour[0].source).toBe('counterparty_template') // 0.9 > 0.56
|
||||
})
|
||||
|
||||
it('skips suggestions with no account and sorts by confidence, capped', async () => {
|
||||
getSuggestedCategories.mockReturnValue([
|
||||
{ category: 'expense_other', label: 'x', account: null, confidence: 0.9, source: 'pattern' },
|
||||
{ category: 'expense_office', label: 'Kontor', account: '6110', confidence: 0.5, source: 'history' },
|
||||
{ category: 'expense_travel', label: 'Resor', account: '5800', confidence: 0.7, source: 'mapping_rule' },
|
||||
])
|
||||
const out = await gatherCandidates(mockSupabase(), 'c1', TX, 2)
|
||||
expect(out.map((c) => c.account)).toEqual(['5800', '6110']) // no null, sorted desc, capped at 2
|
||||
})
|
||||
|
||||
it('returns just the suggestions when there is no counterparty match', async () => {
|
||||
getSuggestedCategories.mockReturnValue([
|
||||
{ category: 'expense_office', label: 'Kontor', account: '6110', confidence: 0.5, source: 'history' },
|
||||
])
|
||||
const out = await gatherCandidates(mockSupabase(), 'c1', TX)
|
||||
expect(out).toHaveLength(1)
|
||||
expect(out[0].source).toBe('history')
|
||||
})
|
||||
})
|
||||
@@ -0,0 +1,121 @@
|
||||
import type { SupabaseClient } from '@supabase/supabase-js'
|
||||
import {
|
||||
getSuggestedCategories,
|
||||
buildMerchantHistory,
|
||||
merchantHistoryFor,
|
||||
} from '@/lib/transactions/category-suggestions'
|
||||
import {
|
||||
findCounterpartyTemplate,
|
||||
formatCounterpartyName,
|
||||
} from '@/lib/bookkeeping/counterparty-templates'
|
||||
import { getDefaultVatTreatmentForCategory } from '@/lib/bookkeeping/category-mapping'
|
||||
import type { MappingRule, Transaction, VatTreatment } from '@/types'
|
||||
import type { AccountCandidate } from './select-account'
|
||||
|
||||
/**
|
||||
* Tier 1 of the auto-booking cascade: deterministic candidate generation.
|
||||
*
|
||||
* Assembles the ranked slate of candidate accounts for one transaction from
|
||||
* the company's own memory: a learned counterparty template (the strongest
|
||||
* signal) plus mapping rules, keyword patterns and per-merchant history. This
|
||||
* is the same engine the `gnubok_suggest_categories` MCP tool uses; it runs
|
||||
* with NO model call. The slate is what the Tier-2 selector reasons over.
|
||||
*
|
||||
* Company-scoped throughout. Returns at most `limit` candidates, de-duplicated
|
||||
* by account (highest confidence wins), highest confidence first.
|
||||
*/
|
||||
|
||||
const MAX_HISTORY_ROWS = 200
|
||||
|
||||
export async function gatherCandidates(
|
||||
supabase: SupabaseClient,
|
||||
companyId: string,
|
||||
transaction: Transaction,
|
||||
limit = 8,
|
||||
): Promise<AccountCandidate[]> {
|
||||
// The company's own rules plus the global (null-company) defaults. Two static
|
||||
// queries rather than one dynamic `.or('company_id.eq.<id>,...')`, which the
|
||||
// no-phantom-columns scanner can't resolve (and it would trip the ceiling).
|
||||
const [companyRulesRes, globalRulesRes, historyRes, cpMatch] = await Promise.all([
|
||||
supabase
|
||||
.from('mapping_rules')
|
||||
.select('*')
|
||||
.eq('company_id', companyId)
|
||||
.eq('is_active', true)
|
||||
.order('priority', { ascending: false }),
|
||||
supabase
|
||||
.from('mapping_rules')
|
||||
.select('*')
|
||||
.is('company_id', null)
|
||||
.eq('is_active', true)
|
||||
.order('priority', { ascending: false }),
|
||||
// Counterparty-keyed history: only the same merchant's past bookings, so
|
||||
// global frequency padding can't drown the signal in noise.
|
||||
supabase
|
||||
.from('transactions')
|
||||
.select('category, merchant_name, description, original_description')
|
||||
.eq('company_id', companyId)
|
||||
.not('is_business', 'is', null)
|
||||
.neq('category', 'uncategorized')
|
||||
.neq('category', 'private')
|
||||
.order('date', { ascending: false })
|
||||
.limit(MAX_HISTORY_ROWS),
|
||||
findCounterpartyTemplate(supabase, companyId, transaction),
|
||||
])
|
||||
|
||||
const mappingRules = [
|
||||
...((companyRulesRes.data ?? []) as MappingRule[]),
|
||||
...((globalRulesRes.data ?? []) as MappingRule[]),
|
||||
]
|
||||
const merchantHistory = buildMerchantHistory(historyRes.data ?? [])
|
||||
|
||||
const raw: AccountCandidate[] = []
|
||||
|
||||
// 1. Learned counterparty template — the strongest signal (carries its own VAT).
|
||||
if (cpMatch?.template.debit_account) {
|
||||
const t = cpMatch.template
|
||||
raw.push({
|
||||
account: t.debit_account,
|
||||
label: formatCounterpartyName(t.counterparty_name),
|
||||
vatTreatment: (t.vat_treatment as VatTreatment | null) ?? null,
|
||||
source: 'counterparty_template',
|
||||
confidence: cpMatch.confidence,
|
||||
matchReason: `${t.occurrence_count ?? 0} tidigare bokföringar`,
|
||||
})
|
||||
}
|
||||
|
||||
// 2. Rules / pattern / history suggestions. They don't carry VAT, so derive
|
||||
// the category's default treatment (the selector can still flag reverse charge).
|
||||
const suggestions = getSuggestedCategories(
|
||||
transaction,
|
||||
mappingRules,
|
||||
merchantHistoryFor(
|
||||
merchantHistory,
|
||||
transaction.merchant_name,
|
||||
transaction.original_description ?? transaction.description,
|
||||
),
|
||||
)
|
||||
for (const s of suggestions) {
|
||||
if (!s.account) continue
|
||||
raw.push({
|
||||
account: s.account,
|
||||
label: s.label,
|
||||
vatTreatment: getDefaultVatTreatmentForCategory(s.category),
|
||||
source: s.source,
|
||||
confidence: s.confidence,
|
||||
matchReason: s.match_reason,
|
||||
})
|
||||
}
|
||||
|
||||
return dedupeByAccount(raw).slice(0, limit)
|
||||
}
|
||||
|
||||
/** Keep one candidate per account (the highest-confidence one), highest confidence first. */
|
||||
function dedupeByAccount(candidates: AccountCandidate[]): AccountCandidate[] {
|
||||
const best = new Map<string, AccountCandidate>()
|
||||
for (const c of candidates) {
|
||||
const existing = best.get(c.account)
|
||||
if (!existing || c.confidence > existing.confidence) best.set(c.account, c)
|
||||
}
|
||||
return [...best.values()].sort((a, b) => b.confidence - a.confidence)
|
||||
}
|
||||
Reference in New Issue
Block a user