<feed xmlns='http://www.w3.org/2005/Atom'>
<title>cmark/tools, branch master</title>
<subtitle>My own fork of cmark for commonmark conversion</subtitle>
<link rel='alternate' type='text/html' href='http://5.196.69.93/cmark/'/>
<entry>
<title>Minor fixes to xml2md.xsl</title>
<updated>2018-09-14T13:52:32+00:00</updated>
<author>
<name>Nick Wellnhofer</name>
<email>wellnhofer@aevum.de</email>
</author>
<published>2018-09-14T13:52:32+00:00</published>
<link rel='alternate' type='text/html' href='http://5.196.69.93/cmark/commit/?id=75870fbc450a9a973698ababa4eef35bbe63f747'/>
<id>75870fbc450a9a973698ababa4eef35bbe63f747</id>
<content type='text'>
- Remove outdated comment
- Fix code block delimiter
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
- Remove outdated comment
- Fix code block delimiter
</pre>
</div>
</content>
</entry>
<entry>
<title>XSLT stylesheet to convert cmark XML back to Commonmark</title>
<updated>2018-09-14T10:48:10+00:00</updated>
<author>
<name>Nick Wellnhofer</name>
<email>wellnhofer@aevum.de</email>
</author>
<published>2018-09-14T10:48:10+00:00</published>
<link rel='alternate' type='text/html' href='http://5.196.69.93/cmark/commit/?id=0707ada63bf5662c34b8f8fab60291840377217c'/>
<id>0707ada63bf5662c34b8f8fab60291840377217c</id>
<content type='text'>
Initial version of an XSLT stylesheet that converts the XML format
produced by `cmark -t xml` back to Commonmark.

Fixes #264
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
Initial version of an XSLT stylesheet that converts the XML format
produced by `cmark -t xml` back to Commonmark.

