HALOWERKDatenvertragswerk
classic histogram quantile trace
Compute a rational classic histogram quantile and a sorted/coalesced cumulative-bucket repair trace from bounded caller-supplied integer counts. Own exact rational specialization of the Prometheus3.2.1 classic rule; no native histogram, scrape, PromQL server or vendor float-bit conformance. Uniform-within-bucket interpolation is an assumption, not recovered observations. Undefined results remain unknown and cost the same fixed0.003USDC; invalid input must map to native400 before settlement..
POST https://datenvertrag.halowerk.com/v1/classic-histogram-quantile-traceEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| q | object | Ja | |
| buckets | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"q": {
"type": "object",
"properties": {
"numerator": {
"type": "integer",
"minimum": -1000000,
"maximum": 1000000
},
"denominator": {
"type": "integer",
"minimum": 1,
"maximum": 1000000
}
},
"required": [
"numerator",
"denominator"
],
"additionalProperties": false
},
"buckets": {
"type": "array",
"maxItems": 64,
"items": {
"type": "object",
"properties": {
"upper": {
"anyOf": [
{
"type": "integer",
"minimum": -1000000,
"maximum": 1000000
},
{
"const": "+Inf"
}
]
},
"count": {
"type": "integer",
"minimum": 0,
"maximum": 1000000
}
},
"required": [
"upper",
"count"
],
"additionalProperties": false
}
}
},
"required": [
"q",
"buckets"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"q": {
"numerator": 1,
"denominator": 2
},
"buckets": [
{
"upper": 1,
"count": 2
},
{
"upper": 2,
"count": 6
},
{
"upper": "+Inf",
"count": 8
}
]
}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