cmark

My personal build of CMark ✏️

Commit: 8f485e954ba01432f78a191db97c2e62164b24cb
Parent: 1f6e14ad253ab3758f507e177b131b8e487076c0
Author: John MacFarlane <jgm@berkeley.edu>
Date: Fri, 7 Aug 2015 12:49:12 -0700

cmark.3 man page - regenerated with smart.

Diffstat

1 file changed, 6 insertions, 5 deletions

Status	File Name	N° Changes	Insertions	Deletions
Modified	man/man3/cmark.3	11	6	5

diff --git a/man/man3/cmark.3 b/man/man3/cmark.3
@@ -1,4 +1,4 @@
-.TH cmark 3 "July 27, 2015" "LOCAL" "Library Functions Manual"
+.TH cmark 3 "August 07, 2015" "LOCAL" "Library Functions Manual"
 .SH
 NAME
 .PP
@@ -28,8 +28,8 @@ Creating and Destroying Nodes
 
 .PP
 Creates a new node of type \f[I]type\f[]. Note that the node may have
-other required properties, which it is the caller's responsibility to
-assign.
+other required properties, which it is the caller\[cq]s responsibility
+to assign.
 
 .PP
 \fIvoid\f[] \fBcmark_node_free\f[](\fIcmark_node *node\f[])
@@ -285,7 +285,8 @@ Returns 1 if \f[I]node\f[] is a tight list, 0 otherwise.
 \fIint\f[] \fBcmark_node_set_list_tight\f[](\fIcmark_node *node\f[], \fIint tight\f[])
 
 .PP
-Sets the "tightness" of a list. Returns 1 on success, 0 on failure.
+Sets the \[lq]tightness\[rq] of a list. Returns 1 on success, 0 on
+failure.
 
 .PP
 \fIconst char *\f[] \fBcmark_node_get_fence_info\f[](\fIcmark_node *node\f[])
@@ -553,7 +554,7 @@ Normalize tree by consolidating adjacent text nodes.
 .fi
 
 .PP
-Convert straight quotes to curly, \-\-\- to em dashes, \-\- to en
+Convert straight quotes to curly, \[em] to em dashes, \[en] to en
 dashes.
 
 .PP