HALOWERKDatenvertragswerk
dyck word index ledger
Given pair count n0..8 and a valid zero-based index, return that word among ALL balanced Dyck words in numeric lexorder with own convention0=opening/up,1=closing/down. Every prefix height is nonnegative and finalheight0. Return total Catalancount, whole chosenword, all prefixheights includinginitial0, and per-position openingbranch completioncount/chosenstep/residualindexbeforeandafter. Empty n0 hasoneemptyword atindex0. Supplied index must be below currentcount; otherwise malformed400..
POST https://datenvertrag.halowerk.com/v1/dyck-word-index-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| pairs | Siehe Schema | Ja | |
| index | Siehe Schema | Ja | |
| claim | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"pairs",
"index",
"claim"
],
"properties": {
"pairs": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 8
},
{
"type": "null"
}
]
},
"index": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 1429
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"maxItems": 16,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"pairs": 3,
"index": 3,
"claim": [
0,
1,
0,
0,
1,
1
]
}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