The automation of generation of table of contents requires time which can be spent on the development.
The following ToC generator for md appears to be decent: https://crates.io/crates/markdown-toc
Being maximally fast is the the main goal of this crate. For that reason, mathematical reasoning about its performance in conjunction with experiments to prove or refute the theory must be presented. Definitions, signs, and properties of the crate will reveal its mathematical foundations.
The terminology widely used in the crate
Declarative macro pattern is a pattern for matching TokenTrees in declarative macros
/"macros by example"/macro_rules!/plain macros. For example,
pattern. Learn more about declarative macro patterns and designators.
Features of particular entities that allow to claim that they are in fact also have the propety of being something else. For example, if the left operand of a summation is 1 and the right operand of the summation is 1, we can guarantee that the result of the operation is 2.
In a non-empty :ty TokenTree sequence, the first :ty TokenTree cluster starts at index 0 and each consequent occurence of a ":" TokenTree::Punct followed by a "ty" TokenTree::Ident marks the end of the current :ty TokenTree cluster and, if there are more TokenTrees, is immediately followed by the beginning of the next :ty TokenTree cluster. In an empty :ty TokenTree sequence, there are no :ty TokenTree clusters.
[Finite State Machine] for [counting] [:ty TokenTree cluster]s in [:ty TokenStream]s and other [:ty TokenTree cluster sequence]s
Defines a multiplicative identity element for