HALOWERKDatenvertragswerk
integer histogram bucket audit
Own bounded numeric width_bucket evaluator from PostgreSQL18 public rules: equal-width ascending or mirror-descending bins, or strictly increasing integer threshold bins. Returns every row bucket and rational interval boundaries and compares whole claimed vector. Missing supplied evidence is null/unknown, not a SQLNULL execution claim. No SQL,PostgreSQL,float,time-zone or data-source execution. Strict-threshold specialization rejects duplicate bounds without claiming PostgreSQL itself.
POST https://datenvertrag.halowerk.com/v1/integer-histogram-bucket-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| claimed_buckets | Siehe Schema | Ja | |
| profile | Siehe Schema | Ja | |
| values | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"additionalProperties": false,
"properties": {
"claimed_buckets": {
"anyOf": [
{
"items": {
"maximum": 33,
"minimum": 0,
"type": "integer"
},
"maxItems": 64,
"type": "array"
},
{
"type": "null"
}
]
},
"profile": {
"oneOf": [
{
"additionalProperties": false,
"properties": {
"count": {
"maximum": 32,
"minimum": 1,
"type": "integer"
},
"high": {
"anyOf": [
{
"maximum": 1000000,
"minimum": -1000000,
"type": "integer"
},
{
"type": "null"
}
]
},
"kind": {
"const": "uniform"
},
"low": {
"anyOf": [
{
"maximum": 1000000,
"minimum": -1000000,
"type": "integer"
},
{
"type": "null"
}
]
}
},
"required": [
"kind",
"low",
"high",
"count"
],
"type": "object"
},
{
"additionalProperties": false,
"properties": {
"kind": {
"const": "thresholds"
},
"thresholds": {
"items": {
"anyOf": [
{
"maximum": 1000000,
"minimum": -1000000,
"type": "integer"
},
{
"type": "null"
}
]
},
"maxItems": 32,
"type": "array"
}
},
"required": [
"kind",
"thresholds"
],
"type": "object"
}
]
},
"values": {
"items": {
"anyOf": [
{
"maximum": 1000000,
"minimum": -1000000,
"type": "integer"
},
{
"type": "null"
}
]
},
"maxItems": 64,
"type": "array"
}
},
"required": [
"profile",
"values",
"claimed_buckets"
],
"type": "object"
}Veröffentlichtes Eingabebeispiel
{
"claimed_buckets": [
0,
1,
2,
4
],
"profile": {
"count": 3,
"high": 6,
"kind": "uniform",
"low": 0
},
"values": [
-1,
0,
2,
6
]
}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