| Age | Commit message (Collapse) | Author |
|---|
|
We dispense with the hashes and just do string comparsions.
Since the array is in order, we can search intelligently
and should never need to do more than 8 or so comparisons.
This reduces binary size even further, at a small cost
in performance. (This shouldn't matter too much, as
it's only detectable in really entity-heavy sources.)
|
|
At least with valid data.
|
|
|
|
We now use -1 instead of 0 to indicate leaf nodes.
|
|
The primary advantage is a big reduction in the size of
the compiled library and executable (> 100K).
There should be no measurable performance difference in
normal documents. I detected a slight performance
hit (around 5%) in a file containing 1,000,000 entities.
* Removed `src/html_unescape.gperf` and `src/html_unescape.h`.
* Added `src/entities.h` (generated by `tools/make_entities_h.py`).
* Added binary tree lookup functions to `houdini_html_u.c`, and
use the data in `src/entities.h`.
|
|
|
|
<https://github.com/jgm/commonmark.js>
|
|
And a script to run them.
|
|
|
|
This broke when we switched from pandoc to cmark for the spec,
because the class on code changed from 'markdown' to
'language-markdown'.
|
|
These were inadvertently dropped in the commit that described
them as being moved to tools/.
|
|
|
|
|
|
|
