Datenvertragswerk
constraint mode transition plan
Resolve SET CONSTRAINTS catalog targets using the first matching search-path schema and all same-name constraints; preflight retroactive checking and atomic mode transition from supplied pending-violation evidence. No SQL,trigger or database execution; incomplete evidence remains unknown. Fixed0.003USDC also for schema-valid unknown; invalid input is native400 before settlement. Serialized input16KiB/data32KiB.
POST https://datenvertrag.halowerk.com/v1/constraint-mode-transition-planEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| all | boolean | Ja | |
| catalog_complete | boolean | Ja | |
| constraints | array | Ja | |
| in_transaction | boolean | Ja | |
| mode | Siehe Schema | Ja | |
| names | array | Ja | |
| search_path | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"additionalProperties": false,
"properties": {
"all": {
"type": "boolean"
},
"catalog_complete": {
"type": "boolean"
},
"constraints": {
"items": {
"additionalProperties": false,
"properties": {
"deferrable": {
"type": "boolean"
},
"id": {
"pattern": "^[A-Za-z0-9_-]{1,16}$",
"type": "string"
},
"mode": {
"enum": [
"immediate",
"deferred"
]
},
"name": {
"pattern": "^[A-Za-z0-9_-]{1,16}$",
"type": "string"
},
"schema": {
"pattern": "^[A-Za-z0-9_-]{1,16}$",
"type": "string"
},
"violation": {
"type": [
"boolean",
"null"
]
}
},
"required": [
"id",
"schema",
"name",
"deferrable",
"mode",
"violation"
],
"type": "object"
},
"maxItems": 16,
"type": "array"
},
"in_transaction": {
"type": "boolean"
},
"mode": {
"enum": [
"immediate",
"deferred"
]
},
"names": {
"items": {
"additionalProperties": false,
"properties": {
"name": {
"pattern": "^[A-Za-z0-9_-]{1,16}$",
"type": "string"
},
"schema": {
"anyOf": [
{
"pattern": "^[A-Za-z0-9_-]{1,16}$",
"type": "string"
},
{
"type": "null"
}
]
}
},
"required": [
"schema",
"name"
],
"type": "object"
},
"maxItems": 8,
"type": "array"
},
"search_path": {
"items": {
"pattern": "^[A-Za-z0-9_-]{1,16}$",
"type": "string"
},
"maxItems": 4,
"type": "array",
"uniqueItems": true
}
},
"required": [
"in_transaction",
"catalog_complete",
"search_path",
"constraints",
"all",
"names",
"mode"
],
"type": "object"
}Veröffentlichtes Eingabebeispiel
{
"all": false,
"catalog_complete": true,
"constraints": [
{
"deferrable": true,
"id": "A1",
"mode": "deferred",
"name": "C",
"schema": "A",
"violation": false
},
{
"deferrable": true,
"id": "A2",
"mode": "deferred",
"name": "C",
"schema": "A",
"violation": false
},
{
"deferrable": true,
"id": "B1",
"mode": "deferred",
"name": "C",
"schema": "B",
"violation": false
}
],
"in_transaction": true,
"mode": "immediate",
"names": [
{
"name": "C",
"schema": null
}
],
"search_path": [
"A",
"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