| Age | Commit message (Collapse) | Author |
|---|
|
Use in link label parsing and reference lookup.
|
|
This brings back segfaults, but we're now aiming for a better solution,
revising the renderer so it doesn't use recursion, and using a stack
approach for nested brackets. Removing these limits will allow us to
know when we've got it right.
See #166, #187.
|
|
We'll also use it in parsing bracketed link labels.
|
|
If we get more than 1000 deep in potential emphasis/strong emphasis
openers, we refuse to add more to the stack. This prevents the
sort of stack overflow we previously got with
python -c 'print "*a **a " * 100000; print " a** a*" * 100000' | ./cmark
Partially addresses #166.
|
|
Also renamed internal library functions accordingly.
|
