HALOWERKDatenvertragswerk
page index joint scan intervals
Two original decoded flat Parquet int-column page bounds and first-row offsets plus two range predicates reconstruct joint conservative scan intervals. Interval intersection in production; independent row-enumeration reference. One row group,2flat scalar columns,1..32rows,1..4pages each,integers0..2;ordered first-row starts include0;bounds are conservative page bounds,not observations. At most1missing nonnull bounds capture: all6closed min<=max pairs0..2 retained jointly. Null pages.
POST https://datenvertrag.halowerk.com/v1/page-index-joint-scan-intervalsEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| rows | integer | Ja | |
| columns | array | Ja | |
| claim | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"rows",
"columns",
"claim"
],
"properties": {
"rows": {
"type": "integer",
"minimum": 1,
"maximum": 32
},
"columns": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"pages",
"predicate"
],
"properties": {
"pages": {
"type": "array",
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"first_row",
"bounds",
"all_null"
],
"properties": {
"first_row": {
"type": "integer",
"minimum": 0,
"maximum": 31
},
"bounds": {
"anyOf": [
{
"type": "null"
},
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 2,
"maxItems": 2
}
]
},
"all_null": {
"type": "boolean"
}
}
},
"minItems": 1,
"maxItems": 4
},
"predicate": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 2,
"maxItems": 2
}
}
}
},
"claim": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 31
},
"minItems": 2,
"maxItems": 2
},
"maxItems": 32
}
}
}Veröffentlichtes Eingabebeispiel
{
"rows": 4,
"columns": [
{
"pages": [
{
"first_row": 0,
"bounds": [
0,
0
],
"all_null": false
},
{
"first_row": 2,
"bounds": [
2,
2
],
"all_null": false
}
],
"predicate": [
0,
0
]
},
{
"pages": [
{
"first_row": 0,
"bounds": [
0,
2
],
"all_null": false
},
{
"first_row": 1,
"bounds": [
0,
0
],
"all_null": false
},
{
"first_row": 3,
"bounds": [
2,
2
],
"all_null": false
}
],
"predicate": [
0,
0
]
}
],
"claim": [
[
0,
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