Fixes #264
</pre>
</div>
</content>
</entry>
<entry>
<title>Fix for non-matching entities (#161)</title>
<updated>2016-11-04T22:04:48+00:00</updated>
<author>
<name>Yuki Izumi</name>
<email>kivikakk@github.com</email>
</author>
<published>2016-11-04T22:04:48+00:00</published>
<link rel='alternate' type='text/html' href='http://5.196.69.93/cmark/commit/?id=64e1394ae76409f02b00c254f119a64a2d1ce11e'/>
<id>64e1394ae76409f02b00c254f119a64a2d1ce11e</id>
<content type='text'>
* Add test to illustrate issue

* Provide some test fixes

* Don't neglect CounterClockwiseContourIntegral

* Fix ~10% of cases not matching

strncmp returns 0 if the first 'len' bytes of cmark_entities[i].entity
match s; we check equal length in the first if by checking if
cmark_entities[i].entity[len] == 0, but we neglect the case where cmp ==
0 &amp;&amp; cmark_entities[i].entity[len] != 0.  This should be treated as the
same as cmp &lt; 0, because strcmp("abc", "abcd") &lt; 0.

* Don't depend on py3.3 in tests
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
* Add test to illustrate issue

* Provide some test fixes

* Don't neglect CounterClockwiseContourIntegral

* Fix ~10% of cases not matching

strncmp returns 0 if the first 'len' bytes of cmark_entities[i].entity
match s; we check equal length in the first if by checking if
cmark_entities[i].entity[len] == 0, but we neglect the case where cmp ==
0 &amp;&amp; cmark_entities[i].entity[len] != 0.  This should be treated as the
same as cmp &lt; 0, because strcmp("abc", "abcd") &lt; 0.

* Don't depend on py3.3 in tests
</pre>
</div>
</content>
</entry>
<entry>
<title>Test with multiple MSVC versions under Appveyor</title>
<updated>2016-03-12T10:04:37+00:00</updated>
<author>
<name>Nick Wellnhofer</name>
<email>wellnhofer@aevum.de</email>
</author>
<published>2016-03-12T10:04:37+00:00</published>
<link rel='alternate' type='text/html' href='http://5.196.69.93/cmark/commit/?id=8bff268ba84c67a1ac2761679457532439da482b'/>
<id>8bff268ba84c67a1ac2761679457532439da482b</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>Renamed entities.h -&gt; entities.inc.</title>
<updated>2015-06-17T15:05:57+00:00</updated>
<author>
<name>John MacFarlane</name>
<email>jgm@berkeley.edu</email>
</author>
<published>2015-06-17T15:05:57+00:00</published>
<link rel='alternate' type='text/html' href='http://5.196.69.93/cmark/commit/?id=2fa54428e2910d4f8d96e6a548db650d50613535'/>
<id>2fa54428e2910d4f8d96e6a548db650d50613535</id>
<content type='text'>
Also tools/make_entities_h.py -&gt; tools/make_entitis_inc.py.
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
Also tools/make_entities_h.py -&gt; tools/make_entitis_inc.py.
</pre>
</div>
</content>
</entry>
<entry>
<title>Simpler approach for entity lookup.</title>
<updated>2015-06-17T00:33:48+00:00</updated>
<author>
<name>John MacFarlane</name>
<email>jgm@berkeley.edu</email>
</author>
<published>2015-06-17T00:28:53+00:00</published>
<link rel='alternate' type='text/html' href='http://5.196.69.93/cmark/commit/?id=7e7819e05ec91bc7ca7859d119f1274cf3a83913'/>
<id>7e7819e05ec91bc7ca7859d119f1274cf3a83913</id>
<content type='text'>
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.)
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
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.)
</pre>
</div>
</content>
</entry>
<entry>
<title>make_entities_h.py: confirm there are no hash collisions.</title>
<updated>2015-06-16T23:31:52+00:00</updated>
<author>
<name>John MacFarlane</name>
<email>jgm@berkeley.edu</email>
</author>
<published>2015-06-16T23:31:52+00:00</published>
<link rel='alternate' type='text/html' href='http://5.196.69.93/cmark/commit/?id=54c087d1272b4ce756e56de68e8e6dfac6d159fc'/>
<id>54c087d1272b4ce756e56de68e8e6dfac6d159fc</id>
<content type='text'>
At least with valid data.
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
At least with valid data.
</pre>
</div>
</content>
</entry>
<entry>
<title>Mark entity data structures as const.</title>
<updated>2015-06-16T21:24:59+00:00</updated>
<author>
<name>John MacFarlane</name>
<email>jgm@berkeley.edu</email>
</author>
<published>2015-06-16T21:15:32+00:00</published>
<link rel='alternate' type='text/html' href='http://5.196.69.93/cmark/commit/?id=76ed9a65b03b2477628c0bf72855cc4686642574'/>
<id>76ed9a65b03b2477628c0bf72855cc4686642574</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>entities: Make the first entity in the array (TripleDot) work.</title>
<updated>2015-06-16T20:24:05+00:00</updated>
<author>
<name>John MacFarlane</name>
<email>jgm@berkeley.edu</email>
</author>
<published>2015-06-16T20:24:05+00:00</published>
<link rel='alternate' type='text/html' href='http://5.196.69.93/cmark/commit/?id=9f1bb45d9b1a43daa229714d4eb83e981a187f92'/>
<id>9f1bb45d9b1a43daa229714d4eb83e981a187f92</id>
<content type='text'>
We now use -1 instead of 0 to indicate leaf nodes.
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
We now use -1 instead of 0 to indicate leaf nodes.
</pre>
</div>
</content>
</entry>
<entry>
<title>Replace gperf-based entity lookup with binary tree lookup.</title>
<updated>2015-06-16T19:59:47+00:00</updated>
<author>
<name>John MacFarlane</name>
<email>jgm@berkeley.edu</email>
</author>
<published>2015-06-16T16:54:31+00:00</published>
<link rel='alternate' type='text/html' href='http://5.196.69.93/cmark/commit/?id=208c794def61eb819ed6eebe1d51867613addce0'/>
<id>208c794def61eb819ed6eebe1d51867613addce0</id>
<content type='text'>
The primary advantage is a big reduction in the size of
the compiled library and executable (&gt; 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`.
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
The primary advantage is a big reduction in the size of
the compiled library and executable (&gt; 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`.
</pre>
</div>
</content>
</entry>
</feed>
