HALOWERKDatenvertragswerk
wavelet matrix rank select audit
Construct the complete four-level wavelet matrix for an original0..64item sequence of numeric symbols0..15. Return levelbitmaps, prefixonecounts, zero_counts, stable original-index witnesses, finalpermutation/values and up to8prefixrank plus8occurrence-select answers. Rank uses half-open original prefix[0,end), select uses one-based occurrence and zero-based position or null if absent. Fixedfourbits including emptysequence/absentsymbol cases. Compare the whole supplied artifact by fieldname,.
POST https://datenvertrag.halowerk.com/v1/wavelet-matrix-rank-select-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| sequence | Siehe Schema | Ja | |
| rank_queries | array | Ja | |
| select_queries | array | Ja | |
| claimed_value | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"sequence": {
"anyOf": [
{
"type": "array",
"maxItems": 64,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
},
{
"type": "null"
}
]
},
"rank_queries": {
"type": "array",
"maxItems": 8,
"items": {
"type": "object",
"properties": {
"symbol": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"end": {
"type": "integer",
"minimum": 0,
"maximum": 64
}
},
"required": [
"symbol",
"end"
],
"additionalProperties": false
}
},
"select_queries": {
"type": "array",
"maxItems": 8,
"items": {
"type": "object",
"properties": {
"symbol": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"occurrence": {
"type": "integer",
"minimum": 1,
"maximum": 64
}
},
"required": [
"symbol",
"occurrence"
],
"additionalProperties": false
}
},
"claimed_value": {
"anyOf": [
{
"type": "object",
"properties": {
"width": {
"const": 4
},
"length": {
"type": "integer",
"minimum": 0,
"maximum": 64
},
"levels": {
"type": "array",
"minItems": 4,
"maxItems": 4,
"items": {
"type": "object",
"properties": {
"bit": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"bitmap": {
"type": "array",
"maxItems": 64,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 1
}
},
"ones_prefix": {
"type": "array",
"maxItems": 65,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 64
}
},
"zero_count": {
"type": "integer",
"minimum": 0,
"maximum": 64
},
"original_indices_before": {
"type": "array",
"maxItems": 64,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 63
}
}
},
"required": [
"bit",
"bitmap",
"ones_prefix",
"zero_count",
"original_indices_before"
],
"additionalProperties": false
}
},
"final_original_indices": {
"type": "array",
"maxItems": 64,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 63
}
},
"final_values": {
"type": "array",
"maxItems": 64,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
},
"rank_results": {
"type": "array",
"maxItems": 8,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 64
}
},
"select_results": {
"type": "array",
"maxItems": 8,
"items": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 63
},
{
"type": "null"
}
]
}
}
},
"required": [
"width",
"length",
"levels",
"final_original_indices",
"final_values",
"rank_results",
"select_results"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"sequence",
"rank_queries",
"select_queries",
"claimed_value"
],
"additionalProperties": false
}Veröffentlichtes Eingabebeispiel
{
"sequence": [
4,
7,
6,
5,
3,
2,
1,
0,
1,
4,
1,
7
],
"rank_queries": [
{
"symbol": 1,
"end": 0
},
{
"symbol": 3,
"end": 6
},
{
"symbol": 5,
"end": 12
},
{
"symbol": 7,
"end": 0
},
{
"symbol": 9,
"end": 6
},
{
"symbol": 11,
"end": 12
},
{
"symbol": 13,
"end": 0
},
{
"symbol": 15,
"end": 6
}
],
"select_queries": [
{
"symbol": 1,
"occurrence": 1
},
{
"symbol": 3,
"occurrence": 2
},
{
"symbol": 5,
"occurrence": 3
},
{
"symbol": 7,
"occurrence": 1
},
{
"symbol": 9,
"occurrence": 2
},
{
"symbol": 11,
"occurrence": 3
},
{
"symbol": 13,
"occurrence": 1
},
{
"symbol": 15,
"occurrence": 64
}
],
"claimed_value": {
"width": 4,
"length": 12,
"levels": [
{
"bit": 3,
"bitmap": [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
],
"ones_prefix": [
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0
],
"zero_count": 12,
"original_indices_before": [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11
]
},
{
"bit": 2,
"bitmap": [
1,
1,
1,
1,
0,
0,
0,
0,
0,
1,
0,
1
],
"ones_prefix": [
0,
1,
2,
3,
4,
4,
4,
4,
4,
4,
5,
5,
6
],
"zero_count": 6,
"original_indices_before": [
0,
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11
]
},
{
"bit": 1,
"bitmap": [
1,
1,
0,
0,
0,
0,
0,
1,
1,
0,
0,
1
],
"ones_prefix": [
0,
1,
2,
2,
2,
2,
2,
2,
3,
4,
4,
4,
5
],
"zero_count": 7,
"original_indices_before": [
4,
5,
6,
7,
8,
10,
0,
1,
2,
3,
9,
11
]
},
{
"bit": 0,
"bitmap": [
1,
0,
1,
1,
0,
1,
0,
1,
0,
1,
0,
1
],
"ones_prefix": [
0,
1,
1,
2,
3,
3,
4,
4,
5,
5,
6,
6,
7
],
"zero_count": 5,
"original_indices_before": [
6,
7,
8,
10,
0,
3,
9,
4,
5,
1,
2,
11
]
}
],
"final_original_indices": [
7,
0,
9,
5,
2,
6,
8,
10,
3,
4,
1,
11
],
"final_values": [
0,
4,
4,
2,
6,
1,
1,
1,
5,
3,
7,
7
],
"rank_results": [
0,
1,
1,
0,
0,
0,
0,
0
],
"select_results": [
6,
null,
null,
1,
null,
null,
null,
null
]
}
}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