HALOWERKDatenvertragswerk
finite chained glyph lookup audit
A font/layout fixture maintainer checks whole output glyphs and execution-event claims against original logical glyphs, ordered context rules and nested Single or first internal2-to-1 Ligature records. Own nonexpanding normalized HarfBuzz10.4.0 reader profile, commit3ef8709829a5884517ad91a97b32b9435b2f20d1. Flags0 and neutral metadata; no mark skipping, font download, general OpenType/HarfBuzz conformance or rendering judgment. Missing capture stays unknown; known counterclaims dominate..
POST https://datenvertrag.halowerk.com/v1/finite-chained-glyph-lookup-auditEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| glyphs | array | Ja | |
| top_lookup | object | Ja | |
| lookups | array | Ja | |
| report | object | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"properties": {
"glyphs": {
"type": "array",
"items": {
"type": [
"integer",
"null"
],
"minimum": 0,
"maximum": 65535
},
"minItems": 0,
"maxItems": 12
},
"top_lookup": {
"type": "object",
"properties": {
"flags": {
"const": 0
},
"rules": {
"type": "array",
"items": {
"anyOf": [
{
"type": "object",
"properties": {
"input": {
"type": [
"array",
"null"
],
"items": {
"type": [
"integer",
"null"
],
"minimum": 0,
"maximum": 65535
},
"minItems": 2,
"maxItems": 4
},
"records": {
"type": [
"array",
"null"
],
"items": {
"anyOf": [
{
"type": "object",
"properties": {
"sequence_index": {
"type": [
"integer",
"null"
],
"minimum": 0,
"maximum": 3
},
"lookup_index": {
"type": [
"integer",
"null"
],
"minimum": 0,
"maximum": 5
}
},
"required": [
"sequence_index",
"lookup_index"
],
"additionalProperties": false
},
{
"type": "null"
}
]
},
"minItems": 0,
"maxItems": 2
}
},
"required": [
"backtrack",
"input",
"lookahead",
"records"
],
"additionalProperties": {
"type": [
"array",
"null"
],
"items": {
"type": [
"integer",
"null"
],
"minimum": 0,
"maximum": 65535
},
"minItems": 0,
"maxItems": 2
},
"propertyNames": {
"enum": [
"backtrack",
"input",
"lookahead",
"records"
]
}
},
{
"type": "null"
}
]
},
"minItems": 0,
"maxItems": 4
}
},
"required": [
"flags",
"rules"
],
"additionalProperties": false
},
"lookups": {
"type": "array",
"items": {
"anyOf": [
{
"type": "object",
"properties": {
"kind": {
"const": "single"
},
"flags": {
"const": 0
},
"rules": {
"type": [
"array",
"null"
],
"items": {
"anyOf": [
{
"type": "object",
"required": [
"from",
"to"
],
"additionalProperties": {
"type": [
"integer",
"null"
],
"minimum": 0,
"maximum": 65535
},
"propertyNames": {
"enum": [
"from",
"to"
]
}
},
{
"type": "null"
}
]
},
"minItems": 0,
"maxItems": 4
}
},
"required": [
"kind",
"flags",
"rules"
],
"additionalProperties": false
},
{
"type": "object",
"properties": {
"kind": {
"const": "ligature"
},
"flags": {
"const": 0
},
"rules": {
"type": [
"array",
"null"
],
"items": {
"anyOf": [
{
"type": "object",
"properties": {
"components": {
"type": [
"array",
"null"
],
"items": {
"type": [
"integer",
"null"
],
"minimum": 0,
"maximum": 65535
},
"minItems": 2,
"maxItems": 2
},
"to": {
"type": [
"integer",
"null"
],
"minimum": 0,
"maximum": 65535
}
},
"required": [
"components",
"to"
],
"additionalProperties": false
},
{
"type": "null"
}
]
},
"minItems": 0,
"maxItems": 4
}
},
"required": [
"kind",
"flags",
"rules"
],
"additionalProperties": false
}
]
},
"minItems": 0,
"maxItems": 6
},
"report": {
"type": "object",
"properties": {
"glyphs": {
"type": "object",
"properties": {
"known": {
"type": "boolean"
},
"value": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 65535
},
"minItems": 0,
"maxItems": 16
}
},
"required": [
"known",
"value"
],
"additionalProperties": false
},
"events": {
"type": "object",
"properties": {
"known": {
"type": "boolean"
},
"value": {
"type": "array",
"items": {
"type": "object",
"properties": {
"kind": {
"enum": [
"no_match",
"context_match",
"substituted",
"no_substitution",
"stale_skip",
"resume"
]
},
"rule": {
"type": [
"integer",
"null"
],
"minimum": 0,
"maximum": 3
},
"record": {
"type": [
"integer",
"null"
],
"minimum": 0,
"maximum": 1
},
"cursor": {
"type": [
"integer",
"null"
],
"minimum": 0,
"maximum": 12
},
"sequence_index": {
"type": [
"integer",
"null"
],
"minimum": 0,
"maximum": 3
},
"lookup": {
"type": [
"integer",
"null"
],
"minimum": 0,
"maximum": 5
},
"operation": {
"enum": [
"single",
"ligature",
null
]
},
"before": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 65535
},
"minItems": 0,
"maxItems": 4
},
"after": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 65535
},
"minItems": 0,
"maxItems": 4
},
"input_end": {
"type": "integer",
"minimum": 0,
"maximum": 12
}
},
"required": [
"kind",
"rule",
"record",
"cursor",
"sequence_index",
"lookup",
"operation",
"before",
"after",
"input_end"
],
"additionalProperties": false
},
"minItems": 0,
"maxItems": 40
}
},
"required": [
"known",
"value"
],
"additionalProperties": false
}
},
"required": [
"glyphs",
"events"
],
"additionalProperties": false
}
},
"required": [
"glyphs",
"top_lookup",
"lookups",
"report"
],
"additionalProperties": false,
"$schema": "http://json-schema.org/draft-07/schema#"
}Veröffentlichtes Eingabebeispiel
{
"glyphs": [],
"top_lookup": {
"flags": 0,
"rules": [
null
]
},
"lookups": [
{
"kind": "single",
"flags": 0,
"rules": null
}
],
"report": {
"glyphs": {
"known": true,
"value": []
},
"events": {
"known": true,
"value": []
}
}
}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