HALOWERKDatenvertragswerk
integer range set algebra
Canonicalize two supplied integer-range collections, merge overlap and integer adjacency, and return complete canonical inputs, union, intersection and left difference with finite or infinite cardinality. Inclusive/exclusive endpoints normalize by the next integer; null endpoints explicitly denote unbounded limits and empty descriptors denote no points. Own exact mathematical integer-universe profile with up to16ranges per input, endpoints +/-1million. This is not a native int4/int8 domain,.
POST https://datenvertrag.halowerk.com/v1/integer-range-set-algebraEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| a | array | Ja | |
| b | array | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"a": {
"type": "array",
"maxItems": 16,
"items": {
"anyOf": [
{
"type": "object",
"properties": {
"empty": {
"const": true
}
},
"required": [
"empty"
],
"additionalProperties": false
},
{
"type": "object",
"properties": {
"lower": {
"anyOf": [
{
"type": "integer",
"minimum": -1000000,
"maximum": 1000000
},
{
"type": "null"
}
]
},
"upper": {
"anyOf": [
{
"type": "integer",
"minimum": -1000000,
"maximum": 1000000
},
{
"type": "null"
}
]
},
"lower_inclusive": {
"type": "boolean"
},
"upper_inclusive": {
"type": "boolean"
}
},
"required": [
"lower",
"upper",
"lower_inclusive",
"upper_inclusive"
],
"additionalProperties": false
}
]
}
},
"b": {
"type": "array",
"maxItems": 16,
"items": {
"anyOf": [
{
"type": "object",
"properties": {
"empty": {
"const": true
}
},
"required": [
"empty"
],
"additionalProperties": false
},
{
"type": "object",
"properties": {
"lower": {
"anyOf": [
{
"type": "integer",
"minimum": -1000000,
"maximum": 1000000
},
{
"type": "null"
}
]
},
"upper": {
"anyOf": [
{
"type": "integer",
"minimum": -1000000,
"maximum": 1000000
},
{
"type": "null"
}
]
},
"lower_inclusive": {
"type": "boolean"
},
"upper_inclusive": {
"type": "boolean"
}
},
"required": [
"lower",
"upper",
"lower_inclusive",
"upper_inclusive"
],
"additionalProperties": false
}
]
}
}
},
"required": [
"a",
"b"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"a": [
{
"lower": -2,
"upper": 2,
"lower_inclusive": true,
"upper_inclusive": false
}
],
"b": [
{
"lower": 0,
"upper": 0,
"lower_inclusive": true,
"upper_inclusive": true
}
]
}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