This parser only reads the standard 8 character keywords, and ignores the CONTINUE, COMMENT, HISTORY and HIERARCH cards. The goal is to find quickly the structural keywords needed to build the HDU objects.
The implementation is straightforward: first iterate on the 2880-bytes blocks, then iterate on the 80-bytes cards, find the value separator, and store the parsed (keyword, card image) in a dictionary.
Fast (and incomplete) parser for FITS headers.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them
