HALOWERKDatenvertragswerk
stack sort preimage inventory
Given a target permutation of0..n-1,n0..7, reconstruct ALL source permutations mapped to it by one deterministic stack-sort pass: while top<next input pop to output, then push input; drain after finalinput. Return every source in numeric lexorder, exact fertility and complete push/pop value/stack/output transcript of first source, or null transcript when no source exists. Emptytarget has one emptysource/emptytranscript; impossible validtarget gives knownemptyfamily. Compare entire ordered.
POST https://datenvertrag.halowerk.com/v1/stack-sort-preimage-inventoryEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| target | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"target",
"claim"
],
"properties": {
"target": {
"anyOf": [
{
"type": "array",
"maxItems": 7,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"uniqueItems": true
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"maxItems": 512,
"items": {
"type": "array",
"maxItems": 7,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"uniqueItems": true
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"target": [
1,
0,
2
],
"claim": [
[
1,
2,
0
]
]
}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