aboutsummaryrefslogtreecommitdiff
path: root/man/man3/cmark.3
blob: 68ce5286eac005e7bece88f717b8b15c852fab2c (plain)
  1. .TH cmark 3 "December 13, 2014" "LOCAL" "Library Functions Manual"
  2. .SH
  3. NAME
  4. .PP
  5. \f[B]cmark\f[] \- CommonMark parsing, manipulating, and rendering
  6. .SH
  7. DESCRIPTION
  8. .SS
  9. Simple Interface
  10. .nf
  11. \fC
  12. .RS 0n
  13. #define CMARK_VERSION "0.1"
  14. .RE
  15. \f[]
  16. .fi
  17. Current version of library.
  18. \fIchar *\f[] \fBcmark_markdown_to_html\f[](\fIconst char *text\f[], \fIint len\f[])
  19. Convert \fItext\f[] (assumed to be a UTF-8 encoded string with length
  20. \fIlen\f[] from CommonMark Markdown to HTML, returning a null-terminated,
  21. UTF-8-encoded string.
  22. .SS
  23. Node Structure
  24. .nf
  25. \fC
  26. .RS 0n
  27. typedef enum {
  28. /* Error status */
  29. CMARK_NODE_NONE,
  30. /* Block */
  31. CMARK_NODE_DOCUMENT,
  32. CMARK_NODE_BLOCK_QUOTE,
  33. CMARK_NODE_LIST,
  34. CMARK_NODE_LIST_ITEM,
  35. CMARK_NODE_CODE_BLOCK,
  36. CMARK_NODE_HTML,
  37. CMARK_NODE_PARAGRAPH,
  38. CMARK_NODE_HEADER,
  39. CMARK_NODE_HRULE,
  40. CMARK_NODE_FIRST_BLOCK = CMARK_NODE_DOCUMENT,
  41. CMARK_NODE_LAST_BLOCK = CMARK_NODE_HRULE,
  42. /* Inline */
  43. CMARK_NODE_TEXT,
  44. CMARK_NODE_SOFTBREAK,
  45. CMARK_NODE_LINEBREAK,
  46. CMARK_NODE_INLINE_CODE,
  47. CMARK_NODE_INLINE_HTML,
  48. CMARK_NODE_EMPH,
  49. CMARK_NODE_STRONG,
  50. CMARK_NODE_LINK,
  51. CMARK_NODE_IMAGE,
  52. CMARK_NODE_FIRST_INLINE = CMARK_NODE_TEXT,
  53. CMARK_NODE_LAST_INLINE = CMARK_NODE_IMAGE,
  54. } cmark_node_type;
  55. .RE
  56. \f[]
  57. .fi
  58. .nf
  59. \fC
  60. .RS 0n
  61. typedef enum {
  62. CMARK_NO_LIST,
  63. CMARK_BULLET_LIST,
  64. CMARK_ORDERED_LIST
  65. } cmark_list_type;
  66. .RE
  67. \f[]
  68. .fi
  69. .nf
  70. \fC
  71. .RS 0n
  72. typedef enum {
  73. CMARK_PERIOD_DELIM,
  74. CMARK_PAREN_DELIM
  75. } cmark_delim_type;
  76. .RE
  77. \f[]
  78. .fi
  79. .SS
  80. Creating and Destroying Nodes
  81. \fIcmark_node*\f[] \fBcmark_node_new\f[](\fIcmark_node_type type\f[])
  82. \fIvoid\f[] \fBcmark_node_free\f[](\fIcmark_node *node\f[])
  83. .SS
  84. Tree Traversal
  85. \fIcmark_node*\f[] \fBcmark_node_previous\f[](\fIcmark_node *node\f[])
  86. \fIcmark_node*\f[] \fBcmark_node_parent\f[](\fIcmark_node *node\f[])
  87. \fIcmark_node*\f[] \fBcmark_node_first_child\f[](\fIcmark_node *node\f[])
  88. \fIcmark_node*\f[] \fBcmark_node_last_child\f[](\fIcmark_node *node\f[])
  89. .SS
  90. Iterator
  91. \fIcmark_iter*\f[] \fBcmark_iter_new\f[](\fIcmark_node *root\f[])
  92. \fIvoid\f[] \fBcmark_iter_free\f[](\fIcmark_iter *iter\f[])
  93. \fIcmark_event_type\f[] \fBcmark_iter_next\f[](\fIcmark_iter *iter\f[])
  94. \fIcmark_node*\f[] \fBcmark_iter_get_node\f[](\fIcmark_iter *iter\f[])
  95. .SS
  96. Accessors
  97. \fIcmark_node_type\f[] \fBcmark_node_get_type\f[](\fIcmark_node *node\f[])
  98. \fIconst char*\f[] \fBcmark_node_get_string_content\f[](\fIcmark_node *node\f[])
  99. \fIint\f[] \fBcmark_node_set_string_content\f[](\fIcmark_node *node\f[], \fIconst char *content\f[])
  100. \fIint\f[] \fBcmark_node_get_header_level\f[](\fIcmark_node *node\f[])
  101. \fIint\f[] \fBcmark_node_set_header_level\f[](\fIcmark_node *node\f[], \fIint level\f[])
  102. \fIcmark_list_type\f[] \fBcmark_node_get_list_type\f[](\fIcmark_node *node\f[])
  103. \fIint\f[] \fBcmark_node_set_list_type\f[](\fIcmark_node *node\f[], \fIcmark_list_type type\f[])
  104. \fIint\f[] \fBcmark_node_get_list_start\f[](\fIcmark_node *node\f[])
  105. \fIint\f[] \fBcmark_node_set_list_start\f[](\fIcmark_node *node\f[], \fIint start\f[])
  106. \fIint\f[] \fBcmark_node_get_list_tight\f[](\fIcmark_node *node\f[])
  107. \fIint\f[] \fBcmark_node_set_list_tight\f[](\fIcmark_node *node\f[], \fIint tight\f[])
  108. \fIconst char*\f[] \fBcmark_node_get_fence_info\f[](\fIcmark_node *node\f[])
  109. \fIint\f[] \fBcmark_node_set_fence_info\f[](\fIcmark_node *node\f[], \fIconst char *info\f[])
  110. \fIconst char*\f[] \fBcmark_node_get_url\f[](\fIcmark_node *node\f[])
  111. \fIint\f[] \fBcmark_node_set_url\f[](\fIcmark_node *node\f[], \fIconst char *url\f[])
  112. \fIconst char*\f[] \fBcmark_node_get_title\f[](\fIcmark_node *node\f[])
  113. \fIint\f[] \fBcmark_node_set_title\f[](\fIcmark_node *node\f[], \fIconst char *title\f[])
  114. \fIint\f[] \fBcmark_node_get_start_line\f[](\fIcmark_node *node\f[])
  115. \fIint\f[] \fBcmark_node_get_start_column\f[](\fIcmark_node *node\f[])
  116. \fIint\f[] \fBcmark_node_get_end_line\f[](\fIcmark_node *node\f[])
  117. .SS
  118. Tree Manipulation
  119. \fIvoid\f[] \fBcmark_node_unlink\f[](\fIcmark_node *node\f[])
  120. \fIint\f[] \fBcmark_node_insert_before\f[](\fIcmark_node *node\f[], \fIcmark_node *sibling\f[])
  121. \fIint\f[] \fBcmark_node_insert_after\f[](\fIcmark_node *node\f[], \fIcmark_node *sibling\f[])
  122. \fIint\f[] \fBcmark_node_prepend_child\f[](\fIcmark_node *node\f[], \fIcmark_node *child\f[])
  123. \fIint\f[] \fBcmark_node_append_child\f[](\fIcmark_node *node\f[], \fIcmark_node *child\f[])
  124. .SS
  125. Parsing
  126. \fIcmark_parser *\f[] \fBcmark_parser_new\f[](\fI\f[])
  127. \fIvoid\f[] \fBcmark_parser_free\f[](\fIcmark_parser *parser\f[])
  128. \fIcmark_node *\f[] \fBcmark_parser_finish\f[](\fIcmark_parser *parser\f[])
  129. \fIvoid\f[] \fBcmark_parser_feed\f[](\fIcmark_parser *parser\f[], \fIconst char *buffer\f[], \fIsize_t len\f[])
  130. \fIcmark_node *\f[] \fBcmark_parse_document\f[](\fIconst char *buffer\f[], \fIsize_t len\f[])
  131. \fIcmark_node *\f[] \fBcmark_parse_file\f[](\fIFILE *f\f[])
  132. .SS
  133. Rendering
  134. \fIchar *\f[] \fBcmark_render_ast\f[](\fIcmark_node *root\f[])
  135. \fIchar *\f[] \fBcmark_render_html\f[](\fIcmark_node *root\f[])
  136. \fIchar *\f[] \fBcmark_render_man\f[](\fIcmark_node *root\f[])
  137. .SH
  138. AUTHORS
  139. .PP
  140. John MacFarlane, Vicent Marti, Kārlis Gaņģis, Nick Wellnhofer.