1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
|
#
# node_c.py
#
# Copyright (C) 2017-2022 Franco Masotti (see /README.md)
#
# This file is part of md-toc.
#
# md-toc is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# md-toc is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with md-toc. If not, see <http://www.gnu.org/licenses/>.
#
r"""A cmark implementation file."""
import copy
from ..constants import parser as md_parser
from .cmark_h import _cmarkCmarkMem
from .node_h import _cmarkCmarkNode, _cmarkCmarkNodeType
# License C applies to this file except for non derivative code:
# in that case the license header at the top of the file applies.
# See docs/copyright_license.rst
# 0.30
def _cmark_S_is_block(node: _cmarkCmarkNode) -> bool:
if node is None:
return False
return (node.type >= _cmarkCmarkNodeType.CMARK_NODE_FIRST_BLOCK.value
and node.type <= _cmarkCmarkNodeType.CMARK_NODE_LAST_BLOCK.value)
# 0.30
def _cmark_S_is_inline(node: _cmarkCmarkNode) -> bool:
if node is None:
return False
return (node.type >= _cmarkCmarkNodeType.CMARK_NODE_FIRST_INLINE.value
and node.type <= _cmarkCmarkNodeType.CMARK_NODE_LAST_INLINE.value)
# 0.30
def _cmark_S_can_contain(node: _cmarkCmarkNode,
child: _cmarkCmarkNode) -> bool:
if (node is None or child is None or node == child):
return False
# Verify that child is not an ancestor of node.
if child.first_child is not None:
cur: _cmarkCmarkNode = node.parent
while cur is not None:
if cur == child:
return False
cur = cur.parent
if child.type == _cmarkCmarkNodeType.CMARK_NODE_DOCUMENT.value:
return False
if node.type in [
_cmarkCmarkNodeType.CMARK_NODE_DOCUMENT.value,
_cmarkCmarkNodeType.CMARK_NODE_BLOCK_QUOTE.value,
_cmarkCmarkNodeType.CMARK_NODE_ITEM.value,
]:
return _cmark_S_is_block(
child) and child.type != _cmarkCmarkNodeType.CMARK_NODE_ITEM.value
elif node.type in [_cmarkCmarkNodeType.CMARK_NODE_LIST.value]:
return child.type == _cmarkCmarkNodeType.CMARK_NODE_ITEM.value
elif node.type in [_cmarkCmarkNodeType.CMARK_NODE_CUSTOM_BLOCK.value]:
return True
elif node.type in [
_cmarkCmarkNodeType.CMARK_NODE_PARAGRAPH.value,
_cmarkCmarkNodeType.CMARK_NODE_HEADING.value,
_cmarkCmarkNodeType.CMARK_NODE_EMPH.value,
_cmarkCmarkNodeType.CMARK_NODE_STRONG.value,
_cmarkCmarkNodeType.CMARK_NODE_LINK.value,
_cmarkCmarkNodeType.CMARK_NODE_IMAGE.value,
_cmarkCmarkNodeType.CMARK_NODE_CUSTOM_INLINE.value,
]:
return _cmark_S_is_inline(child)
return False
# Free a cmark_node list and any children.
# 0.30
def _cmark_S_free_nodes(e: _cmarkCmarkNode):
# mem: _cmarkCmarkMem = e.mem
next: _cmarkCmarkNode
while e is not None:
if e.type in [_cmarkCmarkNodeType.CMARK_NODE_CODE_BLOCK.value]:
del e.data
del e.as_code.info
e.data = ''
e.as_code.info = ''
elif e.type in [
_cmarkCmarkNodeType.CMARK_NODE_TEXT.value,
_cmarkCmarkNodeType.CMARK_NODE_HTML_INLINE.value,
_cmarkCmarkNodeType.CMARK_NODE_CODE.value,
_cmarkCmarkNodeType.CMARK_NODE_HTML_BLOCK.value,
]:
del e.data
e.data = ''
elif e.type in [
_cmarkCmarkNodeType.CMARK_NODE_LINK.value,
_cmarkCmarkNodeType.CMARK_NODE_IMAGE.value,
]:
del e.as_link.url
del e.as_link.title
e.as_link.url = ''
e.as_link.title = ''
elif e.type in [
_cmarkCmarkNodeType.CMARK_NODE_CUSTOM_BLOCK.value,
_cmarkCmarkNodeType.CMARK_NODE_CUSTOM_INLINE.value,
]:
del e.as_custom.on_enter
del e.as_custom.on_exit
e.as_custom.on_enter = ''
e.as_custom.on_exit = ''
if e.last_child:
# Splice children into list
e.last_child.next = e.next
e.next = e.first_child
next = e.next
# mem->free(e);
del e
e = next
# 0.30
def _cmark_cmark_node_free(node: _cmarkCmarkNode):
_cmark_S_node_unlink(node)
node.next = None
_cmark_S_free_nodes(node)
# 0.30
def _cmark_cmark_set_cstr(mem: _cmarkCmarkMem, dst: str, src: str) -> tuple:
old: str = dst
length: int
if src and src[0]:
length = len(src)
# Alternative to:
# *dst = (unsigned char *)mem->realloc(NULL, len + 1);
# memcpy(*dst, src, len + 1);
dst = copy.deepcopy(src[:length + 1])
else:
length = 0
dst = ''
if old:
# Alternative to:
# mem->free(old);
del old
del dst
dst = ''
return length, dst
# 0.30
def _cmark_cmark_node_set_literal(node: _cmarkCmarkNode, content: str) -> int:
length: int
data: str
if node is None:
return 0
if (node.type == _cmarkCmarkNodeType.CMARK_NODE_HTML_BLOCK.value
or node.type == _cmarkCmarkNodeType.CMARK_NODE_TEXT.value
or node.type == _cmarkCmarkNodeType.CMARK_NODE_HTML_INLINE.value
or node.type == _cmarkCmarkNodeType.CMARK_NODE_CODE.value
or node.type == _cmarkCmarkNodeType.CMARK_NODE_CODE_BLOCK.value):
length, data = _cmark_cmark_set_cstr(node.mem, node.data, content)
node.length = length
node.data = data
return 1
return 0
# 0.29, 0.30
# Unlink a node without adjusting its next, prev, and parent pointers.
def _cmark_S_node_unlink(node: _cmarkCmarkNode):
if node is None:
return
if node.prev:
node.prev.next = node.next
if node.next:
node.next.prev = node.prev
# Adjust first_child and last_child of parent.
# Start and end pointers.
parent: _cmarkCmarkNode = node.parent
if parent:
if parent.first_child == node:
parent.first_child = node.next
if parent.last_child == node:
parent.last_child = node.prev
# 0.30
def _cmark_cmark_node_unlink(node: _cmarkCmarkNode):
_cmark_S_node_unlink(node)
node.next = None
node.prev = None
node.parent = None
# Inserts 'sibling' before 'node'. Returns 1 on success, 0 on failure.
# 0.30
def _cmark_cmark_node_insert_before(node: _cmarkCmarkNode,
sibling: _cmarkCmarkNode) -> int:
if node is None or sibling is None:
return 0
if not node.parent or not _cmark_S_can_contain(node.parent, sibling):
return 0
_cmark_S_node_unlink(sibling)
old_prev: _cmarkCmarkNode = node.prev
# Insert 'sibling' between 'old_prev' and 'node'.
if old_prev:
old_prev.next = sibling
sibling.prev = old_prev
sibling.next = node
node.prev = sibling
# Set new parent.
parent: _cmarkCmarkNode = node.parent
sibling.parent = parent
# Adjust first_child of parent if inserted as first child.
if parent and not old_prev:
parent.first_child = sibling
return 1
def _cmark_cmark_node_insert_after(node: _cmarkCmarkNode,
sibling: _cmarkCmarkNode) -> int:
if node is None or sibling is None:
return 0
if not node.parent or not _cmark_S_can_contain(node.parent, sibling):
return 0
_cmark_S_node_unlink(sibling)
old_next = node.next
# Insert 'sibling' between 'node' and 'old_next'.
if old_next:
old_next.prev = sibling
sibling.next = old_next
sibling.prev = node
node.next = sibling
# Set new parent.
parent: _cmarkCmarkNode = node.parent
sibling.parent = parent
# Adjust last_child of parent if inserted as last child.
if parent and not old_next:
parent.last_child = sibling
return 1
if __name__ == '__main__':
pass
|
