Follow-up Comment #5, bug #62950 (project groff): I am still testing, but the coding is done. I am still lazy, but we can live in hope!
As regards grops the simplest implementation would be to change my two hashes into two arrays of fontname fontpath structures (as it probably does now), for valid and invalid entries. Then just a loop over the array to find matching font name. Most of the code is probably already there, would need a pointer to operate on either the valid or invalid array. I do like Ralph's algorithm and it is more efficient, but the saving would be miniscule compared to over all run time, and it would require a bit more changes to gropdf and I refer to my second sentence above. _______________________________________________________ Reply to this item at: <https://savannah.gnu.org/bugs/?62950> _______________________________________________ Message sent via Savannah https://savannah.gnu.org/