Datenvertragswerk
noncrossing partial matching inventory
For 0 to 7 ordered points labelled from zero, enumerate all partial matchings: each point is paired at most once and arcs (i,j),(k,l) cannot have i<k<j<l. Nested pairs and unmatched singletons are allowed. Return every sorted pair list, singleton list, opening=1/closing=-1/singleton=0 stepword and all prefix heights including initial zero. Records sort lexicographically by stepword with -1<0<1. Return the whole pair-count histogram, including zero bins. Empty points have one empty matching..
POST https://datenvertrag.halowerk.com/v1/noncrossing-partial-matching-inventoryEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| points | Siehe Schema | Ja | |
| claimed_matchings | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"points",
"claimed_matchings"
],
"properties": {
"points": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 7
},
{
"type": "null"
}
]
},
"claimed_matchings": {
"anyOf": [
{
"type": "array",
"maxItems": 127,
"items": {
"type": "array",
"maxItems": 3,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 6
}
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"points": 4,
"claimed_matchings": [
[],
[
[
2,
3
]
],
[
[
1,
2
]
],
[
[
1,
3
]
],
[
[
0,
1
]
],
[
[
0,
1
],
[
2,
3
]
],
[
[
0,
2
]
],
[
[
0,
3
]
],
[
[
0,
3
],
[
1,
2
]
]
]
}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