HALOWERKDatenvertragswerk
snapshot window collision plan
Check which buffered snapshot READ keys may remain after a supplied Debezium-style chunk window so a data consumer does not reapply superseded snapshot rows. Normalized one-chunk metadata only;no connector,SQL call or full-table truth. Missing evidence remains unknown;known impossible joint claims are rejected. Schema-valid unknown costs the same fixed price;invalid input requires nativeHTTP400 before settlement. A schema-valid unknown is a successful result at the same fixed price; invalid.
POST https://datenvertrag.halowerk.com/v1/snapshot-window-collision-planEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| chunk | string | Ja | |
| collection | string | Ja | |
| snapshot_keys | array | Ja | |
| changes_complete | boolean | Ja | |
| events | array | Ja | |
| claimed_read_keys | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"properties": {
"chunk": {
"type": "string",
"pattern": "^[A-Za-z0-9_-]{1,16}$"
},
"collection": {
"type": "string",
"pattern": "^[A-Za-z0-9_-]{1,16}$"
},
"snapshot_keys": {
"type": "array",
"items": {
"type": "string",
"pattern": "^[A-Za-z0-9_-]{1,16}$"
},
"minItems": 1,
"maxItems": 32
},
"changes_complete": {
"type": "boolean"
},
"events": {
"type": "array",
"items": {
"type": "object",
"additionalProperties": false,
"properties": {
"id": {
"type": "string",
"pattern": "^[A-Za-z0-9_-]{1,16}$"
},
"kind": {
"enum": [
"open",
"close",
"change"
]
},
"window": {
"anyOf": [
{
"type": "string",
"pattern": "^[A-Za-z0-9_-]{1,16}$"
},
{
"type": "null"
}
]
},
"collection": {
"anyOf": [
{
"type": "string",
"pattern": "^[A-Za-z0-9_-]{1,16}$"
},
{
"type": "null"
}
]
},
"key": {
"anyOf": [
{
"type": "string",
"pattern": "^[A-Za-z0-9_-]{1,16}$"
},
{
"type": "null"
}
]
}
},
"required": [
"id",
"kind",
"window",
"collection",
"key"
]
},
"minItems": 0,
"maxItems": 64
},
"claimed_read_keys": {
"type": "array",
"items": {
"type": "string",
"pattern": "^[A-Za-z0-9_-]{1,16}$"
},
"minItems": 0,
"maxItems": 64
}
},
"required": [
"chunk",
"collection",
"snapshot_keys",
"changes_complete",
"events",
"claimed_read_keys"
]
}Veröffentlichtes Eingabebeispiel
{
"chunk": "C",
"collection": "T",
"snapshot_keys": [
"A",
"B"
],
"changes_complete": true,
"events": [
{
"id": "O",
"kind": "open",
"window": "C",
"collection": null,
"key": null
},
{
"id": "X",
"kind": "change",
"window": null,
"collection": "T",
"key": "A"
},
{
"id": "Z",
"kind": "close",
"window": "C",
"collection": null,
"key": null
}
],
"claimed_read_keys": [
"B"
]
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- Datenvertragswerk0,003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden