HALOWERKDatenvertragswerk
parking preference fiber inventory
Given one original permutation ofslots1..n assigned tocar1..n,n0..6, synthesize ALL preferencevectors which, under classical one-way parking, produce exactly that assignment. Each car starts at its preference and takes first free slot at-or-after it, with no backward or circular wrap. Return lexicographically sorted complete preferencefiber, exact count, per-car independent preferenceintervals, inverse slot-to-car map and totaldisplacementhistogram. Valid emptypermutation has one empty.
POST https://datenvertrag.halowerk.com/v1/parking-preference-fiber-inventoryEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| parking_permutation | Siehe Schema | Ja | |
| claimed_preferences | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"parking_permutation",
"claimed_preferences"
],
"properties": {
"parking_permutation": {
"anyOf": [
{
"type": "array",
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 6
}
},
{
"type": "null"
}
]
},
"claimed_preferences": {
"anyOf": [
{
"type": "array",
"maxItems": 720,
"items": {
"type": "array",
"maxItems": 6,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 6
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"parking_permutation": [
2,
1,
3
],
"claimed_preferences": [
[
2,
1,
1
],
[
2,
1,
2
],
[
2,
1,
3
]
]
}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